Weighted pushdown systems and their application to interprocedural dataflow analysis

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

Volumn 2694, Issue , 2003, Pages 189-213

  Reps, Thomas ^a   Schwoon, Stefan ^b   Jha, Somesh ^a  

^a University of Wisconsin   (United States)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

INTERPROCEDURAL DATAFLOW ANALYSIS; PUSHDOWN SYSTEMS; WEIGHTED PUSHDOWN SYSTEMS;

DATA FLOW ANALYSIS;

EID: 35248814801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44898-5_11     Document Type: Article

References (29)

1. A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1985.
2. F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM Symposium on Principles of Database Systems, New York, NY, 1986. ACM Press.
3. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Proc. CONCUR, volume 1243 of Lec. Notes in Comp. Sci., pages 135-150. Springer-Verlag, 1997.
4. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In Proc. Symp. on Princ. of Prog. Lang., pages 62-73, 2003.
5. H. Chen and D. Wagner. MOPS: An infrastructure for examining security properties of software. In Conf. on Comp. and Commun. Sec., November 2002.
6. P. Cousot and R. Cousot. Temporal abstract interpretation. In Symp. on Princ. of Prog. Lang., pages 12-25, 2000.
7. E. Duesterwald, R. Gupta, and M.L. Sofia. Demand-driven computation of interprocedural data flow. In Symp. on Princ. of Prog. Lang., pages 37-48, New York, NY, 1995. ACM Press.
8. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. Computer-Aided Verif., volume 1855 of Lec. Notes in Comp. Sci., pages 232-247, July 2000.
9. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In Proceedings of FoSSaCS'99, volume 1578 of LNCS, pages 14-30. Springer, 1999.
10. J. Esparza, A. Kučera, and S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. In Proceedings of TACAS'01, volume 2031 of LNCS, pages 306-339. Springer, 2001.
11. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 104-115, New York, NY, October 1995. ACM Press.
12. T. Jensen, D. Le Metayer, and T. Thorn. Verification of control flow based security properties. In 1999 IEEE Symposium on Security and Privacy, May 1999.
13. S. Jha and T. Reps. Analysis of SPKI/SDSI certificates using model checking. In IEEE Comp. Sec. Found. Workshop (CSFW). IEEE Computer Society Press, 2002.
14. J. Knoop and B. Steffen. The interprocedural coincidence theorem. In Int. Conf. on Comp. Construct., pages 125-140, 1992.
15. U. Moencke and R. Wilhelm. Grammar flow analysis. In H. Alblas and B. Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lec. Notes in Comp. Sci., pages 151-186, Prague, Czechoslovakia, June 1991. Springer-Verlag.
16. M. Müller-Olm and H. Seidl. Computing interprocedurally valid relations in affine programs. Tech. rep., Comp. Sci. Dept., Univ. of Trier, Trier, Ger., January 2003.
17. G. Ramalingam. Bounded Incremental Computation, volume 1089 of Lec. Notes in Comp. Sci. Springer-Verlag, 1996.
18. T. Reps. Demand interprocedural program analysis using logic databases. In R. Ramakrishnan, editor, Applications of Logic Databases. Kluwer Academic Publishers, 1994.
19. T. Reps. Solving demand versions of interprocedural analysis problems. In P. Fritzson, editor, Proceedings of the Fifth International Conference on Compiler Construction, volume 786 of Lec. Notes in Comp. Sci., pages 389-403, Edinburgh, Scotland, April 1994. Springer-Verlag.
20. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Symp. on Princ. of Prog. Lang., pages 49-61, New York, NY, 1995. ACM Press.
21. T. Reps, M. Sagiv, and S. Horwitz. Interprocedural dataflow analysis via graph reachability. Tech. Rep. TR 94-14, Datalogisk Institut, Univ. of Copenhagen, 1994. Available at http://www.cs.visc.edu/wpis/papers/diku-tr94-14.ps.
22. M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comp. Sci., 167:131-170, 1996.
23. D. Schmidt. Data-flow analysis is model checking of abstract interpretations. In Symp. on Princ. of Prog. Lang., pages 38-48, New York, NY, January 1998. ACM Press.
24. S. Schwoon. WPDS - a library for Weighted Pushdown Systems, 2003. Available from http://www7.in.tum.de/~schwoon/moped/#wpds.
25. S. Schwoon, S. Jha, T. Reps, and S. Stubblebine. On generalized authorization problems. In Comp. Sec. Found. Workshop, Wash., DC, 2003. IEEE Comp. Soc.
26. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189-234. Prentice-Hall, Englewood Cliffs, NJ, 1981.
27. B. Steffen. Data flow analysis as model checking. In Int. Conf. on Theor. Aspects of Comp. Softw., volume 526 of Lec. Notes in Comp. Sci., pages 346-365. Springer-Verlag, 1991.
28. B. Steffen. Generating data flow analysis algorithms from modal specifications. Sci. of Comp. Prog., 21(2):115-139, 1993.
29. D.S. Warren. Memoing for logic programs. Communications of the ACM, 35(3):93-111, March 1992.