Communications of the ACM 31 (9):1048--1063 (1988)
|Abstract||The 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.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.
James H. Fetzer (1991). Philosophical Aspects of Program Verification. Minds and Machines 1 (2):197-216.
Markus Schrenk (2008). Verificationist Theory of Meaning. In U. Windhorst, M. Binder & N. Hirowaka (eds.), Encyclopaedic Reference of Neuroscience. Springer.
Ildikó Sain (1988). Is “Some-Other-Time” Sometimes Better Than “Sometime” for Proving Partial Correctness of Programs? Studia Logica 47 (3):279 - 301.
Uri Pincas (2011). Program Verification and Functioning of Operative Computing Revisited: How About Mathematics Engineering? Minds and Machines 21 (2):337-359.
Cora Diamond (1999). How Old Are These Bones? Putnam, Wittgenstein and Verification: Cora Diamond. Aristotelian Society Supplementary Volume 73 (1):99–134.
David A. Nelson (1992). Deductive Program Verification (a Practitioner's Commentary). Minds and Machines 2 (3).
Added to index2009-04-07
Total downloads69 ( #12,623 of 549,128 )
Recent downloads (6 months)1 ( #63,361 of 549,128 )
How can I increase my downloads?