Abstract:
. We show that recent progress in extending the automatatheoretic approach to model-checking beyond the class of finite-state processes finds a natural application in the area of interprocedural dataflow analysis. Keywords: Interprocedural data-flow analysis, model-checking, automata theory, program optimisation. 1 Introduction Recent work [15, 24] has shown that model-checking algorithms for abstract classes of infinite-state systems, like context-free processes [1, 5] and pushdown processes [6], find a natural application in the area of data-flow analysis (DFA) for programming languages with procedures [16], usually called interprocedural DFA. A large variety of DFA problems, whose solution is required by optimising compilers in order to apply performance improving transformations, can be solved by means of a unique model-checking technique. The techniques of [5, 6] are based on what could be called the fixpoint approach to model-checking [24], in which the set of states satisfying...
Citations
|
2701
|
Communication and Concurrency
– Milner
- 1989
|
|
1314
|
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
– Cousot, Cousot
- 1977
|
|
971
|
The Model Checker Spin
– Holzmann
- 1997
|
|
713
|
Advanced Compiler Design and Implementation
– Muchnick
- 1997
|
|
444
|
Systematic design of program analysis frameworks
– Cousot, Cousot
- 1979
|
|
263
|
Flow Analysis of Computer Programs
– Hecht
- 1977
|
|
189
|
Reachability analysis of pushdown automata: Application to model checking
– Bouajjani, Esparza, et al.
- 1997
|
|
176
|
Abstract interpretation frameworks
– Cousot, Cousot
- 1992
|
|
168
|
Automata-theoretic techniques for modal logic of programs
– Vardi, Wolper
- 1986
|
|
88
|
Decidability of bisimulation equivalence for processes generating context-free languages
– Baeten, Bergstra, et al.
- 1993
|
|
88
|
A direct symbolic approach to model checking pushdown systems. Elec. Notes in Theor
– Finkel, Willems, et al.
- 1997
|
|
70
|
Model checking for context-free processes
– Burkart, Steffen
- 1992
|
|
44
|
Issues in the optimization of parallel programs
– Midkiff, Padua
- 1990
|
|
34
|
Parallelism for free: Efficient and optimal bitvector analyses for parallel programs
– Knoop, Steffen, et al.
- 1996
|
|
33
|
The regular viewpoint on pa-processes
– Schnoebelen
|
|
28
|
An efficient general iterative algorithm for data flow analysis
– Horwitz, Demers, et al.
- 1987
|
|
27
|
Composition, decomposition and model checking of pushdown processes
– Burkart, Steffen
- 1995
|
|
25
|
Decidability and Complexity of Model Checking Problems for Infinite-State Systems
– Mayr
- 1998
|
|
20
|
Invariance of approximative semantics with respect to program transformations
– Giegerich, Moncke, et al.
- 1981
|
|
17
|
DFA&OPT-MetaFrame: A tool kit for program analysis and optimization
– Klein, Knoop, et al.
- 1996
|
|
17
|
Optimal interprocedural program optimization: A new framework and its application
– Knoop
- 1993
|
|
16
|
Model checking LTL using net unfoldings
– Wallner
- 1998
|
|
13
|
The fixpoint-analysis machine
– Steffen, Classen, et al.
- 1995
|
|
9
|
Frameworks for abstract interpretation
– Marriot
- 1993
|
|
6
|
Stuctured operational semantics as a specification language
– Bloom
- 1995
|
|
2
|
PROD 3.3.02. An advanced tool for efficient reachability analysis
– Varpaaniemi
- 1998
|
