Proving that computer programs terminate cleanly.
Explore this paper's citation graph
- Type
- article
- Published
- 1974-01-01
- Cited by
- 39
- References
- 0
- OpenAlex
- https://openalex.org/W1595036120
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:60577849
Keywords
Computer science
References
No references recorded for this paper.
Cited by
- Exploiting specifications to improve program performance
- Proof of termination within a weak logic of programs
- State deltas: a formalism for representing segments of computation.
- Metodología de desarrollo de software basada en el paradigma generativo. Realización mediante la transformación de ejemplares
- The clean termination of iterative programs
- Using specialized procedures and specification-based analysis to reduce the runtime costs of modularity
- High-level data flow analysis
- A view of program verification
- Automating proofs of the absence of common runtime errors
- Test data as an aid in proving program correctness
- Mechanical program analysis
- Symbolic Evaluation and the Analysis of Programs
- A closer look at termination
- Correctness of Parallel Programs: The Church-Rosser Approach
- The temporal logic of programs
- The clean termination of Pascal programs
- A genealogy of control structures
- Abstract interpretation
- The Logic of Computer Programming
- A program testing system
Related papers
- A Program Verifier
- A Discipline of Programming
- Logical analysis of programs
- The Art of Computer Programming
- Program Proving as Hand Simulation with a Little Induction
- An axiomatic definition of the programming language PASCAL
- Automatic program verification I: A logical basis and its implementation
- Automating proofs of the absence of common runtime errors