A fixpoint calculus for local and global program flows

ACM SIGPLAN Notices

Volumn 41, Issue 1, 2006, Pages 153-165

  Alur, Rajeev ^a   Chaudhuri, Swarat ^a   Madhusudan, P ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

calculus; Games; Infinite state; Logic; Model checking; Pushdown systems; Specification; Verification

Indexed keywords

Μ-CALCULUS; INFINITE-STATE; MODEL-CHECKING; PUSHDOWN SYSTEMS;

COMPUTER SOFTWARE; DATA FLOW ANALYSIS; MATHEMATICAL MODELS; SEMANTICS; SPECIFICATIONS;

FORMAL LOGIC;

EID: 33745212064     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1111320.1111051     Document Type: Article

References (26)

1. R. Alur, S. Chaudhuri, and P. Madhusudan. Visibly pushdown tree languages, http://www.cis.upenn.edu/~swarat/pubs/vptl.ps.
2. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In 10th Int. Conf. on Tools and Algorithms for the Const. and Analysis of Software, LNCS 2988, pages 467-481, 2004.
3. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of the 13th International Conference on Computer Aided Verification, LNCS 2102, pages 207-220. Springer, 2001.
4. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proc. of the 36th STOC, pages 202-211, 2004.
5. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN 2000 Workshop on Model Checking of Software, LNCS 1885, pages 113-130. Springer, 2000.
6. T. Ball and S. Rajamani. The SLAM project: debugging system software via static analysis. In Proc. of the 29th ACM Symposium on Principles of Programming Languages, pages 1-3, 2002.
7. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In 28th ICALP, volume LNCS 2076, pages 652-666. Springer, 2001.
8. 20 states and beyond. Information and Computation, 98(2): 142-170, 1992.
9. L. Burdy, Y. Cheon, D. Cok, M. Ernst, J. Kiniry, G.T. Leavens, R. Leino, and E. Poll. An overview of JML tools and applications. In Proceedings of the 8th International Workshop on Formal Methods for Industrial Critical Systems, pages 75-89, 2003.
10. O. Burkart and B. Steffen. Model checking the full modal rau-calculus for infinite sequential processes. Theoretical Computer Science, 221:251-270, 1999.
11. K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, and J. Palsberg. Stack size analysis for interrupt driven programs. In Proceedings of the 10th International Symposium on Static Analysis, volume LNCS 2694, pages 109-126, 2003.
12. H. Chen and D. Wagner. Mops: an infrastructure for examining security properties of software. In Proceedings of ACM Conference on Computer and Communications Security, pages 235-244, 2002.
13. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publishers, 1990.
14. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus, and determinacy. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 368-377, 1991.
15. J. Esparza, A. Kucera, and S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. Information and Computation, 186(2):355-376, 2003.
16. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Comes: A Guide, to Current Research [outcome of a Dagstuhl seminar, February 2001], volume 2500 of Lecture Notes in Computer Science. Springer, 2002.
17. T.A. Henzinger, R. Jhala, R. Majumdar, G.C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In Proc. of 14th CAV Conference, LNCS 2404, pp. 526-538, 2002.
18. D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In CONCUR '96: Seventh International Conference on Concurrency Theory, LNCS 1119, pages 263-277. Springer-Verlag, 1996.
19. T. Jensen, D. Le Metayer, and T. Thorn. Verification of control flow based security properties. In Proceedings of the IEEE Symposium on Security and Privacy, pages 89-103, 1999.
20. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
21. K.L. McMillan. Symbolic model checking: an approach to the state explosion problem. Kluwer Academic Publishers, 1993.
22. T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of the ACM Symposium on Principles of Programming Languages, pages 49-61, 1995.
23. D.A. Schmidt. Data flow analysis is model checking of abstract interpretations. In Proceedings of the 25th Annual ACM Symposium on Principles of Programming Languages, pages 68-78, 1998.
24. B. Steffen. Data flow analysis as model checking. In Theoretical Aspects of Computer Software, LNCS 526, pages 346-365, 1991.
25. C.S. Stirling. Modal and temporal logic. In Handbook of Logic in Computer Science, pages 477-563. Oxford University Press, 1991.
26. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234-263, 2001.