zbMATH — the first resource for mathematics

On formalised computer programs. (English) Zbl 0209.18704

68N01 General topics in the theory of software
68Q60 Specification and verification (program logics, model checking, etc.)
Full Text: DOI
[1] Davis, M., ()
[2] Ianov, Iu.I., The logical schemes of algorithms, Problems of cybernetics (USSR), 1, 82-140, (1960)
[3] Luckham, D.; Park, D., The undecidability of the equivalence problem for program schemata, Bolt, beranek and Newman inc., report no. 1141, santa ana, calif., (1964)
[4] McCarthy, J., A basis for a mathematical theory of computation, (), 33-70
[5] Paterson, M., Equivalence problems in a model of computation, ()
[6] Rabin, M.; Scott, D., Finite automata and their decision problems, IBM J. res. develop., 3, 114-125, (1959) · Zbl 0158.25404
[7] Rosenberg, A., On multi-head finite automata, (), 221-228
[8] Rutledge, J., On Ianov’s program schemata, J. assoc. comput. Mach., 11, 1-9, (1964) · Zbl 0121.12107
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.