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)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,740
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

No references found.

Add more references

Citations of this work BETA

The Derivation-Indicator View of Mathematical Practice.Jody Azzouni - 2004 - Philosophia Mathematica 12 (2):81-106.
Specification.Raymond Turner - 2011 - Minds and Machines 21 (2):135-152.
Abstraction in Computer Science.Timothy Colburn & Gary Shute - 2007 - Minds and Machines 17 (2):169-184.

View all 36 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-04-07

Total views
122 ( #90,679 of 2,462,870 )

Recent downloads (6 months)
6 ( #119,641 of 2,462,870 )

How can I increase my downloads?

Downloads

My notes