Weighted pushdown systems and their application to interprocedural dataflow analysis

Science of Computer Programming

Volumn 58, Issue 1-2, 2005, Pages 206-263

  Reps, Thomas ^a,c   Schwoon, Stefan ^b   Jha, Somesh ^a   Melski, David ^c  

^a University of Wisconsin   (United States)

^b UNIVERSITY OF STUTTGART   (Germany)

^c GRAMMATECH INC   (United States)

Author keywords

Generalized pushdown reachability; Interprocedural dataflow analysis; Meet over all paths problem; Weighted pushdown system

Indexed keywords

DATA FLOW ANALYSIS; SEMANTICS;

GENERALIZED PUSHDOWN REACHABILITY; INTERPROCEDURAL DATAFLOW ANALYSIS; MEET-OVER-ALL-PATHS PROBLEM; WEIGHTED PUSHDOWN SYSTEM;

ALGORITHMS;

EID: 24344477041     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2005.02.009     Document Type: Conference Paper

References (44)

1. J. Ahn, A differential evaluation of fixpoint iterations, in: Asian Workshop on Prog. Lang. and Syst., 2001
2. A. Aho, R. Sethi, and J. Ullman Compilers: Principles, Techniques and Tools 1985 Addison-Wesley
3. G. Balakrishnan, T. Reps, Analyzing memory accesses in x86 executables, in: Int. Conf. on Comp. Construct., 2004
4. F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman Magic sets and other strange ways to implement logic programs Proceedings of the Fifth ACM Symposium on Principles of Database Systems 1986 ACM Press New York, NY
5. A. Bouajjani, J. Esparza, and O. Maler Reachability analysis of pushdown automata: Application to model checking Proc. CONCUR Lec. Notes in Comp. Sci. vol. 1243 1997 Springer-Verlag 135 150
6. A. Bouajjani, J. Esparza, T. Touili, A generic approach to the static analysis of concurrent programs with procedures, in: Proc. Symp. on Princ. of Prog. Lang., 2003, pp. 62-73
7. F. Bourdoncle Efficient chaotic iteration strategies with widenings Int. Conf. on Formal Methods in Prog. and their Appl. Lec. Notes in Comp. Sci. 1993 Springer-Verlag
8. J. Cai, and R. Paige Program derivation by fixed point computation Sci. Comput. Programming 11 3 1989 197 261
9. H. Chen, D. Wagner, MOPS: An infrastructure for examining security properties of software, in: Conf. on Comp. and Commun. Sec., 2002
10. P. Cousot, and R. Cousot Systematic design of program analysis frameworks Symp. on Princ. of Prog. Lang. 1979 ACM Press New York, NY 269 282
11. P. Cousot, R. Cousot, Temporal abstract interpretation, in: Symp. on Princ. of Prog. Lang., 2000, pp. 12-25
12. E. Duesterwald, R. Gupta, and M. Soffa Demand-driven computation of interprocedural data flow Symp. on Princ. of Prog. Lang. 1995 ACM Press New York, NY 37 48
13. H. Eo, K. Yi, An improved differential fixpoint iteration method for program analysis, in: Asian Workshop on Prog. Lang. and Syst., 2002
14. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon Efficient algorithms for model checking pushdown systems Proc. Computer-Aided Verif. Lec. Notes in Comp. Sci. vol. 1855 2000 232 247
15. J. Esparza, and J. Knoop An automata-theoretic approach to interprocedural data-flow analysis Found. of Softw. Sci. and Comp. Structures LNCS vol. 1578 1999 Springer 14 30
16. J. Esparza, A. Kučera, and S. Schwoon Model-checking LTL with regular valuations for pushdown systems Proceedings of TACAS'01 LNCS vol. 2031 2001 Springer 306 339
17. C. Fecht, and H. Seidl Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems Nordic J. Comput. 5 1998 304 329
18. A. Finkel, B. Willems, and P. Wolper A direct symbolic approach to model checking pushdown systems Electronic Notes in Theoretical Comp. Sci. vol. 9 1977
19. S. Horwitz, T. Reps, and M. Sagiv Demand interprocedural dataflow analysis Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering 1995 ACM Press New York, NY 104 115
20. T. Jensen, D. Le Metayer, T. Thorn, Verification of control flow based security properties, in: 1999 IEEE Symposium on Security and Privacy, 1999
21. S. Jha, and T. Reps Analysis of SPKI/SDSI certificates using model checking IEEE Comp. Sec. Found. Workshop, CSFW 2002 IEEE Computer Society Press
22. N. Kidd, T. Reps, D. Melski, A. Lal, WPDS++: A C++ library for weighted pushdown systems, 2004
23. G. Kildall A unified approach to global program optimization Symp. on Princ. of Prog. Lang. 1973 ACM Press New York, NY 194 206
24. J. Knoop, and B. Steffen The interprocedural coincidence theorem Int. Conf. on Comp. Construct. 1992 125 140
25. A. Lal, G. Balakrishnan, T. Reps, Extended weighted pushdown systems, in: Proc. Computer-Aided Verif., 2005
26. U. Möncke, and R. Wilhelm Grammar flow analysis H. Alblas B. Melichar Attribute Grammars, Applications and Systems Lec. Notes in Comp. Sci. vol. 545 1991 Springer-Verlag Prague, Czechoslovakia 151 186
27. M. Müller-Olm, H. Seidl, Precise interprocedural analysis through linear algebra in: Symp. on Princ. of Prog. Lang., 2004
28. F. Nielson, H. Nielson, and C. Hankin Principles of Program Analysis 1999 Springer-Verlag
29. G. Ramalingam Bounded Incremental Computation Lec. Notes in Comp. Sci. vol. 1089 1996 Springer-Verlag
30. T. Reps Algebraic properties of program integration Sci. Comput. Programming 17 1991 139 215
31. T. Reps Solving demand versions of interprocedural analysis problems P. Fritzson Proceedings of the Fifth International Conference on Compiler Construction Lec. Notes in Comp. Sci. vol. 786 1994 Springer-Verlag Edinburgh, Scotland 389 403
32. T. Reps Demand interprocedural program analysis using logic databases R. Ramakrishnan Applications of Logic Databases 1994 Kluwer Academic Publishers
33. T. Reps, S. Horwitz, and M. Sagiv Precise interprocedural dataflow analysis via graph reachability Symp. on Princ. of Prog. Lang. 1995 ACM Press New York, NY 49 61
34. T. Reps, M. Sagiv, S. Horwitz, Interprocedural dataflow analysis via graph reachability, Tech. Rep. TR 94-14, Datalogisk Institut, Univ. of Copenhagen. Available at http://www.cs.wisc.edu/wpis/papers/diku-tr94-14.ps, 1994
35. M. Sagiv, T. Reps, and S. Horwitz Precise interprocedural dataflow analysis with applications to constant propagation Theoret. Comput. Sci. 167 1996 131 170
36. D. Schmidt Data-flow analysis is model checking of abstract interpretations Symp. on Princ. of Prog. Lang. 1998 ACM Press New York, NY 38 48
37. S. Schwoon, Model-checking pushdown systems, Ph.D. Thesis, Technical Univ. of Munich, Munich, Germany, July 2002
38. S. Schwoon Moped: A model-checker for pushdown systems http://www.fmi.uni-stuttgart.de/szs/tools/moped/ 2002
39. S. Schwoon WPDS: A library for weighted pushdown systems http://www.fmi.uni-stuttgart.de/szs/tools/wpds/ 2003
40. S. Schwoon, S. Jha, T. Reps, and S. Stubblebine On generalized authorization problems Comp. Sec. Found. Workshop 2003 IEEE Comp. Soc. Washington, DC
41. M. Sharir, and A. Pnueli Two approaches to interprocedural data flow analysis S. Muchnick N. Jones Program Flow Analysis: Theory and Applications 1981 Prentice-Hall Englewood Cliffs, NJ 189 234 (Chapter 7)
42. B. Steffen Data flow analysis as model checking Int. Conf. on Theor. Aspects of Comp. Softw. Lec. Notes in Comp. Sci. vol. 526 1991 Springer-Verlag 346 365
43. B. Steffen Generating data flow analysis algorithms from modal specifications Sci. Comput. Programming 21 2 1993 115 139
44. D. Warren Memoing for logic programs Commun. ACM 35 3 1992 93 111