On the public citation graph

Proof of termination within a weak logic of programs

https://doi.org/10.1007/bf00276182
0 signed · 23 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/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferredcites →https://doi.org/10.1007/bf00289504openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferredcites →https://doi.org/10.1007/bf00571463openalex-snapshot
Program proving: Coroutines
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1016/0004-3702(74)90015-0openalex-snapshot
Reasoning about programs
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/390016.808435openalex-snapshot
A methodology for verifying programs
inferredcites →https://doi.org/10.1145/390016.808471openalex-snapshot
Verifying programs by algebraic and logical reduction
inferredcites →https://doi.org/10.21236/ada019569openalex-snapshot
Automatic Program Verification 4: Proof of Termination within a Weak Logic of 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/978-3-642-82470-8_19openalex-snapshot
Safe Programming
inferred← citeshttps://doi.org/10.1007/bf01069174openalex-snapshot
Practical methods of program verification
inferred← citeshttps://doi.org/10.1007/bf01069326openalex-snapshot
On the logic of programs
inferred← citeshttps://doi.org/10.1007/bf01947739openalex-snapshot
Safe programming
inferred← citeshttps://doi.org/10.1016/0026-2714(85)90486-xopenalex-snapshot
Computer software quality measurements and metrics
inferred← citeshttps://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferred← citeshttps://doi.org/10.1109/tse.1981.234518openalex-snapshot
Inference Rules for Program Annotation
inferred← citeshttps://doi.org/10.1145/322169.322183openalex-snapshot
Continuation-Based Program Transformation Strategies
inferred← citeshttps://doi.org/10.1145/356850.356853openalex-snapshot
Verifying Security
inferred← citeshttps://doi.org/10.1145/3632849openalex-snapshot
Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation
inferred← citeshttps://doi.org/10.21236/ada091183openalex-snapshot
Basic Research in Artificial Intelligence and Foundations of Programming
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.