Propositional dynamic logic with recursive programs

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

Volumn 3921 LNCS, Issue , 2006, Pages 292-306

  Löding, Christof ^a   Serre, Olivier ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SYSTEMS PROGRAMMING; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

DYNAMIC LOGIC; RECURSIVE PROGRAMS; SATISFIABILITY PROBLEM;

FORMAL LOGIC;

EID: 33745767242     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_20     Document Type: Conference Paper

References (16)

1. R. Alur, S. Chaudhuri, and P. Madhusudan. A fixpoint calculus for local and global program flows. In Proceedings of POPL'06. To appear.
2. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In Proceedings of TACAS'04, volume 2988 of LNCS, pages 467-481. Springer, 2004.
3. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proceedings of STOC'04, pages 202-211. ACM, 2004.
4. R. Danecki. Nondeterministic prepositional dynamic logic with intersection is decidable. In Proceedings of the 5th Symposium on Computation Theory, volume 208 of LNCS, pages 34-53. Springer, 1984.
5. M.J. Fischer and R.E. Ladner. Prepositional dyncamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
6. D. Harel and M. Kaminsky. Strengthened results on nonregular PDL. Technical Report MCS99-13, Weizmann Institute of Science, 1999.
7. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. Foundations of Computing. MIT Press, 2000.
8. D. Harel and D. Raz. Deciding properties of nonregular programs. SIAM Journal on Computing, 22(4):857-874, 1993.
9. D. Harel and E. Singerman. More on nonregular PDL: Expressive power, finite models, fibonacci programs. In ISTCS: 3rd Israeli Symposium on the Theory of Computing and Systems, 1995.
10. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In Proceedings of FST&TCS'04, volume 3328 of LNCS, pages 408-420. Springer, 2004.
11. C. Lutz. PDL with intersection and converse is decidable. In Proceedings of CSL'05, volume 3634 of LNCS, pages 413-427. Springer, 2005.
12. R. Parikh. The logic of games an its applications. Annals of discrete mathematics, 24:111-140, 1985.
13. D. Park. Finiteness is μ-ineffable. Theoretical Computer Science, 3:173-181, 1976.
14. R. Streett. Prepositional dynamic logic of looping and converse is elementary decidable. Information and Control, 54:121-141, 1982.
15. W. Thomas. Languages, automata, and logic. In Handbook of Formal Language Theory, volume III, pages 389-455. Springer, 1997.
16. M. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences, 32:183-221, 1986.