Solving non-linear arithmetic
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 …
backtracking search for a model in R, where the backtracking is powered by a novel conflict …
Analyzing Program Termination and Complexity Automatically with AProVE
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 …
complexity proofs of Java, C, Haskell, Prolog, and rewrite systems. In addition to classical …
Reducing energy consumption using genetic improvement
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 …
improve software's non-functional properties by treating program code as if it were genetic …
Practical applications of boolean satisfiability
J Marques-Silva - 2008 9th International Workshop on Discrete …, 2008 - ieeexplore.ieee.org
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 …
since the mid 90s. One of the main reasons for these improvements has been the wide …
Improving bit-blasting for nonlinear integer constraints
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 …
software/hardware. SMT (QF_NIA) generalizes such constraints, which is a boolean …
Proving Termination of Programs Automatically with AProVE
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 …
Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages …
Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions
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 …
order formula with respect to some theory or combination of theories; Verification Modulo …
Analyzing runtime and size complexity of integer programs
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 …
Based on a novel alternation between finding symbolic time bounds for program parts and …
Alternating runtime and size complexity analysis of integer programs
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 …
alternation between finding symbolic time bounds for program parts and using these to infer …
Empirical study of the anatomy of modern SAT solvers
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 …
The outcome, today, is manifested in dozens of high performance and relatively scalable …