On the public citation graph
Exits in the refinement calculus
0 signed · 26 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-56625-2_16openalex-snapshot
An operational semantics for the guarded command language
inferredcites →https://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
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/0167-6423(90)90056-jopenalex-snapshot
A functional theory of exceptions
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
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/978-3-642-12592-8_9openalex-snapshot
Refining Exceptions in Four-Valued Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-33296-8_14openalex-snapshot
Verification Rules for Exception Handling in Eiffel
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00197-7openalex-snapshot
Constructing a program with exceptions
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102679openalex-snapshot
Loop invariance with break and continue
inferred← citeshttps://doi.org/10.1109/apsec.2002.1182974openalex-snapshot
Refining exceptions using King and Morgan's exit construct
inferred← citeshttps://doi.org/10.1109/eurdac.1996.558247openalex-snapshot
A refinement calculus for VHDL
inferred← citeshttps://doi.org/10.1145/262004.262007openalex-snapshot
A refinement calculus for the synthesis of verified hardware descriptions in VHDL
inferred← citeshttps://doi.org/10.4018/978-1-60960-747-0.ch002openalex-snapshot
Exceptions for Dependability
inferred← citeshttps://doi.org/10.4204/eptcs.115.1openalex-snapshot
On a New Notion of Partial Refinement
inferred← citeshttps://doi.org/10.71548/18425openalex-snapshot
A Unifying Theory of Multi-Exit Programs
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.