Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)
"E-correctness" of a set of "computation processes"
KeywordsComputation Process Partial Function Program Versus Predicate Symbol Procedure Call
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Nishizawa, T. A proposal on proving correctness of programs (in Japanese), Fundamental Theory of Information Science I, conference record of LA Symposium, 73–78 (1977)Google Scholar
- 2.Sugawara, K. An extension of the theory of program verifications based on the regularity of Paths. Master's thesis, Dep. of Mathematics, Fac. of Science, Tokyo Univ. (1978)Google Scholar
- 3.Manna, Z. and Waldinger, R. Is "sometime" sometimes better than "always"? Intermittent assertions in proving program correctness. Proc. 2nd Int. Conf. on Software Engineering. (1976)Google Scholar
- 4.Manna, Z. Mathematical Theory of Computation, McGraw-Hill, New Youk. (1974)Google Scholar
© Springer-Verlag Berlin Heidelberg 1979