A note on equivalences among logics of programs
- 1 January 1982
- book chapter
- Published by Springer Nature
- p. 282-299
- https://doi.org/10.1007/bfb0025787
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Nondeterministic flowchart programs with recursive procedures: semantics and correctness ITheoretical Computer Science, 1981
- Unbounded program memory adds to the expressive power of first-order dynamic logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Definability in Dynamic LogicPublished by Association for Computing Machinery (ACM) ,1980
- Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretationsPublished by Association for Computing Machinery (ACM) ,1980
- First-Order Dynamic LogicLecture Notes in Computer Science, 1979
- Nondeterminism in logics of programsPublished by Association for Computing Machinery (ACM) ,1978
- Finiteness is mu-ineffableTheoretical Computer Science, 1976
- Theory of Program Structures: Schemes, Semantics, VerificationPublished by Springer Nature ,1975
- Translatability of schemas over restricted interpretationsJournal of Computer and System Sciences, 1974
- Algorithmic properties of structuresTheory of Computing Systems, 1967