Program verification: the very idea

Communications of the Acm 31 (9):1048--1063 (1988)
  Copy   BIBTEX

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,286

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Vindication of Program Verification.Selmer Bringsjord - 2015 - History and Philosophy of Logic 36 (3):262-277.
Introduction to Logic Programming.Christopher John Hogger - 1984 - London, England: Academic Press.
Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.
A Property of 2‐Sorted Peano Models and Program Verification.L. Csirmaz & J. B. Paris - 1984 - Mathematical Logic Quarterly 30 (19-24):325-334.

Analytics

Added to PP
2009-04-07

Downloads
178 (#143,585)

6 months
7 (#736,145)

Historical graph of downloads
How can I increase my downloads?