Program verification: the very idea

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
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Translate to english
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,871
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
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.
Programming Languages as Technical Artifacts.Raymond Turner - 2014 - Philosophy and Technology 27 (3):377-397.

View all 13 citations / Add more citations

Similar books and articles
Added to PP index
2009-04-07

Total downloads
91 ( #64,900 of 2,231,923 )

Recent downloads (6 months)
2 ( #265,272 of 2,231,923 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature