Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Deciding properties of nonregular programs
SIAM Journal on Computing
Languages, automata, and logic
Handbook of formal languages, vol. 3
Dynamic Logic
More on Nonregular PDL: Expressive Power, Finite Models, Fibonicci Programs
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Strengthened Results on Nonregular PDL
Strengthened Results on Nonregular PDL
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A fixpoint calculus for local and global program flows
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PDL with intersection and converse is decidable
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Propositional dynamic logic of context-free programs and fixpoint logic with chop
Information Processing Letters
A CTL-based logic for program abstractions
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Branching-time logics with path relativisation
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiability problem for this extension remains decidable, generalising known decidability results for extensions of PDL by non-regular programs.