Dramatic improvements in SAT solver technology over the last decade and the growing
need for more efficient and scalable verification solutions have fueled research in …

The science of brute force Page 1 70 COMMUNICATIONS OF THE ACM | AUGUST 2017 |
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …

This paper describes version 2 of the NuSMV tool. NuSMV is a symbolic model checker
originated from the reengineering, reimplementation and extension of SMV, the original …

One of the most important industrial applications of SAT is currently Bounded Model
Checking (BMC). This technique is typically used for formal hardware verification in the …

We consider a fully SAT-based method of unbounded symbolic model checking based on
computing Craig interpolants. In benchmark studies using a set of large industrial circuit …

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 …

We show how a very modest modification to a typical modern SAT-solver enables it to solve
a series of related SAT-instances efficiently. We apply this idea to checking safety properties …

We present an algorithm that checks behavioral consistency between an ANSI-C program
and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the …

As the use of SAT solvers as core engines in EDA applications grows, it becomes
increasingly important to validate their correctness. In this paper, we describe the …

HyperLTL is a temporal logic that can express hyperproperties, ie, properties that relate
multiple execution traces of a system. Such properties are becoming increasingly important …