Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 4, 2005, Pages 786-818

  Alur, Rajeev ^a,f   Benedikt, Michael ^b   Etessami, Kousha ^c   Godefroid, Patrice ^b   Reps, Thomas ^d,g   Yannakakis, Mihalis ^e,h  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

^d UNIVERSITY OF WISCONSIN   (United States)

^e Och Spine at New York Presbyterian Hospitals   (United States)

^f UNIVERSITY OF PENNSYLVANIA   (United States)

^g University of Wisconsin Madison   (United States)

^h King's Buildings ^*  (United States)

Author keywords

Context free languages; Model checking; Program analysis; Pushdown automata; Recursive state machines; Software verification; Temporal logic

Indexed keywords

MODEL CHECKING; PROGRAM ANALYSIS; PUSHDOWN AUTOMATA; RECURSIVE STATE MACHINES; SOFTWARE VERIFICATION; TEMPORAL LOGIC;

ALGORITHMS; CONCURRENCY CONTROL; FLOW CONTROL; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS;

AUTOMATA THEORY;

EID: 26444540951     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1075382.1075387     Document Type: Article

References (48)

1. ALUR, R., ETESSAMI, K., AND MADHUSUDAN, P. 2004. A temporal logic of nested calls and returns. In Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04), volume 2988 of LNCS, pages 467-481. Springer.
2. ALUR, R., ETESSAMI, K., AND YANNAKAKIS, M. 2001. Analysis of recursive state machines. In CAV 2001, pages 207-220.
3. ALUR, R., TORRE, S. L., AND MADHUSUDAN, P. 2003a. Modular strategies for recursive game graphs. In Proceedings of TACAS, volume 2619 of LNCS, pages 363-378.
4. ALUR, R., TORRE, S. L., AND MADHUSUDAN, P. 2003b. Modular strategies for infinite games on recursive graphs. In Proceedings of CAV'03, volume 2725 of LNCS, pages 67-79.
5. ALUR, R. AND YANNAKAKIS, M. 2001. Model checking of hierarchical state machines. ACM Trans. Prog. Lang. Syst. 23, 3, pages 273-303.
6. ANDERSEN, H. 1994. Model checking and boolean graphs. Theoret. Comput. Sci.126, 1, 3-30.
7. BALL, T. AND RAJAMANI, S. 2000. Bebop: A symbolic model checker for boolean programs. In SPIN '2000, volume 1885 of LNCS, pages 113-130.
8. BENEDIKT, M., GODEFROID, P., AND REPS, T. 2001. Model checking of unrestricted hierarchical state machines. In ICALP'2001, pages 652-666.
9. BOOCH, G., JACOBSON, J., AND RUMBAUGH, J. 1997. The Unified Modeling Language User Guide. Addison Wesley.
10. BOUAJJANI, A., ESPARZA, J., AND MALER, O. 1997. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97, pages 135-150.
11. BOUAJJANI, A., ESPARZA, J., AND TOUILI, T. 2003. A generic approach to the static analysis of concurrent programs with procedures. In POPL '03, pages 62-73.
12. BALAKRISHNAN, G. AND REPS, T. 2004. Analyzing memory accesses in x86 executables. In Proceedings of the International Conference on Compiler Construction (CC'04), volume 2985 of LNCS, pages 5-23. Springer.
13. BURKART, O. AND STEFFEN, B. 1992. Model checking and context-free processes. In CONCUR '92, pages 122-137.
14. BURKART, O. AND STEFFEN, B. 1999. Model checking the full modal mu-calculus for infinite sequential processes. Theoret. Comput. Sci. 221, 251-270.
15. CHATTERJEE, K., MA, D., MAJUMDAR, R., ZHAO, T., HENZINGER, T. A., AND PALSBERG, J. 2003. Stack size analysis for interrupt-driven programs. In Proceedings of the 10th Static Analysis Symposium, pages 109-126.
16. CHEN, H. AND WAGNER, D. 2002. MOPS: An infrastructure for examining security properties of software. In Proceedings of the Conference on Computer and Communication Section.
17. COUSOT, P. AND COUSOT, R. 1977. Static determination of dynamic properties of recursive procedures. In IFIP Conference on Formal Description of Programming Concepts, St-Andrews, N.B., CA, E.J. Neuhold (Ed.), pages 237-277, St-Andrews, N.B., Canada.
18. CAUCAL, B. AND MONFORT, R. 1990. On the transition graphs of automata and grammars. In Graph Theoretic Concepts in Computer Science, Springer LNCS 484, pages 311-337.
19. EMERSON, A. 1990. Modal and temporal logic. In Handbook of Theoretical Computer Science, Volume B, pages 995-1072, MIT Press.
20. EMERSON, A. AND LEI, C. 1986. Efficient model-checking in fragments of the propositional mucalculus. In. LICS 98, pages 267-278.
21. ESPARZA, J., HANSEL, D., ROSSMANITH, P., AND SCHWOON, S. 2000. Efficient algorithms for model checking pushdown systems. In Computer Aided Verification, 12th International Conference, volume 1855 of LNCS, pages 232-247. Springer.
22. ETESSAMI, K. 2004. Analysis of recursive game graphs using data flow equations. In 5th International Conference on Verification, Model Checking, and Abstract Interpretation, volume 2937 of LNCS, pages 282-296. Springer.
23. FINKEL, A., WILLEMS, B., AND WOLPER, P. 1997. A direct symbolic approach to model checking pushdown systems. In Infinity'97 Workshop, volume 9 of Electronic Notes in Theoretical Computer Science.
24. GRAMMATECH, INC. 2000. CodeSurfer System. "http://www.grammatech. com/products/codesurfer/".
25. HAREL, D. 1987. Statecharts: A visual formalism for complex systems. Sci. Comput. Prog. 8, 231-274.
26. HEINTZE, N. AND MCALLESTER, D. A. 1997. On the cubic bottleneck in subtyping and flow analysis. In Proceedings of Logic in Computer Science, pages 342-351.
27. HORWITZ, S., REPS, T., AND BINKLEY, D. 1990. Interprocedural slicing using dependence graphs. In Trans. Prog. Lang. Syst. 12, 1, 26-60.
28. HORWITZ, S., REPS, T., BRICKER, T., AND ROSAY, G. 1997. Wisconsin Program-Slicing Tool. "http://www.cs.wisc.edu/wpis/slicing_tool/".
29. HORWITZ, S., REPS, T., SAGIV, M., AND ROSAY, G. 1994. Speeding up slicing. In Proceedings of the 2nd ACM Symposium on Foundation of Software Engineering, pages 11-20.
30. MELSKI, D. AND REPS, T. 1999. Interprocedural path profiling. In Proceedings of the 8th Internatinal Conference on Compiler Construction, pages 47-62.
31. MELSKI, D. AND REPS, T. 2000. Interconvertibility of a class of set constraints and context-free-language reachability. Theoret. Comput. Sci., 248(1-2), 29-98.
32. REPS, T. 1998. Program analysis via graph reachability. Info. Soft. Tech. 40(11-12), 701-726.
33. REPS, T., HORWITZ, S., AND SAGIV, S. 1995. Precise interprocedural dataflow analysis via graph reachability. In POPL, pages 49-61.
34. REPS, T. AND ROSAY, G. 1995. Precise interprocedural chopping. In Proceedings of the 3rd ACM Symposium on Foundation of Software Engineering, pages 41-52.
35. REPS, T., SCHWOON, S., AND JHA, S. 2003. Weighted pushdown systems and their application to interprocedural dataflow analysis. In Proceedings of the 10th Static Analysis Symposium, pages 189-213.
36. SAGIV, M., REPS, T., AND HORWITZ, S. 1996. Precise interprocedural dataflow analysis with applications to constant propagation. Theoret. Comput. Sci. 167(1-2), 131-170.
37. SCHWOON, S. 2002. Moped System, "http://www.fmi.uni-stuttgart.de/ szs/tools/mopad/".
38. SCHWOON, S., REPS, T., AND JHA, S. 2003. Weighted PDS Library, "http://www.fmi.uni-stuttgart.de/szs/tools/wpds/".
39. SCHWOON, S., JHA, S., REPS, T., AND STUBBLEBINE, S. 2003. On generalized authorization problems. In Proceedings of the 16th Computer Section Foundations Workshop, pages 202-218.
40. BALL, T. AND RAJAMANI, S. 2000. SLAM Toolkit, "http://research. microsoft.com/slam/".
41. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S.S. Muchnick and N.D. Jones (eds.), Prentice-Hall, Englewood Cliffs, NJ, pages 189-234.
42. ULLMAN, J.D. 1988. Principles of Database and Knowledge-base systems. Computer Science Press.
43. VALIANT, L. G. 1975. General context-free recognition in less than cubic time. J. Comput. Syst. Sci. 10, 308-315.
44. VARDI, M. AND WOLPER, P. 1986. Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Softw. 32, 2, 183-221.
45. WALUKIEWICZ, I. 2001. Pushdown processes: Games and model-checking. Information and Computation 164, 2, 234-263.
46. YANNAKAKIS, M. 1990. Graph-theoretic methods in database theory. In Proceedings of the 9th ACM Symposium on Principles of Database Systems, pages 230-242.
47. WOODS, W. A. 1970. Transition network grammars for natural language analysis. Commun. ACM 13, 10, 591-606.
48. WPDS++: 2004. A C++ Library for Weighted Pushdown Systems, University of Wisconsin