On the public citation graph
An axiomatic basis for proving total correctness of goto-programs
0 signed · 25 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/bf00288637openalex-snapshot
Axiomatic approach to total correctness of programs
inferredcites →https://doi.org/10.1007/bf00288686openalex-snapshot
Program proving: Jumps and functions
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
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-030-58768-0_11openalex-snapshot
Hoare-Style Logic for Unstructured Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_19openalex-snapshot
Relational Hoare Logic for Realistically Modelled Machine Code
inferred← citeshttps://doi.org/10.1007/978-3-642-67600-0_6openalex-snapshot
Exception Handling with Multi-Exit Statements
inferred← citeshttps://doi.org/10.1007/978-3-642-69705-0_1openalex-snapshot
Formale Methoden Zur Erstellung Robuster Software
inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot
Current methods for proving program correctness
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01932275openalex-snapshot
A case study in program transformation
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90123-6openalex-snapshot
Axiomatic proofs of total correctness of programs
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90056-xopenalex-snapshot
Verifying programs by induction on their data structure: General format and applications
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90005-5openalex-snapshot
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
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.jlamp.2025.101099openalex-snapshot
Hoare-style logic for unstructured programs
inferred← citeshttps://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferred← citeshttps://doi.org/10.1145/359340.359353openalex-snapshot
Is “sometime” sometimes better than “always”?
inferred← citeshttps://doi.org/10.1145/512760.512782openalex-snapshot
Nondeterminism in logics of programs
inferred← citeshttps://doi.org/10.1145/512950.512955openalex-snapshot
Applications of high level control flow
inferred← citeshttps://doi.org/10.2139/ssrn.5046959openalex-snapshot
Hoare-Style Logic for Unstructured 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.