Propositional Dynamic Logic with Program Quantifiers

Electronic Notes in Theoretical Computer Science

Volumn 218, Issue C, 2008, Pages 231-240

  Leivant, Daniel ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

PDL; Propositional dynamic logic with program quantification; QPDL

Indexed keywords

DIFFERENTIATION (CALCULUS);

CONTEXT FREEST; EXPRESSIVE POWERS; EXTENDING; PROPOSITIONAL DYNAMIC LOGIC WITH PROGRAM QUANTIFICATION; PROPOSITIONAL DYNAMIC LOGICS; QPDL; RECURSIVE PROCEDURES;

DYNAMIC PROGRAMMING;

EID: 54049095984     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.10.014     Document Type: Article

References (10)

1. Harel D., and Raz D. Deciding properties of nonregular programs. SIAM jour. Comput. 22 (1993) 857-874
2. Harel D., Kozen D., and Tiuryn J. Dynamic Logic (2000), MIT Press, Cabridge, MA
3. Harel D., Pnueli A., and Stavi J. Propositional dynamic logics of nonregular programs. J. Comput. Sys. Sci. 25 (1983) 222-243
4. Hopcroft J., and Ullman J. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley, Reading, MA
5. Kesten Y., and Pnueli A. A complete proof system for QPTL. Journal of Logic and Computation 12 5 (2002) 701-745
6. Kozen D. Results on the propositional mu-calculus. Theoretical Computer Science 27 (1983) 333-354
7. Daniel Leivant. Propositional dynamic logic for recursive procedures. Proceedings of the Second IFIP Conference on Veried Software (VSTTE08), to appear
8. Pratt V. A decidable mu-calculus (preliminary report). Proceedings of the twenty-second IEEE Symposium on Foundations of Computer Science (1981), Computer Society press, Los Angles 421-427
9. Shilov N.V. Program schemata vs. automata for decidability of program logics. Theoretical Computer Science 175 (1997) 15-27
10. Sistla S.P., Vardi M.Y., and Wolper P. The completementation problem for Büchi automata with application to termporal logic. Theoretical Computer Science 49 (1987) 217-237