On the public citation graph

Axioms for total correctness

https://doi.org/10.1007/bf00263765
0 signed · 17 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-08353-7_170openalex-snapshot
Total correctness for procedures
inferredcites →https://doi.org/10.1007/bf00264034openalex-snapshot
Consistent and complementary formal theories of the semantics of programming languages
inferredcites →https://doi.org/10.1007/bf00264565openalex-snapshot
A closer look at termination
inferredcites →https://doi.org/10.1007/bf00288637openalex-snapshot
Axiomatic approach to total correctness of programs
inferredcites →https://doi.org/10.1007/bf01940782openalex-snapshot
An axiomatic basis for proving total correctness of goto-programs
inferredcites →https://doi.org/10.1145/357980.358001openalex-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/11787006_31openalex-snapshot
Descriptive and Relative Completeness of Logics for Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_170openalex-snapshot
Total correctness for procedures
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_6openalex-snapshot
Connecting Different Proof Styles
inferred← citeshttps://doi.org/10.1007/bf00288541openalex-snapshot
Hierarchical program specification and verification ? a many-sorted logical approach
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bfb0022537openalex-snapshot
A uniform approach to applicative and imperative features in programming languages
inferred← citeshttps://doi.org/10.1007/s10817-008-9098-1openalex-snapshot
A Mechanical Analysis of Program Verification Strategies
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.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferred← citeshttps://doi.org/10.1145/3632849openalex-snapshot
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation
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.