More on nonregular PDL: finite models and Fibonacci-like programs
Information and Computation
First-Order Dynamic Logic
Dynamic Logic
Recursion in logics of programs
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Hoare Logic for Mutual Recursion and Local Variables
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A complete axiomatic system for proving deductions about recursive programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Propositional dynamic logic of context-free programs and fixpoint logic with chop
Information Processing Letters
A decidable mu-calculus: Preliminary report
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Propositional Dynamic Logic with Program Quantifiers
Electronic Notes in Theoretical Computer Science (ENTCS)
Specification in PDL with recursion
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
| Hi-index | 0.00 |
We present a simple and natural deductive formalism μPDL for propositional dynamic logic for recursive procedures, including simultaneous recursion. Though PDL with recursive programs is known to be highly undecidable, natural deductive formalisms for it are of substantial interest, because they distill the essential logical components of recursive procedures. We also show that Pratt-Kozen's μ-Calculus, in which fixpoints are taken over formulas rather than programs, is interpretable in μPDL.