Equivalences among logics of programs
- 31 October 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 29 (2) , 160-170
- https://doi.org/10.1016/0022-0000(84)90027-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Deterministic dynamic logic is strictly weaker than dynamic logicInformation and Control, 1983
- Expressing program looping in regular dynamic logicTheoretical Computer Science, 1982
- Axiomatic Definitions of Programming LanguagesJournal of the ACM, 1982
- Nondeterministic flowchart programs with recursive procedures: semantics and correctness ITheoretical Computer Science, 1981
- Definability in dynamic logicJournal of Computer and System Sciences, 1981
- First-Order Dynamic LogicLecture Notes in Computer Science, 1979
- Finiteness is mu-ineffableTheoretical Computer Science, 1976
- Theory of Program Structures: Schemes, Semantics, VerificationPublished by Springer Nature ,1975
- Remarks on an infinitary language with constructive formulasThe Journal of Symbolic Logic, 1967
- Algorithmic properties of structuresTheory of Computing Systems, 1967