One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …

The phrase model checking refers to algorithms for exploring the state space of a transition
system to determine if it obeys a specification of its intended behavior. These algorithms can …

This article provides a detailed description of the automatic theorem prover Simplify, which is
the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify …

We propose a model independent procedure for verifying properties of discrete event
systems. The dynamics of such systems can be very complex, making them hard to analyze …

The paper explores several ways to improve the speed and capacity of combinational
equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use …

Boolean Satisfiability (SAT) is often used as the underlying model for a significant and
increasing number of applications in Electronic Design Automation (EDA) as well as in many …

In the past few years, general-purpose propositional satisfiability (SAT) solvers have
improved dramatically in performance and have been used to tackle many new problems. It …

Abstract Bounded Model Checking (BMC) is the problem of checking if a model satisfies a
temporal property in paths with bounded length k. Propositional SAT-based BMC is …

We present a novel preprocessing technique to automatically reduce the size of Boolean
formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for …

The development and implementation of intellectual property (IP) protection mechanisms is
of crucial importance for the emerging reuse-based system design methodology. Maybe …