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 …

This article presents EXE, an effective bug-finding tool that automatically generates inputs
that crash real code. Instead of running code on manually or randomly constructed input …

We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann-
-Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

Much research in the area of constraint processing has recently been focused on extracting
small unsatisfiable “cores” from unsatisfiable constraint systems with the goal of finding …

Featuring contributions from major technology vendors, industry consortia, and government
and private research establishments, the Industrial Communication Technology Handbook …

The logic of equality with uninterpreted functions (EUF) and its extensions have been widely
applied to processor verification, by means of a large variety of progressively more …

Abstract Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a
first-order formula with respect to some decidable first-order theory T (SMT (T)). These …

In this paper we explore the problem of creating vulnerability signatures. A vulnerability
signature matches all exploits of a given vulnerability, even polymorphic or metamorphic …