Abstract
As an alternative to methods by which the correctness of given programs can be established a posteriori, this paper proposes to control the process of program generation such as to produce a priori correct programs. An example is treated to show the form that such a control might then take. This example comes from the field of parallel programming; the way in which it is treated is representative of the way in which a whole multiprogramming system has actually been constructed.
Similar content being viewed by others
References
Robert W. Floyd,Assigning Meanings to Programs, Proceedings of Symposia in Applied Mathematics, Volume 19,Mathematical Aspects of Computer Science, pg. 19–32, American Mathematical Society, 1967.
John McCarthy and James Painter,Correctness of a Compiler for Arithmetic Expressions, Technical Report No. CS38, April 29, 1966, Computer Science Department, Stanford University.
Peter Naur,Proof of Algorithms by General Snapshots, BIT vol. 6, 1966, pg. 310–316.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dijkstra, E.W. A constructive approach to the problem of program correctness. BIT 8, 174–186 (1968). https://doi.org/10.1007/BF01933419
Issue Date:
DOI: https://doi.org/10.1007/BF01933419