Paper Info
Title
Liveness Analysis for Parameterised Boolean Equation Systems.
Abstract
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.
Year
DOI
Venue
2014
10.1007/978-3-319-11936-6_16
Lecture Notes in Computer Science
Field
DocType
Volume
Discrete mathematics,Exponential function,Control flow graph,Computer science,Static analysis,Theoretical computer science,Ranging,Boolean algebra,Combinatorial explosion,Recursion,Liveness
Conference
8837
ISSN
Citations 
PageRank 
0302-9743
3
0.40
References 
Authors
14
3
Name
Order
Citations
PageRank
J. J. A. Keiren1978.13
Wieger Wesselink214912.96
Tim A. C. Willemse334532.79