Propositional dynamic logic for recursive procedures

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

Volumn 5295 LNCS, Issue , 2008, Pages 6-14

  Leivant, Daniel ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Fixpoints; Propositional dynamic logic; Recursive procedures; Calculus

Indexed keywords

CALCULATIONS; TEMPORAL LOGIC;

DEDUCTIVE FORMALISMS; FIXPOINTS; MU-CALCULUS; PROPOSITIONAL DYNAMIC LOGIC; RECURSIONS; RECURSIVE PROCEDURE; RECURSIVE PROGRAMS;

COMPUTER CIRCUITS;

EID: 70350591128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87873-5_5     Document Type: Conference Paper

References (15)

1. Gorelick, G.A.: A complete axiomatic system for proving assertions about recursive and nonrecursive programs. Technical Report TR-75, Deptment of Computer Science, University of Toronto (1975)
2. Harel, D.: First-Order Dynamic Logic. LNCS, vol. 68. Springer, Berlin (1979)
3. Harel, D.: Recursion in logics of programs. In: POPL 1979: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 81-92. ACM, New York (1979)
4. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
5. Harel, D., Pnueli, A., Stavi, J.: Propositional dynamic logics of nonregular programs. J. Comput. Sys. Sci. 25, 222-243 (1983)
6. Harel, D., Puneli, A., Stavi, J.: A complete axiomatic system for proving deductions about recursive programs. In: Proceedings of the ninth annual ACM symposium on Theory of computing, pp. 249-260 (1977)
7. Harel, D., Singerman, E.: More on nonregular PDL: finite models and fibonacci-like programs. Inf. Comput. 128(2), 109-118 (1996)
8. Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 333-354 (1983)
9. Lange, M., Somla, R.: Propositional dynamic logic of context-free programs and fixpoint logic with chop. Inf. Process. Lett. 100(2), 72-75 (2006)
10. Leivant, D.: Propositional dynamic logic with program quantifiers. Electronic notes in Theoretical Computer Science (to appear, 2008)
11. Löding, C., Lutz, C., Serre, O.: Propositional dynamic logic with recursive programs. Journal of Logic and Algebraic Programming 73, 51-69 (2007)
12. Nipkow, T.: Hoare logics for recursive procedures and unbounded nondeterminism. In: Brad-field, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471. pp. 103-119. Springer, Heidelberg (2002)
13. Nipkow, T.: Hoare logics for recursive procedures and unbounded nondeterminism. In: Brad-field, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471. Springer, Heidelberg (2002)
14. Pratt, V.: A decidable mu-calculus (preliminary report). In: Proceedings of the twenty-second IEEE Symposium on Foundations of Computer Science, pp. 421-427. Computer Society press, Los Angles (1981)
15. von Oheimb, D.: Hoare logic for mutual recursion and local variables. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol. 1738. pp. 168-180. Springer, Heidelberg (1999)