On the public citation graph
A closer look at termination
0 signed · 47 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/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferredcites →https://doi.org/10.1016/0004-3702(74)90015-0openalex-snapshot
Reasoning about programs
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0400642-2openalex-snapshot
Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth
inferredcites →https://doi.org/10.1109/tse.1975.6312821openalex-snapshot
A synthesizer of inductive assertions
inferredcites →https://doi.org/10.1145/360827.360850openalex-snapshot
The synthesis of loop predicates
inferredcites →https://doi.org/10.1145/390016.808434openalex-snapshot
Towards automatic debugging of programs
inferredcites →https://doi.org/10.1145/390016.808436openalex-snapshot
Finding Invariant assertions for proving programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380140803openalex-snapshot
The use of ghost variables and virtual programming in the documentation and verification of programs
inferred← citeshttps://doi.org/10.1007/11506676_15openalex-snapshot
On Termination of Binary CLP Programs
inferred← citeshttps://doi.org/10.1007/11921240_3openalex-snapshot
Verification Constraint Problems with Strengthening
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_45openalex-snapshot
Inference of Termination Conditions for Numerical Loops in Prolog
inferred← citeshttps://doi.org/10.1007/978-1-4471-3558-6_8openalex-snapshot
Formal Verification of Ada Programs
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_7openalex-snapshot
Abstraction and Verification in Alphard: Iteration and Generators
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-540-24599-5_45openalex-snapshot
Termination Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_1openalex-snapshot
Termination by Abstraction
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/s00165-008-0080-9openalex-snapshot
Property-directed incremental invariant generation
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/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/s0422-9894(08)70017-5openalex-snapshot
Chapter 12 Coastal Lagoons as Fish Habitats
inferred← citeshttps://doi.org/10.1016/s0950-5849(97)00016-5openalex-snapshot
Structured design with mathematical proofs
inferred← citeshttps://doi.org/10.1017/s1471068404002042openalex-snapshot
Inference of termination conditions for numerical loops in Prolog
inferred← citeshttps://doi.org/10.1023/a:1005797629953openalex-snapshot
Termination of Nested and Mutually Recursive Algorithms
inferred← citeshttps://doi.org/10.1109/icsmc.2001.972999openalex-snapshot
A formal method for proving programs correct
inferred← citeshttps://doi.org/10.1109/icsmc.2006.384745openalex-snapshot
Introducing Proofs of a Program's Termination in an Undergraduate Software Engineering Course
inferred← citeshttps://doi.org/10.1109/sera.2005.41openalex-snapshot
Formal verification of structured analysis and design in HOS
inferred← citeshttps://doi.org/10.1145/3360555openalex-snapshot
Modular verification for almost-sure termination of probabilistic programs
inferred← citeshttps://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferred← citeshttps://doi.org/10.1145/359340.359353openalex-snapshot
Is “sometime” sometimes better than “always”?
inferred← citeshttps://doi.org/10.1145/359763.359782openalex-snapshot
Abstraction and verification in Alphard
inferred← citeshttps://doi.org/10.21236/ada091183openalex-snapshot
Basic Research in Artificial Intelligence and Foundations of Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1708.05640openalex-snapshot
A similarity criterion for sequential programs using truth-preserving partial functions
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110034openalex-snapshot
Inference of termination conditions for numerical loops in Prolog
inferred← citeshttps://doi.org/10.5555/1041530.1041538openalex-snapshot
Teaching a formal method in a software engineering course
inferred← citeshttps://doi.org/10.5555/800253.807645openalex-snapshot
Is “sometime” sometimes better than “always”?: Intermittent assertions in proving program correctness
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.