Slicing an integrated formal method for verification

  • Authors:

  • Ingo Brückner;Heike Wehrheim

  • Affiliations:

  • Department Informatik, Universität Oldenburg, Oldenburg, Germany;Institut für Informatik, Universität Paderborn, Paderborn, Germany

  • Venue:
  • ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Model checking specifications with complex data and behaviour descriptions often fails due to the large state space to be processed. In this paper we propose a technique for reducing such specifications (with respect to certain properties under interest) before verification. The method is an adaption of the slicing technique from program analysis to the area of integrated formal notations and temporal logic properties. It solely operates on the syntactic structure of the specification which is usually significantly smaller than its state space. We show how to build a reduced specification via the construction of a so called program dependence graph, and prove correctness of the technique with respect to a projection relationship between full and reduced specification. The reduction thus preserves all properties formulated in temporal logics which are invariant under stuttering, as for instance LTL−X.