The quality and the correctness of software are often the greatest concern in electronic
systems. Formal verification tools can provide a guarantee that a design is free of specific …

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

Dependency on the correct operation of embedded systems is rapidly growing, mainly due
to their wide range of applications. Their structures are becoming more complex and …

This report describes the definitions, rules, setup, procedure, and results of the 1st
International Competition on Software Verification. The verification community has …

We consider the class of finite-state programs executed by an unbounded number of
replicated threads communicating via shared variables. The thread-state reachability …

This paper addresses the analysis of concurrent programs with shared memory. Such an
analysis is undecidable in the presence of multiple procedures. One approach used in …

Random-based approaches and heuristics are commonly used in kernel concurrency
testing due to the massive scale of modern kernels and corresponding interleaving space …

The Internet of Things (IoT) is shaped by the increasing number of low-cost Internet-
connected embedded devices that are becoming ubiquitous in every aspect of modern life …

We consider the verification of parameterized Boolean programs—abstractions of shared-
memory concurrent programs with an unbounded number of threads. We propose that such …

Modern satisfiability (SAT) solvers have become the enabling technology of many model
checkers. In this chapter, we will focus on those techniques most relevant to industrial …