Static Analysis Techniques for Parameterised Boolean Equation Systems

  • Simona Orzan
  • Wieger Wesselink
  • Tim A. C. Willemse
Conference paper

DOI: 10.1007/978-3-642-00768-2_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5505)
Cite this paper as:
Orzan S., Wesselink W., Willemse T.A.C. (2009) Static Analysis Techniques for Parameterised Boolean Equation Systems. In: Kowalewski S., Philippou A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2009. Lecture Notes in Computer Science, vol 5505. Springer, Berlin, Heidelberg

Abstract

Parameterised Boolean Equation Systems (PBESs) can be used to encode and solve various types of model checking and equivalence checking problems. PBESs are typically solved by symbolic approximation or by instantiation to Boolean Equation Systems (BESs). The latter technique suffers from something similar to the state space explosion problem and we propose to tackle it by static analysis techniques, which we tailor for PBESs. We introduce a method to eliminate redundant parameters and a method to detect constant parameters. Both lead to a better performance of the instantiation and they can sometimes even reduce problems that are intractable due to the infinity of the underlying BES to tractable ones.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Simona Orzan
    • 1
  • Wieger Wesselink
    • 1
  • Tim A. C. Willemse
    • 1
  1. 1.Eindhoven University of TechnologyThe Netherlands

Personalised recommendations