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 …

Reachability analysis is a fundamental problem in verification that checks for a given model
and set of initial states if the system will reach a given set of unsafe states. Its importance lies …

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 present Logically Qualified Data Types, abbreviated to Liquid Types, a system that
combines Hindley-Milner type inference with Predicate Abstraction to automatically infer …

We discuss how to perform symbolic execution of large programs in a manner that is both
compositional (hence more scalable) and demand-driven. Compositional symbolic …

The first attempts to apply the k-induction method to software verification are only recent. In
this paper, we present a novel proof by induction algorithm, which is built on the top of a …

This paper discusses our methodology for formal analysis and automatic verification of
software programs. It is applicable to a large subset of the C programming language that …

In this paper, we explore the potential of the theory of nested words for partial correctness
proofs of recursive programs. Our conceptual contribution is a simple framework that allows …

While the C programming language provides good support for writing efficient, low-level
code, it is not adequate for defining higher-level abstractions relevant to embedded …

The interest of industries in model checking software for microcontrollers is increasing.
However, there are currently no appropriate tools that can be applied by embedded systems …