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 …

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 …

Abstract Model checking is an automatic verification technique for hardware and software
systems that are finite state or have finite state abstractions. It has been used successfully to …

We present an SMT-based symbolic model checking algorithm for safety verification of
recursive programs. The algorithm is modular and analyzes procedures individually. Unlike …

Turing Lecture from the winners of the 2007 ACM AM Turing Award. In 1981, Edmund M.
Clarke and E. Allen Emerson, working in the USA, and Joseph Sifakis working …

All solutions SAT (AllSAT for short) is a variant of the propositional satisfiability problem.
AllSAT has been relatively unexplored compared to other variants despite its significance …

This article surveys fundamental and applied aspects of symmetry in system models, and of
symmetry reduction methods used to counter state explosion in model checking, an …

Abstract Model checking is a formal technique for automatically verifying that a finite-state
model satisfies a temporal property. In model checking, generally Binary Decision Diagrams …

We propose a methodology to formally prove protocol compliance for communication blocks
in System-on-Chip (SoC) designs. In this methodology, a set of operational properties is …

Verification of real-time systems is an important subject of research. This is highly motivated
by an increasing demand to verify safety critical systems, ie, time-dependent distributed …