Propositional dynamic logic of regular programs

Abrahamson, 1978, Applications of Boolean Variables to Automata Theory and Dynamic Logic

Berman, 1977, Test-Free Propositional Dynamic Logic is Weaker than PDL, Tech. Report TR 77-10-02

Chandra, 1976, Alternation, 98

Constable, 1977, On the theory of programming logics, 269

Dijkstra, 1975, Guarded commands, nondeterminacy and formal derivation of programs, Comm. ACM 18, 8, 453, 10.1145/360933.360975

Greibach, 1975, Theory of Program Structures: Schemes, Semantics, Verification, 10.1007/BFb0023017

Harel, 1978, Logics of Programs: Axiomatics and Descriptive Power

Harel, 1978

Harel, 1977, Computatibility and completeness in logics of programs: preliminary report, 261

Harel, 1978, Nondeterminism in logics of programs

Hoare, 1969, An axiomatic basis for computer programming, Comm. ACM 12, 10, 576, 10.1145/363235.363259

Hoare, 1969, An axiomatic basis for computer programming, Comm. ACM 12, 10, 583

Hoare, 1974, Consistent and complementary formal theories of the semantics of programming languages, Acta Inform. 3, 2, 135

Kozen, 1976, On parallelism in Turing machines, 89

Kreczmar, 1974, Effectivity problems of algorithmic logic

Kripke, 1963, Sementical analysis of modal logic I: Normal modal propositional calculi, Z. Math. Logik Grundlagen Math., 9, 67, 10.1002/malq.19630090502

Kröger, 1976, Logical rules of natural reasoning about programs, 87

Ladner, 1977, The computational complexity of provability in systems of modal propositional logic, SIAM J. Comput. 6, 3, 467, 10.1137/0206033

Meyer, 1973, Word problems requiring exponential time, 1

Parikh, 1978, A completeness result for PDL

Pratt, 1976, Semantical considerations on Floyd-Hoare logic, 109

Pratt, 1978, A practical decision method for propositional dynamic logic, 326

Saltvicki, 1970, Formalized algorithmic languages, Bull. Acad. Polon. Sci. Sir. Sci. Math. Astronom. Phys., 18, 227

Segerberg, 1977, A completeness theorem in the modal logic of programs, Notices Amer. Math. Soc. 24, 6, A