Summary: Compositional Verification and 3-Valued
Abstractions Join Forces
Computer Science Department, Technion, Haifa, Israel
Model checking is a useful approach for verifying properties of systems. It is
given a model M of a system and a temporal logic formula , describing a
specification. It returns `true' if the system satisfies the specification (M |= )
and `false', otherwise. The main disadvantage of model checking is the state
explosion problem, which refers to its high space requirements.
Two of the most promising approaches to fighting the state explosion problem
are abstraction and compositional verification. In this work we join their forces to
obtain a fully automatic compositional technique that can determine the truth
value of the full µ-calculus with respect to a given system.
In the talk we first briefly explain what model checking is. We then present
the needed background on abstraction and on compositional verification. Next
we describe our approach in more detail.
Given a system M = M1||M2, we view each component Mi as an abstraction
Mi of the system M. The abstract component Mi is defined using a 3-valued
semantics so that whenever a formula has a definite value (true or false) on