Loading...
Please wait, while we are loading the content...
Similar Documents
An automata-theoretic approach to interprocedural data-flow analysis (1999).
| Content Provider | CiteSeerX |
|---|---|
| Author | Esparza, Javier Knoop, Jens |
| 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... |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Interprocedural Data-flow Analysis Automata-theoretic Approach Natural Application Introduction Recent Work Large Variety Fixpoint Approach Finite-state Process Model-checking Algorithm Abstract Class Interprocedural Dfa Automaton Theory Automatatheoretic Approach Recent Progress Dfa Problem Unique Model-checking Technique Pushdown Process Program Optimisation Infinite-state System Context-free Process Data-flow Analysis Interprocedural Dataflow Analysis |
| Content Type | Text |
