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

Authors:
Martin Lange;Rafał Somla
Affiliations:
University of Munich, Institut für Informatik, München, Germany;University of Uppsala, IT Department, Uppsala, Sweden
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 1

More on nonregular PDL: finite models and Fibonacci-like programs

Information and Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
There Exit Decidable Context Free Propositional Dynamic Logics

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
A modal fixpoint logic with chop

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Propositional dynamic logic with recursive programs

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures

Propositional Dynamic Logic for Recursive Procedures

VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper compares propositional dynamic logic of non-regular programs and fixpoint logic with chop. It identifies a fragment of the latter which is equi-expressive to the former. This relationship transfers several decidability and complexity results between the two logics.