Name
Title | ||
|---|---|---|
Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction |
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 | Venue | Field |
|---|---|---|
2013 | arXiv: Logic in Computer Science | Discrete mathematics,Exponential function,Control flow graph,Static analysis,Control flow,Algorithm,Ranging,Boolean algebra,Combinatorial explosion,Recursion,Mathematics |
DocType | Volume | Citations |
Journal | abs/1304.6482 | 1 |
PageRank | References | Authors |
0.36 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. J. A. Keiren | 1 | 97 | 8.13 |
| Wieger Wesselink | 2 | 149 | 12.96 |
| Tim A. C. Willemse | 3 | 345 | 32.79 |