Concepedia

Proving program termination

Byron Cook, Andreas Podelski, Andrey Rybalchenko

Communications of the ACM · 2011 · 129 citations · 27 references

Concepts

ComputingComputer ScienceFormal MethodsDeductive VerificationTermination AnalysisTheorem ProvingPopular BeliefProgram TerminationTermination Proofs

Abstract

In contrast to popular belief, proving termination is not always impossible.

References

27

On Computable Numbers, with an Application to the Entscheidungsproblem

Alan Turing · Proceedings of the London Mathematical Society · 1937 · 8.1K citations

Computing, Computer Science, Mathematics +10

Abstract interpretation

Patrick Cousot, Radhia Cousot · 1977 · 6.2K citations

Computing, Computer Science, Compilers +8

On a Problem of Formal Logic

Frank Plumpton Ramsey · Proceedings of the London Mathematical Society · 1930 · 1.9K citations

Humanities, Computer Science, Formal Methods +11

Lazy abstraction

Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar et al. · 2002 · 1.2K citations

Computing, Computer Science, Algorithms +11

Tentative steps toward a development method for interfering programs

Cliff B. Jones · ACM Transactions on Programming Languages and Systems · 1983 · 619 citations · Full text

Computing, Information Systems, Access Management +4