×

On formalised computer programs. (English) Zbl 0209.18704


MSC:

68N01 General topics in the theory of software
68Q60 Specification and verification (program logics, model checking, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Davis, M., (Computability and Unsolvability (1958), McGraw-Hill Book Co.: McGraw-Hill Book Co. New York) · Zbl 0080.00902
[2] Ianov, Iu. I., The logical schemes of algorithms, Problems of Cybernetics (USSR), 1, 82-140 (1960) · Zbl 0142.24801
[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, (Braffort, P.; Hirschberg, D., Computer Programming and Formal Systems (1963), North-Holland: North-Holland Amsterdam), 33-70 · Zbl 0203.16402
[5] Paterson, M., Equivalence Problems in a Model of Computation, (Doctoral Dissertation (1967), Cambridge University)
[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, (Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design (1963)), 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. 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.