Program correctness and incorrectness are two sides of the same coin. As a programmer,
even if you would like to have correctness, you might find yourself spending most of your …

We consider the fundamental problem of reachability analysis over imperative programs
with real variables. Previous works that tackle reachability are either unable to handle …

This paper presents a new method for automatically generating numerical invariants for
imperative programs. The procedure computes a transition formula which overapproximates …

While model checking safety of infinite-state systems by inferring state invariants has
steadily improved recently, most verification tools still rely on a technique based on bounded …

We present the first approach to prove non-termination of integer programs that is based on
loop acceleration. If our technique cannot show non-termination of a loop, it tries to …

Abstract We present the Loop Acceleration Tool (LoAT), a powerful tool for proving non-
termination and worst-case lower bounds for programs operating on integers. It is based on …

The application of software-verification technology towards building realistic bug-finding
tools requires working through several precision-scalability tradeoffs. For instance, a critical …

Analyzing loops is very important for various software engineering tasks such as bug
detection, test case generation and program optimization. However, loops are very …

Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)
termination of programs operating on integers. To this end, a variety of acceleration …

Program analysis is on the brink of mainstream usage in embedded systems development.
Formal verification of behavioural requirements, finding runtime errors and test case …