A temporal logic of nested calls and returns

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

Volumn 2988, Issue , 2004, Pages 467-481

  Alur, Rajeev ^a   Etessami, Kousha ^b   Madhusudan, P ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS; TEMPORAL LOGIC;

ALGORITHMIC VERIFICATION; LINEAR TEMPORAL LOGIC SPECIFICATIONS; MODEL CHECKING PROBLEM; PARTIAL AND TOTAL CORRECTNESS; PRE AND POST CONDITIONS; RECURSIVE PROCEDURE; SECURITY PROPERTIES; TEMPORAL MODALITIES;

MODEL CHECKING;

EID: 35048839796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_35     Document Type: Article

References (24)

1. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of CAV'01, LNCS 2102, pages 207-220. Springer, 2001.
2. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. SPIN Workshop on Model Checking of Software, LNCS 1885, pages 113-130, 2000.
3. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In Proc. ICALP, volume LNCS 2076, pages 652-666. 2001.
4. A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In Proc., 10th Annual IEEE Symp. on Logic in Computer Science, pages 123-133. IEEE, 1995.
5. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97: Concurrency Theory, Eighth International Conference, LNCS 1243, pages 135-150. Springer, 1997.
6. 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 Proc. 8th International Workshop on Formal Methods for Industrial Critical Systems, pages 75-89, 2003.
7. O. Burkart and B. Steffen. Model checking for context-free processes. In CONCUR'92: Concurrency Theory, LNCS 630, pages 123-137. Springer, 1992.
8. 3 winning condition. In Proc. of CSL 2002, LNCS 2471, 322-336. Springer, 2002.
9. 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.
10. 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.
11. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pages 52-71. Springer-Verlag, 1981.
12. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Computer Aided Verification, 12th International Conference, LNCS 1855, pages 232-247. Springer, 2000.
13. J. Esparza, A. Kucera, and S. S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. Information and Computation, 186(2):355-376, 2003.
14. D. Harel, D. Kozen and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
15. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
16. G.J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
17. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
18. T. Jensen, D. Le Metayer, and T. Thorn. Verification of control flow based security properties. In Proc. of the IEEE Symp. on Security and Privacy, 89-103, 1999.
19. O. Kupferman, N. Piterman, and M.Y. Vardi. Pushdown Specifications. In Proc. of LPAR 02, LNCS 2514, pages 262-277. Springer, 2002.
20. O. Kupferman, N. Piterman, and M.Y. Vardi. Model checking linear properties of prefix-recognizable systems. In Proc. of CAV 02, LNCS 2404, 371-385, 2002.
21. O. Lichtenstein and A. Pnueli. Checking that finite-state concurrent programs satisfy their linear specification. In Proc., 12th ACM POPL, pages 97-107, 1985.
22. Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems: Specification. Springer-verlag, 1991.
23. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46-77, 1977.
24. T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. ACM POPL, pages 49-61, 1995.