Liveness Analysis for Parameterised Boolean Equation Systems

We present a sound static analysis technique for fighting the combinatorial explosion of parameterised Boolean equation systems (PBESs). These essentially are systems of mutually recursive fixed point equations ranging over first-order logic formulae. Our method detects parameters that are not live by analysing a control flow graph of a PBES, and it subsequently eliminates such parameters. We show that a naive approach to constructing a control flow graph, needed for the analysis, may suffer from an exponential blow-up, and we define an approximate analysis that avoids this problem. The effectiveness of our techniques is evaluated using a number of case studies.

[1]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[2]  Erik P. de Vink,et al.  An Overview of the mCRL2 Toolset and Its Recent Advances , 2013, TACAS.

[3]  María Alpuente,et al.  Datalog-Based Program Analysis with BES and RWL , 2010, Datalog.

[4]  Jeroen Keiren,et al.  Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction , 2013, ArXiv.

[5]  Angelika Mader,et al.  Verification of modal properties using Boolean equation systems , 1997 .

[6]  Jaco van de Pol,et al.  State Space Reduction of Linear Processes Using Control Flow Reconstruction , 2009, ATVA.

[7]  Tim A. C. Willemse,et al.  Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations , 2010, CONCUR.

[8]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[9]  Marius Bozga,et al.  State space reduction based on live variables analysis , 2003, Sci. Comput. Program..

[10]  Radu Mateescu,et al.  CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes , 2011, TACAS.

[11]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[12]  Orna Grumberg,et al.  Static Analysis for State-Space Reductions Preserving Temporal Logics , 2004, Formal Methods Syst. Des..

[13]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[14]  Simona Orzan,et al.  Static Analysis Techniques for Parameterised Boolean Equation Systems , 2009, TACAS.

[15]  Radu Mateescu,et al.  Vérification des propriétés temporelles des programmes parallèles , 1998 .

[16]  Tim A. C. Willemse,et al.  Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems , 2011, Inf. Comput..

[17]  Jan Friso Groote,et al.  Parameterised boolean equation systems , 2005, Theor. Comput. Sci..

[18]  Wim H. Hesselink,et al.  Invariants for the Construction of a Handshake Register , 1998, Inf. Process. Lett..