• Publications
  • Influence
Feedback-Directed Random Test Generation
TLDR
Experimental results indicate that feedback-directed random test generation can outperform systematic and undirectedrandom test generation, in terms of coverage and error detection.
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
TLDR
CLU generalizes the logic of equality with uninterpreted functions (EUF) with constrained lambda expressions, ordering, and successor and predecessor functions to model many infinite-state systems including those with infinite memories, finite and infinite queues including lossy channels, and networks of identical processes.
SYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs
TLDR
SymDiff is described, a language-agnostic tool for equivalence checking and displaying semantic (behavioral) differences over imperative programs that operates on an intermediate verification language Boogie.
SMT Techniques for Fast Predicate Abstraction
TLDR
A new algorithm is demonstrated based on a careful generation of the set of all satisfying assignments over a set of predicates that consistently outperforms previous methods by a factor of at least 20, on a diverse set of hardware and software verification benchmarks.
Helping Developers Help Themselves: Automatic Decomposition of Code Review Changesets
TLDR
CLUSTERCHANGES is introduced, an automatic technique for decomposing change sets and its effectiveness is evaluated through both a quantitative analysis and a qualitative user study.
Back to the future: revisiting precise program verification using SMT solvers
TLDR
The Logic of Interpreted Sets and Bounded Quantification for specifying properties of heap-manipulating programs is introduced, which is expressive, closed under weakest preconditions, and efficiently implementable on top of existing SMT solvers.
An Efficient Decision Procedure for UTVPI Constraints
TLDR
An efficient decision procedure for UTVPI constraints is presented, which improves upon the previously known O(n2.m) time and O( n+m) space algorithm based on transitive closure.
A Solver for Reachability Modulo Theories
TLDR
The architecture of Corral is described, a semi-algorithm for the reachability-modulo-theories problem, thatuses novel algorithms for inlining procedures on demand and abstraction refinement and consistently outperforms its competitors on most benchmarks.
Differential assertion checking
TLDR
A novel modular approach to DAC is introduced by reducing it to safety checking of a composed program, which can be accomplished by standard program verifiers and leveraging automatic invariant generation to synthesize relative specifications for pairs of loops and procedures.
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
TLDR
It is concluded that neither method is robust to variations in formula characteristics, so a new hybrid technique is proposed that combines the two methods and can significantly outperform either approach as well as other decision procedures.
...
...