Propositional dynamic logic of regular programs

Journal of Computer and System Sciences

Volumn 18, Issue 2, 1979, Pages 194-211

  Fischer, Michael J ^a   Ladner, Richard E ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

EID: 0018454915     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(79)90046-1     Document Type: Article

References (24)

1. Applications of Boolean Variables to Automata Theory and Dynamic Logic
2. Test-Free Propositional Dynamic Logic is Weaker than PDL
3. Alternation
4. On the theory of programming logics
5. Guarded commands nondeterminacy and formal derivation of programs
6. Theory of Program Structures: Schemes, Semantics, Verification
7. Logics of Programs: Axiomatics and Descriptive Power
8. Computatibility and completeness in logics of programs preliminary report
9. Nondeterminism in logics of programs
10. An axiomatic basis for computer programming
11. An axiomatic basis for computer programming
12. Consistent and complementary formal theories of the semantics of programming languages
13. On parallelism in Turing machines
14. Effectivity problems of algorithmic logic
15. Sementical analysis of modal logic I Normal modal propositional calculi
16. Logical rules of natural reasoning about programs
17. The computational complexity of provability in systems of modal propositional logic
18. Word problems requiring exponential time
19. A completeness result for PDL
20. Semantical considerations on Floyd-Hoare logic
21. A practical decision method for propositional dynamic logic
22. Formalized algorithmic languages
23. A completeness theorem in the modal logic of programs