×

zbMATH — the first resource for mathematics

Propositional dynamic logic of regular programs. (English) Zbl 0408.03014

MSC:
03B45 Modal logic (including the logic of norms)
68Q65 Abstract data types; algebraic specification
68N01 General topics in the theory of software
03B60 Other nonclassical logic
68W99 Algorithms in computer science
68Q05 Models of computation (Turing machines, etc.) (MSC2010)
03D10 Turing machines and related notions
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Abrahamson, K.; Fischer, M.J., Applications of Boolean variables to automata theory and dynamic logic, ()
[2] Berman, F.; Paterson, M.S., Test-free propositional dynamic logic is weaker than PDL, Tech. report TR 77-10-02, (1977)
[3] Chandra, A.K.; Stockmeyer, L.J., Alternation, (), 98-108
[4] Constable, R.L., On the theory of programming logics, (), 269-285
[5] Dijkstra, E.W., Guarded commands, nondeterminacy and formal derivation of programs, Comm. ACM 18, 8, 453-457, (1975) · Zbl 0308.68017
[6] Greibach, S.A., Theory of program structures: schemes, semantics, verification, () · Zbl 0345.68002
[7] Harel, D.; Harel, D., Logics of programs: axiomatics and descriptive power, (), Available as · Zbl 0589.68030
[8] Harel, D.; Meyer, A.R.; Pratt, V.R., Computatibility and completeness in logics of programs: preliminary report, (), 261-268
[9] Harel, D.; Pratt, V.R., Nondeterminism in logics of programs, ()
[10] Hoare, C.A.R.; Hoare, C.A.R., An axiomatic basis for computer programming, Comm. ACM 12, Comm. ACM 12, 10, 583-580, (1969) · Zbl 0179.23105
[11] Hoare, C.A.R.; Lauer, P., Consistent and complementary formal theories of the semantics of programming languages, Acta inform. 3, 2, 135-153, (1974) · Zbl 0264.68006
[12] Kozen, D., On parallelism in Turing machines, (), 89-97
[13] Kreczmar, A., Effectivity problems of algorithmic logic, () · Zbl 0294.68017
[14] Kripke, S.A., Sementical analysis of modal logic I: normal modal propositional calculi, Z. math. logik grundlagen math., 9, 67-96, (1963) · Zbl 0118.01305
[15] Kröger, F., Logical rules of natural reasoning about programs, (), 87-98 · Zbl 0362.68038
[16] Ladner, R.E., The computational complexity of provability in systems of modal propositional logic, SIAM J. comput. 6, 3, 467-480, (1977) · Zbl 0373.02025
[17] Meyer, A.R.; Stockmeyer, L.J., Word problems requiring exponential time, (), 1-9 · Zbl 0359.68050
[18] Parikh, R., A completeness result for PDL, () · Zbl 0188.02102
[19] Pratt, V.R., Semantical considerations on floyd-Hoare logic, (), 109-121
[20] Pratt, V.R., A practical decision method for propositional dynamic logic, (), 326-337 · Zbl 1283.03066
[21] Saltvicki, A., Formalized algorithmic languages, Bull. acad. polon. sci. sir. sci. math. astronom. phys., 18, 227-232, (1970) · Zbl 0198.02801
[22] Segerberg, K., A completeness theorem in the modal logic of programs, Notices amer. math. soc. 24, 6, A-552, (1977)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.