On separation of the emptiness and equivalence problems for program schemes. (English) Zbl 0559.68018
MSC:
| 68Q60 | Specification and verification (program logics, model checking, etc.) |
References:
| [1] | Nepomniaschy, V. A., On the totality problem for program schemes, Kybernetica, 3, 47-56 (1983), (in Russian) |
| [2] | Auzins, A. J., On constructing of a complete system of examples for one class of programs, Soviet Math. Dokl., 278, 3, 564-568 (1984), (in Russian) |
| [3] | Kotov, V. E., Introduction to the Theory of Program Schemes (1978), Nauka: Nauka Novosibirsk, (in Russian) |
| [4] | Aho, A. V.; Ullman, J. D., (The Theory of Parsing, Translation and Compiling, Vol. 1 (1972), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ) |
| [5] | Minsky, M., Computation: Finite and Infinite Machines (1967), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0195.02402 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
