Communications of the Acm 31 (9):1048--1063 (1988)
AbstractThe notion of program verification appears to trade upon an equivocation. Algorithms, as logical structures, are appropriate subjects for deductive verification. Programs, as causal models of those structures, are not. The success of program verification as a generally applicable and completely reliable method for guaranteeing program performance is not even a theoretical possibility.
Similar books and articles
Deductive program verification (a practitioner's commentary).David A. Nelson - 1992 - Minds and Machines 2 (3):283-307.
The use of a formal simulator to verify a simple real time control program.Robert Boyer - manuscript
Program Verification and Functioning of Operative Computing Revisited: How about Mathematics Engineering? [REVIEW]Uri Pincas - 2011 - Minds and Machines 21 (2):337-359.
Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?Ildikó Sain - 1988 - Studia Logica 47 (3):279 - 301.
Verificationist Theory of Meaning.Markus Schrenk - 2008 - In U. Windhorst, M. Binder & N. Hirowaka (eds.), Encyclopaedic Reference of Neuroscience. Springer.
Philosophical aspects of program verification.James H. Fetzer - 1991 - Minds and Machines 1 (2):197-216.
Program verification, defeasible reasoning, and two views of computer science.Timothy R. Colburn - 1991 - Minds and Machines 1 (1):97-116.
Added to PP
Historical graph of downloads
Citations of this work
Computer Simulations in Science and Engineering. Concept, Practices, Perspectives.Juan Manuel Durán - 2018 - Springer.
The derivation-indicator view of mathematical practice.Jody Azzouni - 2004 - Philosophia Mathematica 12 (2):81-106.
Philosophy of Computer Science: An Introductory Course.William J. Rapaport - 2005 - Teaching Philosophy 28 (4):319-341.
Abstraction in computer science.Timothy Colburn & Gary Shute - 2007 - Minds and Machines 17 (2):169-184.
References found in this work
No references found.