• Publications
  • Influence
Automating regression verification
TLDR
We present a novel automatic approach for regression verification that reduces the equivalence of two related imperative integer programs with complex arithmetic and control flow to constraints over uninterpreted predicates. Expand
  • 100
  • 14
  • PDF
Norn: An SMT Solver for String Constraints
TLDR
We present version 1.0 of the Norn SMT solver for string constraints. Expand
  • 66
  • 13
  • PDF
The ELDARICA Horn Solver
TLDR
ELDARICA is an efficient open source Horn solver supporting integer arithmetic, arrays, algebraic data types and bit-vectors. Expand
  • 38
  • 13
  • PDF
Software Verification Using k-Induction
TLDR
We present a new k-induction rule that takes an unstructured, reducible control flow graph, a natural loop occurring in the CFG, and a positive integer k, and constructs a single CFG in which the given loop is eliminated via an unwinding proportional to k. Expand
  • 86
  • 12
  • PDF
String Constraints for Verification
TLDR
We present a decision procedure for a logic that combines (i)aword equations over string variables denoting words of arbitrary lengths, together with (ii)aconstraints on the length of words, and on (iii) membership in regular languages to which words belong. Expand
  • 72
  • 11
  • PDF
Non-termination Checking for Imperative Programs
TLDR
We present an approach to automatic non-termination checking that relates to termination checking in the same way as symbolic testing does to program verification. Expand
  • 63
  • 11
  • PDF
A Verification Toolkit for Numerical Transition Systems - Tool Paper
TLDR
This paper presents a publicly available toolkit and a benchmark suite for rigorous verification of Integer Numerical Transition Systems, which can be viewed as control-flow graphs whose edges are annotated by Presburger arithmetic formulas. Expand
  • 84
  • 10
  • PDF
Disjunctive Interpolants for Horn-Clause Verification
TLDR
We introduce a new notion, disjunctive interpolation, which solves a more general class of problems in one step compared to previous notions of interpolants, such as tree interpolants or inductive sequences of interpolant. Expand
  • 101
  • 8
  • PDF
Ranking function synthesis for bit-vector relations
TLDR
We propose several novel algorithms to generate ranking functions for relations over machine integers: a complete method based on a reduction to Presburger arithmetic, and a template-matching approach based on reduction to SAT- and QBF-solving. Expand
  • 68
  • 8
  • PDF
A Polymorphic Intermediate Verification Language: Design and Logical Encoding
TLDR
Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood by theorem provers. Expand
  • 94
  • 7
  • PDF
...
1
2
3
4
5
...