Why There is no General Solution to the Problem of Software Verification

Foundations of Science 25 (3):541-557 (2020)
  Copy   BIBTEX

Abstract

How can we be certain that software is reliable? Is there any method that can verify the correctness of software for all cases of interest? Computer scientists and software engineers have informally assumed that there is no fully general solution to the verification problem. In this paper, we survey approaches to the problem of software verification and offer a new proof for why there can be no general solution.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,676

External links

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

Through your library

Analytics

Added to PP
2019-06-03

Downloads
23 (#935,056)

6 months
5 (#1,032,319)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

John Symons
University of Kansas

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
In defense of proper functions.Ruth Millikan - 1989 - Philosophy of Science 56 (June):288-302.
Computing Machinery and Intelligence.Alan M. Turing - 2003 - In John Heil (ed.), Philosophy of Mind: A Guide and Anthology. New York: Oxford University Press.
Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.

View all 19 references / Add more references