This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
de Bakker, J.W. The fixed-point approach in semantics: theory and applications. In: Foundations of Comp. Sci. (J.W.de Bakker, Ed.) pp.3–53, 1975. Mathematical Centre Tracts 63, Amsterdam 1975
de Bakker, J.W. and Meertens, L.G.L.T. On the completeness of the inductive assertion method. J. Comp.Syst.Sci., 11 (1975), 323–257
Basu, S.K. and Yeh, R.T. Strong verification of programs. IEEE Trans. on Software Eng., SE-1 (1975), 339–345.
Bekić, H. Definable operations in general algebras and the theory of automata and flowcharts. unpublished manuscript, IBM Laboratory, Vienna 1969.
Blikle, A. Iterative systems; an algebraic approach, Bull. Acad. Polon. des Sci., Ser.sci.math.astronom. et phys., 20 (1971), 51–55
Blikle, A. An analysis of programs by algebraic means. In: Mathematical Foundations of Comp. Sci. (A.Mazurkiewicz, Ed.), Banach Center Publications, vol.2 (1977), Polish Scientific Publishers, Warsaw 1977
Blikle, A. An analytic approach to the verification of iterative programs. Proc. IFIP-1977 Congress, Toronto 1977
Blikle, A. and Budkowski, S. Certification of microprograms by an algebraic method. Micro-9 Proc., Ninth Annual Workshop on Micro-programming, September 1976, 9–14
Blikle, A. and Mazurkiewicz, A. An algebraic approach to the theory of programs, algorithms, languages and recursiveness. In: Math. Found. Comp. Sci. (Proc. Warsaw-Jablonna, 1972), Warsaw 1972
Dijkstra, E. A Discipline of Programming. Prentice-Hall, Inc., Englewood Cliffs 1976
Floyd, R.W. Assigning meanings to programs. Proc. Symp. in Applied Math. 19 (1967), 19–32
Hoare, C.A.R. An axiomatic basis for computer programming, Communication of ACM, 12 (1969), 576–583
Katz, S. and Manna, Z. Logical analysis of programs. Communications of ACM, 19 (1976), 188–206
Kleene, S.C. Introduction to Metamathematics, North-Holland, Amsterdam 1952
Landin, P.J. The next 700 programming languages, Communication of ACM, 9 (1966), 157–164
Manna, Z. The correctness of programs. J. Comp. Syst. Sci., 3 (1969), 119–127
Manna, Z. Mathematical Theory of Computation. McGraw-Hill, New York 1974
Manna, Z. and Pnueli, A. Axiomatic approach to total correctness of programs. Acta Informatica (1974)
Mazurkiewicz, A. Proving algorithms by tail functions. Working paper for IFIP WG 2.2. February 1970, since published in Information and Control, 18 (1971), 220–226
Mazurkiewicz, A. Iteratively computable relations. Bull. Acad. Polon. Sci., Ser.sci.math.astronom. phys., 20 (1972), 793–797
Mazurkiewicz, A. Proving properties of processes. Algorytmy, 11 (1974), 5–22
Milne, R. and Strachey, Ch. A Theory of Programming Language Semantics, Chapman and Hall, London 1977
Morris, F.L. The next 700 programming language description, unpublished manuscript.
Mosses, P. The mathematical semantics of ALGOL 60. Technical Monograph PRG-12, Oxford University, 1974
Park, D. Fixpoint induction and proofs of program properties. In: Machine Intelligence, vol. 5 (B. Meltzer and D. Michie eds.), pp.59–78. Edinburgh University Press, Edinburgh 1970
de Roever, W.P. Dijkstra's predicate transformer, non-determinism, recursion and termination. In: Math. Found. Comp. Sci. 1976 (Proc. Symp. Gdansk, 1976, A. Mazurkiewicz, Ed.) Lecture Note in CS, Springer, Berlin, 472–481
Scott, D. and de Bakker, J.W. A theory of programs, unpublished notes, IBM seminar, Vienna 1969
Strachey, C. and Wadsworth, C.P. Continuation, a mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford 1974
Tarski, A. A lattice-theoretic fixedpoint theorem and its applications. Pacific Journal of Math., 5 (1955), 285–309
Turing, A.M. On checking a large routine. Report of a Conference on High Speed Automatic Calculating Machines, pp.67–69, University Mathematical Laboratory, Cambridge 1949
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blikle, A. (1977). A comparative review of some program verification methods. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_124
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_124
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive