Compositional proof systems not only enable the stepwise development of concurrent
processes but also provide a basis to alleviate the state explosion problem associated with …

Compositional verification is a promising approach to addressing the state explosion
problem associated with model checking. One compositional technique advocates proving …

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

The main problem in model checking that prevents it from being used for verification of large
systems is the state explosion problem. This problem often arises from combining parallel …

Probabilistic verification techniques have been applied to the formal modelling and analysis
of a wide range of systems, from communication protocols such as Bluetooth, to nanoscale …

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

In this paper, we suggest three optimizations to the L*-based automated Assume-Guarantee
reasoning algorithm for the compositional verification of concurrent systems. First, we use …

Several proof rules based on the assume-guarantee paradigm have been proposed for
compositional reasoning about concurrent systems. Some of the rules are syntactically …

An implementation of an out-of-order processing unit based on Tomasulo's algorithm is
formally verified using compositional model checking techniques. This demonstrates that …

This paper describes a technique of inductive proof based on model checking. It differs from
previous techniques that combine induction and model checking in that the proof is fully …