In view of the growing complexity of modern software architectures, formal models are
increasingly used to understand why a system works the way it does, opposed to simply …

We propose the class of visibly pushdown languages as embeddings of context-free
languages that is rich enough to model program analysis questions and yet is tractable and …

B last is an automatic verification tool for checking temporal safety properties of C programs.
Given a C program and a temporal safety property, B last either statically proves that the …

The success of model checking for large programs depends crucially on the ability to
efficiently construct parsimonious abstractions. A predicate abstraction is parsimonious if at …

Abstract Blast (the Berkeley Lazy Abstraction Software verification Tool) is a verification
system for checking safety properties of C programs using automatic property-driven …

We propose the model of nested words for representation of data with both a linear ordering
and a hierarchically nested matching of items. Examples of data with such dual linear …

While a typical software component has a clearly specified (static) interface in terms of the
methods and the input/output types they support, information about the correct sequencing …

Traditional static type systems are very effective for verifying basic interface specifications,
but are somewhat limited in the kinds specifications they support. Dynamically-checked …

Despite decades of research in extensible operating system technology, extensions such as
device drivers remain a significant cause of system failures. In Windows XP, for example …

Standard verification tools provide a counterexample to witness a specification violation,
and, since a few years, such a witness can be validated by an independent validator using …