We propose a new decision procedure for the existential theory of the reals. It performs a
backtracking search for a model in R, where the backtracking is powered by a novel conflict …

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 …

Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements
since the mid 90s. One of the main reasons for these improvements has been the wide …

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 …

AProVE is a system for automatic termination and complexity proofs of Java, C, Haskell,
Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages …

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 a modular approach to automatic complexity analysis of integer programs.
Based on a novel alternation between finding symbolic time bounds for program parts and …

Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-
order formula with respect to some theory or combination of theories; Verification Modulo …

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

Boolean Satisfiability (SAT) solving has dramatically evolved in the past decade and a half.
The outcome, today, is manifested in dozens of high performance and relatively scalable …