Equivalences on program schemes. (English) Zbl 0209.18705


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


[1] Cooper, D. C., Program Scheme Equivalences and Second Order Logic, (Meltzer, B.; Michie, D., Machine Intelligence, 4 (1969), Edinburgh University Press) · Zbl 0221.68015
[2] Kaplan, D. M., The Formal Theoretic Analysis of Strong Equivalence for Elemental Programs, (Technical Report No. CS101 (1966), Computer Science Department, Stanford University)
[3] Luckham, D. C.; Park, D. M.R.; Paterson, M. S., On Formalised Computer Programs, J. Comp. and Syst. Sci., 4 (1970) · Zbl 0209.18704
[4] Manna, Z., Termination of Algorithms, (Ph.D. Thesis (1968), Computer Science Department, Carnegie-Mellon University) · Zbl 0285.68011
[5] Paterson, M. S., Equivalence Problems in a Model of Computation, (Ph. D. Thesis (1967), Cambridge University) · Zbl 0186.01103
[6] Rabin, M. O.; Scott, D., Finite automata and their decision problems, IBM J. Res. and Dev., 3, 114-125 (1959) · Zbl 0158.25404
[7] Milner, R., Program Schemes and Recursive Function Theory, (Michie, D., Machine Intelligence, 5 (1970), Edinburgh University) · Zbl 0221.68017
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.