Skip to main content
Conference ProceedingsOPEN ACCESS

The ideal of verified software

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4144 LNCS 5-16
DOI: 10.1007/11817963_4
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The ideal of verified software has long been the goal of research in Computer Science. This paper argues that the time is ripe to embark on a Grand Challenge project to construct a program verifier, based on a sound and complete theory of programming, and evaluated by experimental application to a large and representative sample of useful computer software. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Hoare, T. (2006). The ideal of verified software. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4144 LNCS, pp. 5–16). Springer Verlag. https://doi.org/10.1007/11817963_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free