Propositional dynamic logic of regular programs
Michael J. Fischer, Richard E. Ladner · Journal of Computer and System Sciences · 1979
Cited by 1,193 works. doi:10.1016/0022-0000(79)90046-1
Authors
References
- An axiomatic basis for computer programming
- Guarded commands, nondeterminacy and formal derivation of programs
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 (1979), pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springer-Verlag, Berlin, Heidelberg, and New York, 1978, pp. 403–415. - Dexter Kozen and Rohit Parikh. An elementary proof of the completeness of PDL. Theoretical computer science, vol. 14(1981), pp. 113–118.
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Consistent and complementary formal theories of the semantics of programming languages
- On parallelism in turing machines
- The predictive analyzer and a path elimination technique
- On the theory of programming logics
- Theory of Program Structures: Schemes, Semantics, Verification