Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

We present a novel technique for static race detection in Java programs, comprised of a
series of stages that employ a combination of static analyses to successively reduce the …

We present the first verification of full functional correctness for a range of linked data
structure implementations, including mutable lists, trees, graphs, and hash tables …

Race detection algorithms for multi-threaded programs using the common lock-based
synchronization idiom must correlate locks with the memory locations they guard. The heart …

This paper takes a fresh look at the problem of precise verification of heap-manipulating
programs using first-order Satisfiability-Modulo-Theories (SMT) solvers. We augment the …

Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …

Runtime bloat degrades significantly the performance and scalability of software systems.
An important source of bloat is the inefficient use of containers. It is expensive to create …

This paper introduces matching logic, a novel framework for defining axiomatic semantics for
programming languages, inspired from operational semantics. Matching logic specifications …

This paper proposes a novel method of harnessing existing SAT solvers to verify reachability
properties of programs that manipulate linked-list data structures. Such properties are …

Abstract Reasoning about heap-allocated data structures such as linked lists and arrays is
challenging. The reachability predicate has proved to be useful for reasoning about the …