Book | Chapter
(1987) Mathematical logic and its applications, Dordrecht, Springer.
Non-deterministic program schemata and their relation to dynamic logic
V. A. Nepomniaschy, N. V. Shilov
pp. 137-147
Program schemata [1,2] theory is a branch of theoretical computer science which deals with properties of programs with non-interpreted functional and predicate symbols. Because of decidability of main properties (equivalence, halting and so on), a special place in this theory belongs to so-called Janov schemes [1], e.g., a complete system of equivalent transformations for Janov schemes in Algol-like syntax was developed by A. P. Ershov [2].
Publication details
DOI: 10.1007/978-1-4613-0897-3_9
Full citation:
Nepomniaschy, V. A. , Shilov, N. V. (1987)., Non-deterministic program schemata and their relation to dynamic logic, in D. G. Skordev (ed.), Mathematical logic and its applications, Dordrecht, Springer, pp. 137-147.
This document is unfortunately not available for download at the moment.