Propositional dynamic logic of context-free programs and fixpoint logic with chop

Information Processing Letters

Volumn 100, Issue 2, 2006, Pages 72-75

  Lange, Martin ^a   Somla, Rafał ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

Concurrency; Formal languages; Program specification

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; FORMAL LOGIC;

CONCURRENCY; FIXPOINT LOGIC; NON-REGULAR PROGRAMS; PROGRAM SPECIFICATION;

CONTEXT FREE LANGUAGES;

EID: 33746920913     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.04.019     Document Type: Article

References (12)

1. Fischer M.J., and Ladner R.E. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18 2 (1979) 194-211
2. Harel D., Pnueli A., and Stavi J. Propositional dynamic logic of nonregular programs. Journal of Computer and System Sciences 26 2 (1983) 222-243
3. Harel D., and Singerman E. More on nonregular PDL: Finite models and Fibonacci-like programs. Information and Computation 128 2 (1996) 109-118
4. Hopcroft J., and Ullman J. Introduction to Automata Theory, Languages, and Computation (1980), Addison-Wesley, N. Reading, MA
5. Koren T., and Pnueli A. There exist decidable context free propositional dynamic logics. In: Clarke E., and Kozen D. (Eds). Proc. of the Workshop on Logics of Programs. Pittsburgh, PA. Lecture Notes in Computer Science vol. 164 (1983), Springer-Verlag, Berlin 290-312
6. Kozen D. Results on the propositional μ-calculus. TCS 27 (December 1983) 333-354
7. Lange M. Model checking propositional dynamic logic with all extras. Journal of Applied Logic 4 1 (2005) 39-49
8. M. Lange, Three notes on the complexity of model checking fixpoint logic with chop, RAIRO-Theoretical Informatics and Applications, 2006, in press
9. Löding C., and Serre O. Propositional dynamic logic with recursive programs. Proc. 9th Int. Conf. on Foundations of Software Science and Computation Structures. FOSSACS'06. Lecture Notes in Computer Science vol. 3921 (2006), Springer-Verlag, Berlin 292-306
10. Müller-Olm M. A modal fixpoint logic with chop. In: Meinel C., and Tison S. (Eds). Proc. 16th Symp. on Theoretical Aspects of Computer Science. STACS'99, Trier, Germany. Lecture Notes in Computer Science vol. 1563 (1999), Springer, Berlin 510-520
11. Pratt V.R. Semantical considerations on Floyd-Hoare logic. 17th Annual Symp. on Foundations of Computer Science. FOCS'76, Houston, TX (1976), IEEE, New York 109-121
12. Tarski A. A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics 5 (1955) 285-309