On the public citation graph
Axiomatic approach to total correctness of programs
0 signed · 101 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/978-1-4612-6315-9_10openalex-snapshot
Proof of a Program: FIND
inferredcites →https://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
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/3-540-07131-8_37openalex-snapshot
Axiomatisierung von Programmiersprachen und ihre Grenzen
inferred← citeshttps://doi.org/10.1007/3-540-07162-8_694openalex-snapshot
Proving programs by sets of computations
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_181openalex-snapshot
A note on the automatic generation of inductive assertions
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_124openalex-snapshot
A comparative review of some program verification methods
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_30openalex-snapshot
A calculus for proving properties of while-programs
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_37openalex-snapshot
The specification and proof of correctness of interactive programs
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_38openalex-snapshot
A cook's tour of countable nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_8openalex-snapshot
Verification of Embedded Software: Problems and Perspectives
inferred← citeshttps://doi.org/10.1007/3-540-48167-2_10openalex-snapshot
Metatheory of Verification Calculi in LEGO
inferred← citeshttps://doi.org/10.1007/978-3-030-45260-5_1openalex-snapshot
On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
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-030-65474-0_12openalex-snapshot
Interprocedural Shape Analysis Using Separation Logic-Based Transformer Summaries
inferred← citeshttps://doi.org/10.1007/978-3-031-73887-6_19openalex-snapshot
Three Ways of Proving Termination of Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-92196-4_4openalex-snapshot
The Many Uses of Dynamic Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-11629-7_6openalex-snapshot
Complexity of Checking Strong Satisfiability of Reactive System Specifications
inferred← citeshttps://doi.org/10.1007/978-3-322-96753-4_7openalex-snapshot
The Classical Methods of Floyd
inferred← citeshttps://doi.org/10.1007/978-3-322-96753-4_8openalex-snapshot
The Axiomatic Method of Hoare
inferred← citeshttps://doi.org/10.1007/978-3-642-13010-6_4openalex-snapshot
Using the Spec# Language, Methodology, and Tools to Write Bug-Free Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-67881-3_7openalex-snapshot
Correctness of Software — An Overview
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_9openalex-snapshot
How Program Statements Transform Predicates
inferred← citeshttps://doi.org/10.1007/bf00261259openalex-snapshot
The clean termination of iterative programs
inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot
Current methods for proving program correctness
inferred← citeshttps://doi.org/10.1007/bf01940782openalex-snapshot
An axiomatic basis for proving total correctness of goto-programs
inferred← citeshttps://doi.org/10.1007/bfb0014668openalex-snapshot
Specifications and proofs for abstract data types in concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0026107openalex-snapshot
Regular automata and model checking
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s10817-024-09706-5openalex-snapshot
Verifying Programs with Logic and Extended Proof Rules: Deep Embedding vs. Shallow Embedding
inferred← citeshttps://doi.org/10.1007/s10990-008-9024-6openalex-snapshot
Totally correct logic program transformations via well-founded annotations
inferred← citeshttps://doi.org/10.1016/0004-3702(80)90023-5openalex-snapshot
LAURA, a system to debug student programs
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90063-9openalex-snapshot
On proving the termination of algorithms by machine
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/0066-4138(88)90001-8openalex-snapshot
Correctness verification of real-time programs
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90017-0openalex-snapshot
Partial correctness: The term-wise approach
inferred← citeshttps://doi.org/10.1016/0167-6423(85)90004-8openalex-snapshot
A language of specified programs
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90029-3openalex-snapshot
A hoare-like proof system for analysing the computation time of programs
inferred← citeshttps://doi.org/10.1016/0169-7552(90)90133-dopenalex-snapshot
Protocol verification for OSI
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/0304-3975(84)90103-8openalex-snapshot
Fair termination revisited—with delay
inferred← citeshttps://doi.org/10.1016/b978-0-08-036236-6.50005-9openalex-snapshot
Correctness verification of real-time programs
inferred← citeshttps://doi.org/10.1016/b978-0-08-041894-0.50031-9openalex-snapshot
Relative Correctness of Real-Time Systems
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.1016/j.jlamp.2026.101187openalex-snapshot
Compositional backward shape analysis by means of bi-abduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00313-3openalex-snapshot
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)50143-3openalex-snapshot
Relative Correctness of Real-Time Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80168-9openalex-snapshot
Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/apsec.2009.70openalex-snapshot
Extracting Environmental Constraints to Make Reactive System Specifications Realizable
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00061openalex-snapshot
EndWatch: A Practical Method for Detecting Non-Termination in Real-World Software
inferred← citeshttps://doi.org/10.1109/hicss.1989.48004openalex-snapshot
Correctness verification of concurrent systems
inferred← citeshttps://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferred← citeshttps://doi.org/10.1109/tc.2012.134openalex-snapshot
A Kleene Algebra of Tagged System Actors for Reasoning about Heterogeneous Embedded Systems
inferred← citeshttps://doi.org/10.1109/tse.1981.231114openalex-snapshot
On the Development of Correct Specified Programs
inferred← citeshttps://doi.org/10.1109/tse.1981.234518openalex-snapshot
Inference Rules for Program Annotation
inferred← citeshttps://doi.org/10.1145/1014007.1014023openalex-snapshot
A theory of totally correct logic program transformations
inferred← citeshttps://doi.org/10.1145/1190215.1190249openalex-snapshot
Variance analyses from invariance analyses
inferred← citeshttps://doi.org/10.1145/1190216.1190249openalex-snapshot
Variance analyses from invariance analyses
inferred← citeshttps://doi.org/10.1145/2103621.2103687openalex-snapshot
An abstract interpretation framework for termination
inferred← citeshttps://doi.org/10.1145/2103656.2103687openalex-snapshot
An abstract interpretation framework for termination
inferred← citeshttps://doi.org/10.1145/3208102openalex-snapshot
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
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/359461.359483openalex-snapshot
Proof techniques for hierarchically structured programs
inferred← citeshttps://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferred← citeshttps://doi.org/10.1145/3632849openalex-snapshot
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3689491.3691814openalex-snapshot
Unified Analysis Techniques for Programs with Outcomes
inferred← citeshttps://doi.org/10.1145/3704852openalex-snapshot
Calculational Design of Hyperlogics by Abstract Interpretation
inferred← citeshttps://doi.org/10.1145/3704855openalex-snapshot
A Demonic Outcome Logic for Randomized Nondeterminism
inferred← citeshttps://doi.org/10.1145/3704899openalex-snapshot
Sound and Complete Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1145/3743131openalex-snapshot
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects
inferred← citeshttps://doi.org/10.1145/3821419openalex-snapshot
Incorrectness Proofs with Underapproximation Invariants
inferred← citeshttps://doi.org/10.1145/512760.512782openalex-snapshot
Nondeterminism in logics of programs
inferred← citeshttps://doi.org/10.1145/6490.6494openalex-snapshot
Countable nondeterminism and random assignment
inferred← citeshttps://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferred← citeshttps://doi.org/10.1155/2020/6791891openalex-snapshot
Improved Efficiency of Object Code Verification Using Statically Abstracted Object Code
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.2187openalex-snapshot
Complexity of Strong Satisfiability Problems for Reactive System Specifications
inferred← citeshttps://doi.org/10.2139/ssrn.5046959openalex-snapshot
Hoare-Style Logic for Unstructured Programs
inferred← citeshttps://doi.org/10.22028/d291-25890openalex-snapshot
Temporal verification with transition invariants
inferred← citeshttps://doi.org/10.2478/s11532-009-0132-xopenalex-snapshot
Determination of ultra-trace amounts of inorganic selenium species in natural water by ion chromatography-inductively coupled plasma-mass spectrometry coupled with nano-Al2O3 solid phase extraction
inferred← citeshttps://doi.org/10.26507/rei.v8n15.233openalex-snapshot
LA LÓGICA EN LAS CIENCIAS COMPUTACIONALES
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/122openalex-snapshot
Maia and Mandos: Tools for Integrity Protection on Arbitrary Files
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2011.01425openalex-snapshot
Proof of program correctness based on Kripke structure
inferred← citeshttps://doi.org/10.70675/4963a743z807fz43efzb17fz5f5ae5b8d77aopenalex-snapshot
Programmation impérative par raffinements avec l'assistant de preuve Coq
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.