On the public citation graph

The weakest precondition calculus: Recursion and duality

https://doi.org/10.1007/bf01213603
0 signed · 36 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/3-540-10007-5_48openalex-snapshot
Dijkstra's predicate transformers and smyth's powerdomains
inferredcites →https://doi.org/10.1007/3-540-10843-2_38openalex-snapshot
A cook's tour of countable nondeterminism
inferredcites →https://doi.org/10.1007/3-540-52559-9_60openalex-snapshot
Refinement calculus, part I: Sequential nondeterministic programs
inferredcites →https://doi.org/10.1007/3-540-52559-9_61openalex-snapshot
Refinement calculus, part II: Parallel and reactive programs
inferredcites →https://doi.org/10.1007/3-540-57182-5_22openalex-snapshot
Isomorphisms between predicate and state transformers
inferredcites →https://doi.org/10.1007/978-1-4471-3273-8openalex-snapshot
On the Refinement Calculus
inferredcites →https://doi.org/10.1007/978-1-4612-3228-5openalex-snapshot
Predicate Calculus and Program Semantics
inferredcites →https://doi.org/10.1007/bf00268074openalex-snapshot
A simple fixpoint argument without the restriction to continuity
inferredcites →https://doi.org/10.1007/bf00276020openalex-snapshot
Predicate-transformer semantics of general recursion
inferredcites →https://doi.org/10.1007/bf00289091openalex-snapshot
do considered od: A contribution to the programming calculus
inferredcites →https://doi.org/10.1007/bf01213603openalex-snapshot
The weakest precondition calculus: Recursion and duality
inferredcites →https://doi.org/10.1007/bfb0036946openalex-snapshot
Power domains and predicate transformers: A topological view
inferredcites →https://doi.org/10.1016/0022-0000(78)90048-xopenalex-snapshot
Power domains
inferredcites →https://doi.org/10.1016/0022-0000(81)90005-2openalex-snapshot
On correct refinement of programs
inferredcites →https://doi.org/10.1016/0167-6423(87)90011-6openalex-snapshot
A theoretical basis for stepwise refinement and the programming calculus
inferredcites →https://doi.org/10.1016/s0022-0000(77)80006-8openalex-snapshot
A characterization of weakest preconditions
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

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-45793-3_9openalex-snapshot
A Fixpoint Theory for Non-monotonic Parallelism
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_24openalex-snapshot
On the Semantics of Refinement Calculi
inferred← citeshttps://doi.org/10.1007/bfb0054286openalex-snapshot
An approach to object-orientation in action systems
inferred← citeshttps://doi.org/10.1007/s00165-020-00527-yopenalex-snapshot
Symbolic execution formally explained
inferred← citeshttps://doi.org/10.1016/j.scico.2016.01.006openalex-snapshot
Parameterised three-valued model checking
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.047openalex-snapshot
Generic weakest precondition semantics from monads enriched with order
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00893-9openalex-snapshot
A fixpoint theory for non-monotonic parallelism
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00228-5openalex-snapshot
Coordinating action systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82567-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1109/tase52547.2021.00025openalex-snapshot
Encoding Induction Proof in Dafny
inferred← citeshttps://doi.org/10.1145/1391956.1391961openalex-snapshot
Dually nondeterministic functions
inferred← citeshttps://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3597503.3623333openalex-snapshot
Inferring Data Preconditions from Deep Learning Models for Trustworthy Prediction in Deployment
inferred← citeshttps://doi.org/10.1201/b20053-23openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.48550/arxiv.1603.02922openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2011.13213openalex-snapshot
Why Charles Can Pen-test: an Evolutionary Approach to Vulnerability Testing
showing the first 16 of 17 · page through all 17
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.