The Verifying Compiler a Grand Challenge for Computing …验证编译器用于计算一个大挑战….pptVIP

The Verifying Compiler: a Grand Challenge for Computing Research Tony Hoare John von Neumann Society October 6, 2004 Typical Grand Challenges Prove Fermat’s last theorem (accomplished) Put a man on the moon (accomplished) Cure cancer within ten years (failed in 1970s) Find the Higgs boson (in progress) Map the Human Genome (accomplished) In Computing Science Prove that P is not equal to NP (open) The Turing test (outstanding) A championship chess program (completed 1997) The verifying compiler (in progress) A Grand Challenge May take fifteen years or more to complete Attracts world-wide participation Has a clear test of success or failure Pursues scientific ideals Enlarges fundamental understanding pursues scientific ideals in an area of significance to mankind A Grand Challenge needs Maturity of the state of the art Support from the scientific community Commitment from the teams that engage in it Understanding from funding agencies The Verifying Compiler A verifying compiler uses automated mathematical and logical reasoning to check the correctness of the programs that it compiles. Correctness is specified by types, assertions, specifications, and other redundant annotations that accompany the code of the program. Test of success Significant software products are analysed mechanically and formally verified, ranging from safety-critical and embedded codes to open source and legacy applications verified at an appropriate level of safety/soundness/security/service. Verified programs replace existing versions in use subsequent evolution will maintain correctness. Verification is integrated into commercial toolsets Fundamental understanding What is this program for? Its specification tells you its function How does it work? Annotation at interfaces explains how. Why does it work? The theory of programming explains why. Are the answers accurate? A verifying compiler provides a reliable check Scientific ideals The project complem