Proofs of Correctness in Mathematics and Industry
Author:
- 14 December 2007
- book chapter
- Published by Wiley
Abstract
Quality of a product needs verification. If the product is complex, this verification cannot be done “by hand,” but one needs tools. The question then arises how those tools are being checked. Eventually quality comes from a careful specification and design methodology. Correctness is based on a mathematical proof that the design meets its specification. As mathematical proofs become long and complex themselves, we also need a tool to verify proofs. In order to prevent an infinite regress, this last tool must have a basic simplicity. Indeed, mathematical assistants that help users to develop and verify proofs are build on the current foundational logical systems that can be described in a couple of pages. It is expected that within a couple of decades, the use of reliable mathematical assistants will be widespread and will help the human user to learn, develop, teach, communicate, referee, and apply mathematics. Computer‐verified correctness will probably become one of the most important applications of mathematics and computer science.Keywords
This publication has 16 references indexed in Scilit:
- Analysis of a biphase mark protocol with U ppaal and PVSFormal Aspects of Computing, 2006
- A proof of the Kepler conjectureAnnals of Mathematics, 2005
- The challenge of computer mathematicsPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2005
- Proof-Assistants Using Dependent Type Systems2001
- On B1998
- The Structure of Nuprl’s Type Theory1997
- The Mathematics of the Pentium Division BugSIAM Review, 1997
- Twenty-Five Years of Automath Research1994
- The mathematical language AUTOMATH, its usage, and some of its extensions1970
- Computer programs for checking mathematical proofs1962