Non-deterministic program schemata and their relation to dynamic logic
pp. 137-147
in: Dimiter G. Skordev (ed), Mathematical logic and its applications, Berlin, Springer, 1987Abstract
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].