We present MathSAT 4, a state-of-the-art SMT solver. MathSAT 4 handles several useful
theories:(combinations of) equality and uninterpreted functions, difference logic, linear …

We propose natural proofs for reasoning with programs that manipulate data-structures
against specifications that describe the structure of the heap, the data stored within it, and …

Matching logic is a logic for specifying and reasoning about structure by means of patterns
and pattern matching. This paper makes two contributions. First, it proposes a sound and …

We define a new logic, STRAND, that allows reasoning with heap-manipulating programs
using deductive verification and SMT solvers. STRAND logic (" STRucture ANd Data" logic) …

We present the Java Bytecode Symbolic Executor (JBSE), a symbolic executor for Java
programs that operates on complex heap inputs. JBSE implements both the novel Heap …

We develop logical mechanisms and procedures to facilitate the verification of full functional
properties of inductive tree data-structures using recursion that are sound, incomplete, but …

We consider the problem of automated reasoning about dynamically manipulated data
structures. Essential properties are encoded as predicates whose definitions are formalized …

Symbolic analysis is a core component of many automatic test generation and program
verication approaches. To verify complex software systems, test and analysis techniques …

Structural coverage metrics, and in particular branch coverage, are popular approaches to
measure the thoroughness of test suites. Unfortunately, the presence of elements that are …

Automation of fixpoint reasoning has been extensively studied for various mathematical
structures, logical formalisms, and computational domains, resulting in specialized fixpoint …