Minds and Machines 2 (3):283-307 (1992)

A proof of ‘correctness’ for a mathematical algorithm cannot be relevant to executions of a program based on that algorithm because both the algorithm and the proof are based on assumptions that do not hold for computations carried out by real-world computers. Thus, proving the ‘correctness’ of an algorithm cannot establish the trustworthiness of programs based on that algorithm. Despite the (deceptive) sameness of the notations used to represent them, the transformation of an algorithm into an executable program is a wrenching metamorphosis that changes a mathematical abstraction into a prescription for concrete actions to be taken by real computers. Therefore, it is verification of program executions (processes) that is needed, not of program texts that are merely the scripts for those processes. In this view, verification is the empirical investigation of: (a) the behavior that programs invoke in a computer system and (b) the larger context in which that behavior occurs. Here, deduction can play no more, and no less, a role than it does in the empirical sciences.
Keywords Algorithms  computers  computer programs  program executions (processes)  program verification (‘correctness’ proofs, testing)  representations (objects)  software reliability
Categories (categorize this paper)
DOI 10.1007/BF02454224
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 56,060
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Number, the Language of Science.Tobias Dantzig - 1954 - New York: Free Press.
Program Verification: The Very Idea.James H. Fetzer - 1988 - Communications of the Acm 31 (9):1048--1063.
Proofs and Refutations: The Logic of Mathematical Discovery.Daniel Isaacson - 1978 - Philosophical Quarterly 28 (111):169-171.

View all 6 references / Add more references

Citations of this work BETA

The Philosophy of Computer Science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
How Minds Can Be Computational Systems.William J. Rapaport - 1998 - Journal of Experimental and Theoretical Artificial Intelligence 10 (4):403-419.
The Specification of “Specification”.Derek Partridge & Antony Galton - 1995 - Minds and Machines 5 (2):243-255.

Add more citations

Similar books and articles


Added to PP index

Total views
24 ( #430,325 of 2,403,718 )

Recent downloads (6 months)
1 ( #550,229 of 2,403,718 )

How can I increase my downloads?


My notes