AbstractWe introduce a fundamental propositional logical system based on modal logic for describing correctness, termination and equivalence of programs. We define a formal syntax and semantics for the propositional dynamic logic of regular programs and give several consequences of the definition. Principal conclusions are that deciding satisfiability of length n formulas requires time dn/logn for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c. We provide applications of the decision procedure to regular expressions, Ianov schemes, and classical systems of modal logic
AbstractWe propose an extension of Propositional Dynamic Logic which allows a new kind of program te...
AbstractWe give an algorithm for “before-after” reasoning about action. The algorithm decides satisf...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractWe introduce a fundamental propositional logical system based on modal logic for describing ...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Non-regular program correctness properties play an important role in the specification of unbounded ...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
AbstractWe propose an extension of Propositional Dynamic Logic which allows a new kind of program te...
Modal logic is a widely applicable method of reasoning for many areas of computer science. These are...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
AbstractThis work presents a Propositional Dynamic Logic (πDL) in which the programs are described i...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
AbstractWe present a new technique for obtaining decision procedures for modal logics of programs. T...
AbstractWe extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind o...
AbstractWe propose an extension of Propositional Dynamic Logic which allows a new kind of program te...
AbstractWe give an algorithm for “before-after” reasoning about action. The algorithm decides satisf...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractWe introduce a fundamental propositional logical system based on modal logic for describing ...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Non-regular program correctness properties play an important role in the specification of unbounded ...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
AbstractWe propose an extension of Propositional Dynamic Logic which allows a new kind of program te...
Modal logic is a widely applicable method of reasoning for many areas of computer science. These are...
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recurs...
Abstract—We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propo...
AbstractThis work presents a Propositional Dynamic Logic (πDL) in which the programs are described i...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
AbstractWe present a new technique for obtaining decision procedures for modal logics of programs. T...
AbstractWe extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind o...
AbstractWe propose an extension of Propositional Dynamic Logic which allows a new kind of program te...
AbstractWe give an algorithm for “before-after” reasoning about action. The algorithm decides satisf...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...