The propositional dynamic logic of deterministic, well-structured programs
Authors:
- Joseph Y. HalpernJHJoseph Y. Halpern
- John H. ReifJRJohn H. Reif
- 1 January 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 27 (1-2) , 127-165
Abstract
No abstract availableKeywords
Funding Information
- Engineering and Physical Sciences Research Council
- National Science Foundation (3KXWlO707, MCSW2 1023)
- Office of Naval Research (WO1-b80COh47)
This publication has 9 references indexed in Scilit:
- Deterministic propositional dynamic logic: Finite models, complexity, and completenessJournal of Computer and System Sciences, 1982
- Expressing program looping in regular dynamic logicTheoretical Computer Science, 1982
- The prepositional dynamic logic of deterministic, well-structured programs1981
- Propositional dynamic logic of context-free programs1981
- Temporal logic can be more expressive1981
- An elementary proof of the completeness of PDLTheoretical Computer Science, 1981
- A near-optimal method for reasoning about actionJournal of Computer and System Sciences, 1980
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970