Termination analyses investigate the termination behavior of programs, intending to detect
nontermination, which is known to cause a variety of program bugs (eg hanging programs …

Proving program termination is key to guaranteeing absence of undesirable behaviour, such
as hanging programs and even security vulnerabilities such as denial-of-service attacks. To …

We introduce a novel approach to the automated termination analysis of computer
programs: we use neural networks to represent ranking functions. Ranking functions map …

We introduce a machine learning approach to model checking temporal logic, with
application to formal hardware verification. Model checking answers the question of whether …

The template-based approach to invariant generation is a parametric and relatively
complete methodology for inferring loop invariants. The relative completeness ensures the …

Determining whether a given program terminates is the quintessential undecidable problem.
Algorithms for termination analysis may be classified into two groups:(1) algorithms with …

We consider the problem whether termination of affine integer loops is decidable. Since
Tiwari conjectured decidability in 2004 [15], only special cases have been solved [3, 4, 14] …

There is increasing interest in applying verification tools to programs that have bitvector
operations. SMT solvers, which serve as a foundation for these tools, have thus increased …

This paper studies the problem of synthesizing (lexicographic) polynomial ranking functions
for loops that can be described in polynomial arithmetic over integers and reals. While the …

Bit-vectors, which are integers in a finite number of bits, are ubiquitous in software and
hardware systems. In this work, we consider the satisfiability modulo theories (SMT) of bit …