Deductive software verification aims at formally verifying that all possible behaviors of a
given program satisfy formally defined, possibly complex properties, where the verification …

In this system description, we present the tool AProVE for automatic termination and
complexity proofs of Java, C, Haskell, Prolog, and rewrite systems. In addition to classical …

Genetic Improvement (GI) is an area of Search Based Software Engineering which seeks to
improve software's non-functional properties by treating program code as if it were genetic …

During the last decade, popular SMT solvers have been extended step-by-step with a wide
range of decision procedures for different theories. Some SMT solvers also support the user …

Building a competitive program verifiers is becoming cheaper. On the front-end side, openly
available compiler infrastructure and optimization frameworks take care of hairy problems …

Nonlinear integer constraints are common and difficult in the verification and analysis of
software/hardware. SMT (QF_NIA) generalizes such constraints, which is a boolean …

We present the open-source tool T2, the first public release from the TERMINATOR project
[9]. T2 has been extended over the past decade to support automatic temporal-logic proving …

We present a modular approach to automatic complexity analysis of integer programs.
Based on a novel alternation between finding symbolic time bounds for program parts and …

We show how the complexity of higher-order functional programs can be analysed
automatically by applying program transformations to a defunctionalised versions of them …

There is growing interest in termination reasoning for nonlinear programs and, meanwhile,
recent dynamic strategies have shown they are able to infer invariants for such challenging …