ACM Home Page
Please provide us with feedback. Feedback
The verifying compiler: A grand challenge for computing research
Full text PdfPdf (42 KB)
Source Journal of the ACM (JACM) archive
Volume 50 ,  Issue 1  (January 2003) table of contents
Pages: 63 - 69  
Year of Publication: 2003
ISSN:0004-5411
Author
Tony Hoare  Microsoft Research Ltd., Cambridge, UK
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 36,   Downloads (12 Months): 209,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/602382.602403
What is a DOI?

ABSTRACT

This contribution proposes a set of criteria that distinguish a grand challenge in science or engineering from the many other kinds of short-term or long-term research problems that engage the interest of scientists and engineers. As an example drawn from Computer Science, it revives an old challenge: the construction and application of a verifying compiler that guarantees correctness of a program before running it.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Floyd, R. W. 1967. Assigning meanings to programs. Proc. Amer. Soc. Symp. Appl. Math. 19, 19--31.
2
 
3
McCarthy, J. 1963. Towards a mathematical theory of computation. Proc. IFIP Cong. 1962. North-Holland, Amsterdam, The Netherlands.
 
4
Turing, A. M. 1949. Checking a large routine. Report on a Conference on High Speed Automatic Calculating Machines. Cambridge Univ. Math. Lab. 67--69.

CITED BY  13