On the public citation graph

Predicate-transformer semantics of general recursion

https://doi.org/10.1007/bf00276020
0 signed · 27 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-07854-1_217openalex-snapshot
DIJKSTRA's predicate transformer, non-determinism, recursion, and termination
inferredcites →https://doi.org/10.1007/978-1-4612-3228-5_5openalex-snapshot
The calculus of boolean structures
inferredcites →https://doi.org/10.1007/bf00268074openalex-snapshot
A simple fixpoint argument without the restriction to continuity
inferredcites →https://doi.org/10.1007/bf00289091openalex-snapshot
do considered od: A contribution to the programming calculus
inferredcites →https://doi.org/10.1007/bfb0031414openalex-snapshot
Trace Theory and VLSJ Design
inferredcites →https://doi.org/10.1016/0304-3975(88)90142-9openalex-snapshot
Interpretations of recursion under unbounded nondeterminacy
inferredcites →https://doi.org/10.1145/322077.322088openalex-snapshot
Some Properties of Predicate Transformers
inferredcites →https://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferredcites →https://doi.org/10.1145/42192.42194openalex-snapshot
A mathematical approach to nondeterminism in data types
inferredcites →https://doi.org/10.1145/6490.6494openalex-snapshot
Countable nondeterminism and random assignment
inferredcites →https://doi.org/10.1145/69558.69559openalex-snapshot
A generalization of Dijkstra's calculus
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.6100/ir240580openalex-snapshot
Trace theory and VLSI design
inferredcites →https://doi.org/10.7907/desx8-jhv04openalex-snapshot
A General Proof Rule for Procedures in Predicate Transformer Semantics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-56596-5_30openalex-snapshot
Semantics, orderings and recursion in the weakest precondition calculus
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_11openalex-snapshot
A Model of the Refinement Process
inferred← citeshttps://doi.org/10.1007/978-1-4612-4476-9_22openalex-snapshot
Modalities of Nondeterminacy
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_25openalex-snapshot
Higher-Order Program Verification via HFL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_12openalex-snapshot
WP Semantics and Behavioral Subtyping
inferred← citeshttps://doi.org/10.1007/bf01213603openalex-snapshot
The weakest precondition calculus: Recursion and duality
inferred← citeshttps://doi.org/10.1007/bf01888217openalex-snapshot
Command algebras, recursion and program transformation
inferred← citeshttps://doi.org/10.1007/s00236-007-0049-9openalex-snapshot
Dual unbounded nondeterminacy, recursion, and fixpoints
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90174-eopenalex-snapshot
Processes and formalisms for unbounded choice
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/s1571-0661(05)82567-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/69558.69559openalex-snapshot
A generalization of Dijkstra's 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.