Compositional Verification and 3-Valued Abstractions Join Forces

  • Sharon Shoham
  • Orna Grumberg
Conference paper

DOI: 10.1007/978-3-540-74061-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4634)
Cite this paper as:
Shoham S., Grumberg O. (2007) Compositional Verification and 3-Valued Abstractions Join Forces. In: Nielson H.R., Filé G. (eds) Static Analysis. SAS 2007. Lecture Notes in Computer Science, vol 4634. Springer, Berlin, Heidelberg

Abstract

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 novel fully automatic compositional technique that can determine the truth value of the full μ-calculus with respect to a given system.

Given a system \(\ensuremath{M} = \ensuremath{M}_1 \parallel \ensuremath{M}_2\), we view each component \(\ensuremath{M}_i\) as an abstraction \({\ensuremath{M}_i}\uparrow\) of the global system. The abstract component \({\ensuremath{M}_i}\uparrow \) is defined using a 3-valued semantics so that whenever a μ-calculus formula ϕ has a definite value (true or false) on \({\ensuremath{M}_i}\uparrow \), the same value holds also for \(\ensuremath{M}\). Thus, ϕ can be checked on either \({\ensuremath{M}_1}\uparrow \) or \({\ensuremath{M}_2}\uparrow \) (or both), and if any of them returns a definite result, then this result holds also for \(\ensuremath{M}\). If both checks result in an indefinite value, the composition of the components needs to be considered. However, instead of constructing the composition of \({\ensuremath{M}_1}\uparrow \) and \({\ensuremath{M}_2}\uparrow \), our approach identifies and composes only the parts of the components in which their composition is necessary in order to conclude the truth value of ϕ. It ignores the parts which can be handled separately. The resulting model is often significantly smaller than the full system.

We explain how our compositional approach can be combined with abstraction, in order to further reduce the size of the checked components. The result is an incremental compositional abstraction-refinement framework, which resembles automatic Assume-Guarantee reasoning.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sharon Shoham
    • 1
  • Orna Grumberg
    • 1
  1. 1.Computer Science Department, Technion, HaifaIsrael

Personalised recommendations