With our approach, existing safety provers can now be employed to prove nontermination of programs that previous techniques could not handle. Not only does the ...

We show how the problem of nontermination proving can be reduced to a question of underapproximation search guided by a safety prover.

In this paper we develop a new method of proving nontermination based on a reduction to safety proving that leverages the power of existing tools. An iterative.

We show how the problem of nontermination proving can be reduced to a question of underapproximation search guided by a safety prover. This reduction leads to ...

Non-termination Proving at Scale​​ Program termination is a classic non-safety property whose falsification cannot in general be witnessed by a finite trace. ...

A counterexample to a safety property is a finite program execution that leads to an error. The discovery and feasibility analysis of such executions lies at ...

Aug 9, 2023 · Abstract. We show how the problem of nontermination proving can be reduced to a question of underapproximation search guided by a safety prover.

Abstract—We present the first approach to prove non-termi- nation of integer programs that is based on loop acceleration.

Oct 22, 2024 · The most popular technique to prove termination is through the synthesis of a ranking function, a mapping from the state space to a well-founded ...

Conceptually, while for a safety property the violating witness is a finite trace, for a termination property the violating witnesses are infinite traces.