An automata-theoretic approach to interprocedural data-flow analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1578, Issue , 1999, Pages 14-30

  Esparza, Javier ^a   Knoop, Jens ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Automata theory; Interprocedural data flow analysis; Model checking; Program optimisation

Indexed keywords

AUTOMATA THEORY; DATA TRANSFER; MODEL CHECKING;

AUTOMATA-THEORETIC APPROACH; FINITE STATE PROCESS; INTER-PROCEDURAL; OPTIMISATIONS; RECENT PROGRESS;

DATA FLOW ANALYSIS;

EID: 33745656232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_2     Document Type: Conference Paper

References (27)

1. J. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, 40(3):653-682, 1993.
2. J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.
3. B. Bloom. Structured operational semantics as an specification language. In Proceedings of POPL '95, pages 107-117, 1995.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proceedings of CONCUR '97, volume 1243 of Lecture Notes in Computer Science, pages 135-150, 1997.
5. O. Burkart and B. Steffen. Model checking for context-free processes. In Proceedings of CONCUR '92, volume 630 of Lecture Notes in Computer Science, pages 123-137, 1992.
6. O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic Journal of Computing, 2(2):89-125, 1995.
7. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conf. Rec. 4th Symp. Principles of Prog. Lang. (POPL'77), pages 238-252. ACM, NY, 1977.
8. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conf. Rec. 4th Symp. Principles of Prog. Lang. (POPL'79), pages 269-282. ACM, New York, 1979.
9. P. Cousot and R. Cousot. Abstract interpretation frameworks. J. of Logic and Computation, 2(4):511-547, 1992.
10. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9, 1997.
11. R. Giegerich, U. Möncke, and R. Wilhelm. Invariance of approximative semantics with respect to program transformations. In Proc. 3rd Conf. Europ. Co-operation in Informatics, Informatik-Fachberichte 50, pages 1-10. Springer-V., 1981.
12. M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, North-Holland, 1977.
13. G. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
14. S. Horwitz, A. Demers, and T. Teitelbaum. An efficient general iterative algorithm for data flow analysis. Acta Informatica, 24:679-694, 1987.
15. M. Klein, J. Knoop, D. Koschützki, and B. Steffen. DFA&OPT-MetaFrame: A tool kit for program analysis and optimization. In Proc. 2nd Int. Workshop on Tools and Algorithms for Constr. and Analysis of Syst. (TACAS'96), LNCS 1055, pages 422-426. Springer-V., 1996.
16. J. Knoop. Optimal Interprocedural Program Optimization: A new Framework and its Application. PhD thesis, Univ. of Kiel, Germany, 1993. LNCS Tutorial 1428, Springer-V., 1998.
17. J. Knoop, B. Steffen, and J. Vollmer. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. ACM Trans. Prog. Lang. Syst., 18(3):268-299, 1996.
18. D. Lugiez and P. Schnoebelen. The regular viewpoint on PA-processes. In Proceedings of CONCUR '98, volume 1466 of Lecture Notes in Computer Science, pages 50-66, 1998.
19. K. Marriot. Frameworks for abstract interpretation. Acta Informatica, 30:103-129, 1993.
20. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite- State Systems. Ph.D. thesis, Technische Universität München, 1998.
21. S. P. Midkiff and D. A. Padua. Issues in the optimization of parallel programs. In Proc. Int. Conf. on Parallel Processing, Volume 2, pages 105-113, 1990.
22. R. Milner. Communication and Concurrency. Prentice Hall, 1990.
23. S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco, CA, 1997.
24. B. Steffen, A. Claßen, M. Klein, J. Knoop, and T. Margaria. The fixpoint-analysis machine. In Proc. 6th Int. Conf. on Concurrency Theory (CONCUR'95), LNCS 962, pages 72-87. Springer-V., 1995. Invited contribution.
25. M. Y. Vardi and P. Wolper. Automata Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences, 32:183-221, 1986.
26. K. Varpaaniemi. PROD 3.3. 02. An advanced tool for efficient reachability analysis. Technical report, Department of Computer Science and Engineering, Helsinky University of Technology, 1998. Available at http://www.tcs.hut.fi/pub/prod/.
27. F. Wallner. Model checking LTL using net unfoldings. In Proceedings of CAV '98, volume 1427 of Lecture Notes in Computer Science, pages 207-218, 1998.