Modular techniques for automatic verification attempt to overcome the state-explosion
problem by exploiting the modular structure naturally present in many system designs …

Formal methods based on model-oriented specifications like VDM or B are applicable to the
development of sequential operations. In such approaches, state components can be …

Proof-carrying code (PCC) is a general framework that can, in principle, verify safety
properties of arbitrary machine-language programs. Existing PCC systems and typed …

Compositional reasoning aims to improve scalability of verification tools by reducing the
original verification task into subproblems. The simplification is typically based on the …

Compositional reasoning aims to improve scalability of verification tools by reducing the
original verification task into subproblems. The simplification is typically based on assume …

Concurrency, as a useful feature of many modern programming languages and systems, is
generally hard to reason about. Although existing work has explored the verification of …

Scalable formal analysis of reactive programs demands integration of modular reasoning
techniques with existing analysis tools. Principles such as abstraction, compositional …

One problem with the constraint-based approaches to synthesis that have become popular
over the last few years is that they only scale to relatively small routines, on the order of a …

Mechatronic systems today have to fulfill increasingly complex tasks in diverse and often
safety-critical situations. In order to cope with this complexity, the design of the system is …

Existing methodologies for the verification of concurrent systems are effective for reasoning
about global properties of small systems. For large systems, these approaches become …