Abstract
By a computation of a program we mean any finite or infinite sequence of consecutive data-vector states generated by the program during a run. The set of all such computations can be considered as the program meaning. Analysing programs by sets of computations permits one to deal not only with input-output properties like correctness or termination, but also with properties of runs independently are they finite or not. In particular one can analyse system-like programs, where no output at all is expected. Given a program to be analysed we split it into a finite number of modules each of them simple enough for the set of all its computations to be obvioust. Sets of computations associated to modules are combined then into a global set in a way that is described by operational semantics. This semantics — being of litle use for program analysis — is supplemented then by a fixed point semantics that is proved equivalent to the former. Two examples of program analysis are considered: the McCarthy's 91-procedure and a consumer-producer system-like program.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BLIKLE, A. Nets, complete lattices with a composition. Bull. Acad. Polon. Sci., Ser. Sci. Mathemat. Astronom. Phys. 19(1971), 1123–1127
BLIKLE, A. Equations in nets — computer oriented lattices. CC PAS Reports 99(1973)
BLIKLE, A. An algebraic approach to programs and their computations. Math. Found. Comp. Sci. II (Proc. Symp. High Tatras, 1973) pp. 17–26. High Tatras 1973
BLIKLE, A. An extended approach to mathematical analysis of programs. (Roughly revised notices to lectures delivered during MFCS-74 Semester in the Intern. Mathem. S.Banach Center in Warsaw, 1974) CC PAS Reports 169(1974)
BLIKLE, A. Proving programs by δ-relations. Formalization of Semantics of Programming Languages and Writing of Compilers, (Proc. Symp. Frankfurt/Oder, 1974), Elektronische Informationesverarbeitung und Kybernetik (to appear)
BLIKLE, A.; MAZURKIEWICZ, A. An algebraic approach to the theory of programs, algorithms, languages and recursiveness. Math. Found. Comp. Sci. I (Proc. Symp. Warsaw-Jablonna, 1972), Warsaw 1972
MANNA, Z.; PNUELI, A. Axiomatic approach to total correctness of programs. Stanford Art. Intel. Lab., Memo AIM-210, Stanford 1973; also Acta Informatica ?(1974)
MAZURKIEWICZ, A. Iteratively computable relations. Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 20(1972), 793–798
MAZURKIEWICZ, A. Proving properties of processes. CC PAS Reports 134(1973)
REDZIEJOWSKI, R.R. The theory of general events and its application to parallel programming. IBM Nordic Laboratory Sweden TP. 18.220 (1972)
SCOTT, D. Outline of a mathematical theory of computations. Techn. Mon. PRG-2, Oxford 1970
TARSKI, A. A lattice-theoretic fixpoint theorem and its applications. Pacific Jour. Math. 5(1955), 285–309
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blikle, A. (1975). Proving programs by sets of computations. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_694
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_694
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive