Tony Hoare
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.
- Floyd, R. W. 1967. Assigning meanings to programs. Proc. Amer. Soc. Symp. Appl. Math. 19, 19--31.Google Scholar
Cross Ref
- Gray, J. 2003. What next? A dozen information-technology research goals. JACM 50, 1 (Jan.), 41--57. Google ScholarDigital Library
- McCarthy, J. 1963. Towards a mathematical theory of computation. Proc. IFIP Cong. 1962. North-Holland, Amsterdam, The Netherlands.Google Scholar
- Turing, A. M. 1949. Checking a large routine. Report on a Conference on High Speed Automatic Calculating Machines. Cambridge Univ. Math. Lab. 67--69.Google Scholar
Index Terms
- The verifying compiler: A grand challenge for computing research
Recommendations
The verifying compiler: a grand challenge for computing research
CC'03: Proceedings of the 12th international conference on Compiler constructionI propose a set of criteria which 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 ...
Designing a verifying compiler
We reflect on our experiences verifying software with the Whiley verifying compiler.We identify a number of patterns for resolving common verification problems.We report on three case studies illustrating software verification with Whiley. An ongoing ...
Comments