Propositional dynamic logic with recursive programs

Journal of Logic and Algebraic Programming

Volumn 73, Issue 1-2, 2007, Pages 51-69

  Löding, Christof ^a   Lutz, Carsten ^b   Serre, Olivier ^c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Propositional dynamic logic; Visibly pushdown automata

Indexed keywords

PROPOSITIONAL DYNAMIC LOGIC; SATISFIABILITY PROBLEM; VISIBLY PUSHDOWN AUTOMATA;

COMPUTATIONAL METHODS; DECISION MAKING; LARGE SCALE SYSTEMS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

DYNAMIC PROGRAMMING;

EID: 34447340218     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2006.11.003     Document Type: Article

References (22)

1. Alur R., Chaudhuri S., and Madhusudan P. A fixpoint calculus for local and global program flows. Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2006) (2006), ACM 153-165
2. Alur R., Etessami K., and Madhusudan P. A temporal logic of nested calls and returns. Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference (TACAS 2004). Lecture Notes in Computer Science vol. 2988 (2004), Springer 467-481
3. Alur R., and Madhusudan P. Visibly pushdown languages. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004) (2004), ACM 202-211
4. Alur R., Chaudhuri S., and Madhusudan P. Languages of nested trees. Proceedings of Computer Aided Verification, 18th International Conference (CAV 2006). Lecture Notes in Computer Science vol. 4144 (2006), Springer 329-342
5. Chandra A.K., Kozen D.C., and Stockmeyer L.J. Alternation. J. ACM 28 1 (1981) 114-133
6. Fischer M.J., and Ladner R.E. Propositional dynamic logic of regular programs. J. Comput. System Sci. 18 2 (1979) 194-211
7. D. Harel, M. Kaminsky, Strengthened results on nonregular PDL, Technical Report MCS99-13, Weizmann Institute of Science, Faculty of Mathematics and Computer Science, 1999.
8. D. Harel, E. Singerman, More on nonregular PDL: expressive power, finite models, fibonacci programs, in: Proceedings of the 3rd Israeli Symposium on the Theory of Computing and Systems (ISTCS), 1995.
9. Harel D. Dynamic logic. In: Gabbay D.M., and Guenthner F. (Eds). Handbook of Philosophical Logic vol. II (1984), D. Reidel Publishers 496-604
10. Harel D., Kozen D., and Tiuryn J. Dynamic logic. Foundations of Computing (2000), MIT Press
11. Harel D., Pnueli A., and Stavi J. Propositional dynamic logic of nonregular programs. J. Comput. System Sci. 26 2 (1983) 222-243
12. Harel D., and Raz D. Deciding properties of nonregular programs. SIAM J. Comput. 22 4 (1993) 857-874
13. T. Koren, A. Pnueli, There exit decidable context free propositional dynamic logics, in: Proceedings of Logics of Programs, Workshop, Carnegie Mellon University, 1983, pp. 290-312.
14. Kozen D., and Tiuryn J. Logics of programs. In: van Leewen J. (Ed). Handbook of Theoretical Computer Science. Formal Models and Semantics vol. B (1990), The MIT Press 789-840 (Chapter 14)
15. Löding C., Madhusudan P., and Serre O. Visibly pushdown games. Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2004). Lecture Notes in Computer Science vol. 3328 (2004), Springer 408-420
16. McNaughton R. Parenthesis grammars. J. ACM 14 3 (1967) 490-500
17. Parikh R. The logic of games an its applications. Ann. Discrete Math. 24 (1985) 111-140
18. Park D. Finiteness is μ-ineffable. Theor. Comput. Sci. 3 (1976) 173-181
19. Segoufin L., and Vianu V. Validating streaming XML documents. Proceedings of the 21st Symposium on Principles of Database Systems (PODS'02) (2002), ACM 53-64
20. Streett R.S. Propositional dynamic logic of looping and converse is elementary decidable. Inform. Control 54 (1982) 121-141
21. Thomas W. Languages, automata, and logic. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Language Theory vol. III (1997), Springer 389-455
22. Vardi M.Y., and Wolper P. Automata-theoretic techniques for modal logic of programs. J. Comput. System Sci. 32 (1986) 183-221