| The verifying compiler: A grand challenge for computing research |
| Full text |
Pdf
(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
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 36, Downloads (12 Months): 209, Citation Count: 13
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Gary T. Leavens , Jean-Raymond Abrial , Don Batory , Michael Butler , Alessandro Coglio , Kathi Fisler , Eric Hehner , Cliff Jones , Dale Miller , Simon Peyton-Jones , Murali Sitaraman , Douglas R. Smith , Aaron Stump, Roadmap for enhanced languages and methods to aid verification, Proceedings of the 5th international conference on Generative programming and component engineering, October 22-26, 2006, Portland, Oregon, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|