Computational logic is a fast-growing field with applications in artificial intelligence,
constraint solving, and the design and verification of software and hardware systems. Written …

Program termination is central to the process of ensuring that systems code can always
react. We describe a new program termination prover that performs a path-sensitive and …

We present techniques for the analysis of infinite state probabilistic programs to synthesize
probabilistic invariants and prove almost-sure termination. Our analysis is based on the …

We consider nondeterministic probabilistic programs with the most basic liveness property of
termination. We present efficient methods for termination analysis of nondeterministic …

In this paper, we summarize the results on program verification through semi-algebraic
systems (SASs) solving that we have obtained, including automatic discovery of invariants …

Proving program termination Page 1 88 CommunICatIons of the aCm | MAy 2011 | vOl. 54 |
nO. 5 review articles Il lu S T r a T Io n B y M a T T H e W C o o P e r the ProGraM …

Previous symbolic software model checkers (ie, program analysis tools based on predicate
abstraction, pushdown model checking and iterative counterexample-guided abstraction …

It is important to prove that supposedly terminating programs actually terminate, particularly
if those programs must be run on critical systems or downloaded into a client such as a …

We define the reachability-bound problem to be the problem of finding a symbolic worst-
case bound on the number of times a given control location inside a procedure is visited in …

Although every terminating loop has a ranking function, not every loop has a ranking
function of a restricted form, such as a lexicographic tuple of polynomials over program …