On the public citation graph

Proving total correctness of nondeterministic programs in infinitary logic

https://doi.org/10.1007/bf00289263
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-09237-4openalex-snapshot
First-Order Dynamic Logic
inferredcites →https://doi.org/10.1007/3-540-10003-2_59openalex-snapshot
Semantics of unbounded nondeterminism
inferredcites →https://doi.org/10.1007/978-1-4612-3086-1openalex-snapshot
Mathematical Foundations of Computer Science
inferredcites →https://doi.org/10.1007/bf00289091openalex-snapshot
do considered od: A contribution to the programming calculus
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1007/bfb0079682openalex-snapshot
Remarks on the theory of geometrical constructions
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50036-8openalex-snapshot
LOGIC WITH DENUMERABLY LONG FORMULAS AND FINITE STRINGS OF QUANTIFIERS**The author is very much indebted to Carol Karp, E. G. K. Lopez-Escobar, and Czeslaw Ryll-Nardzewski for much stimulating correspondence and many interesting conversations on the topic of this paper.
inferredcites →https://doi.org/10.1016/s0049-237x(08)71097-8openalex-snapshot
An Introduction to First-Order Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71098-xopenalex-snapshot
Fundamentals of Model Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7021-1openalex-snapshot
Languages with Expressions of Infinite Length
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7034-xopenalex-snapshot
Model Theory For Infinitary Logic
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1145/69622.357189openalex-snapshot
A Weaker Precondition for Loops
inferredcites →https://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferredcites →https://doi.org/10.2307/2272694openalex-snapshot
A. Salwicki. Formalized algorithmic languages. English with English and Russian summaries. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 18 (1970), pp. 227–232, XVII, XVII. - A. Salwicki. On the equivalence of FS-expressions and…
inferredcites →https://doi.org/10.2307/2314842openalex-snapshot
Languages with Expressions of Infinite Length.
inferredcites →https://doi.org/10.4064/-2-1-7-99openalex-snapshot
An introduction to algorithmic logic. Metamathematical investigations in the theory of programs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1998.2731openalex-snapshot
Verifiable Properties of Database Transactions
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_48openalex-snapshot
Dijkstra's predicate transformers and smyth's powerdomains
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_29openalex-snapshot
Algebraically specified programming systems and Hoare's logic
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_28openalex-snapshot
Proving total correctness of programs in weak second-order logic
inferred← citeshttps://doi.org/10.1007/bf00268074openalex-snapshot
A simple fixpoint argument without the restriction to continuity
inferred← citeshttps://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferred← citeshttps://doi.org/10.1007/bf01211617openalex-snapshot
The rely-guarantee method for verifying shared variable concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0039067openalex-snapshot
A programming logic for formal concurrent systems
inferred← citeshttps://doi.org/10.1007/s00165-012-0249-0openalex-snapshot
In praise of algebra
inferred← citeshttps://doi.org/10.1007/s002360050150openalex-snapshot
Dijkstra-Scholten predicate calculus: concepts and misconceptions
inferred← citeshttps://doi.org/10.1007/s11191-008-9147-5openalex-snapshot
The Concept of Nondeterminism: Its Development and Implications for Teaching
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90027-5openalex-snapshot
Some natural structures which fail to possess a sound and decidable hoare-like logic for their while-programs
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90055-5openalex-snapshot
A continuous semantics for unbounded nondeterminism
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90167-7openalex-snapshot
While-programs with nondeterministic assignments and the logic ALNA
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00184-kopenalex-snapshot
Formalizing Dijkstra's predicate transformer wp in weak second-order logic
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90091-4openalex-snapshot
Stratified least fixpoint logic
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90069-2openalex-snapshot
A logic of recursion
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/j.scico.2009.11.001openalex-snapshot
Combining dynamic and static slicing for analysing assembler
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80725-xopenalex-snapshot
Soundness of a purely syntactical formalization of weakest preconditions
inferred← citeshttps://doi.org/10.1109/hicss.1989.47997openalex-snapshot
Changing data representation in the refinement calculus
inferred← citeshttps://doi.org/10.1109/sefm.2003.1236210openalex-snapshot
A partial-correctness semantics for modelling assembler programs
inferred← citeshttps://doi.org/10.1145/1595453.1595495openalex-snapshot
The concept of nondeterminism
inferred← citeshttps://doi.org/10.1145/237661.237692openalex-snapshot
Verifiable properties of database transactions
inferred← citeshttps://doi.org/10.1145/6490.6494openalex-snapshot
Countable nondeterminism and random assignment
inferred← citeshttps://doi.org/10.1201/9781420064872-10openalex-snapshot
Refinement of Parallel Algorithms
inferred← citeshttps://doi.org/10.1201/9781420064872.ch3openalex-snapshot
Refinement of Parallel Algorithms
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.6378openalex-snapshot
From Object-Oriented Specification to Implementation: A Formal Refinement Methodology.
inferred← citeshttps://doi.org/10.4018/978-1-4666-4229-4.ch012openalex-snapshot
Demonic Fuzzy Relational Calculus
inferred← citeshttps://doi.org/10.4018/978-1-4666-7456-1.ch018openalex-snapshot
Demonic Fuzzy Relational Calculus
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.