The unwind property for programs with bounded memory
References (14)
Definability by programs in first-order structures
Theoret. Comput. Sci.
(1983)- et al.
Deterministic dynamic logic is strictly weaker than dynamic logic
Information and Control
(1983) - et al.
On the power of nondeterminism in dynamic logic
- et al.
Characterization of acceptable by Algol-like programming languages
Algorithmic logic
Theory of Program Structures: Schemes, Semantics, Verification
Definability by deterministic and non-deterministic programs
Information and Control
(1984)
There are more references available in the full text version of this article.
Cited by (1)
Some open questions in the theory of program schemes and dynamic logics
1989, Russian Mathematical Surveys
Copyright © 1985 Published by Elsevier B.V.