Bound analysis of imperative programs with the size-change abstraction
The size-change abstraction (SCA) is an important program abstraction for termination
analysis, which has been successfully implemented in many tools for functional and logic …
analysis, which has been successfully implemented in many tools for functional and logic …
Predicate Abstraction for Program Verification: Safety and Termination
We present basic principles of algorithms for the verification of safety and termination of
programs. The algorithms call procedures on logical formulas in order to construct an …
programs. The algorithms call procedures on logical formulas in order to construct an …
Loop summarization and termination analysis
We present a technique for program termination analysis based on loop summarization. The
algorithm relies on a library of abstract domains to discover well-founded transition …
algorithm relies on a library of abstract domains to discover well-founded transition …
An abstract domain to infer ordinal-valued ranking functions
The traditional method for proving program termination consists in inferring a ranking
function. In many cases (ie programs with unbounded non-determinism), a single ranking …
function. In many cases (ie programs with unbounded non-determinism), a single ranking …
Automatic termination verification for higher-order functional programs
We present an automated approach to verifying termination of higher-order functional
programs. Our approach adopts the idea from the recent work on termination verification via …
programs. Our approach adopts the idea from the recent work on termination verification via …
Abstract interpretation from Büchi automata
M Hofmann, W Chen - Proceedings of the Joint Meeting of the Twenty …, 2014 - dl.acm.org
We describe the construction of an abstract lattice from a given Buchi automata. The abstract
lattice is finite and has the following key properties.(i) There is a Galois connection between …
lattice is finite and has the following key properties.(i) There is a Galois connection between …
Loop summarization using state and transition invariants
This paper presents algorithms for program abstraction based on the principle of loop
summarization, which, unlike traditional program approximation approaches (eg, abstract …
summarization, which, unlike traditional program approximation approaches (eg, abstract …
Stop when you are almost-full: Adventures in constructive termination
D Vytiniotis, T Coquand, D Wahlstedt - … , Princeton, NJ, USA, August 13-15 …, 2012 - Springer
Disjunctive well-foundedness, size-change termination, and well-quasi-orders are examples
of techniques that have been successfully applied to program termination. Although these …
of techniques that have been successfully applied to program termination. Although these …
Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs
Termination is an important but undecidable program property, which has led to a large
body of work on static methods for conservatively predicting or enforcing termination. One …
body of work on static methods for conservatively predicting or enforcing termination. One …
Proving termination starting from the end
We present a novel technique for proving program termination which introduces a new
dimension of modularity. Existing techniques use the program to incrementally construct a …
dimension of modularity. Existing techniques use the program to incrementally construct a …