A Tour of Formal Verification with Coq:Knuths Algorithm for Prime NumbersReport as inadecuate




A Tour of Formal Verification with Coq:Knuths Algorithm for Prime Numbers - Download this document for free, or read online. Document in PDF available to download.

1 LEMME - Software and mathematics CRISAM - Inria Sophia Antipolis - Méditerranée

Abstract : In his book -The Art of Computer Programming-, Donald Knuth gives an algorithm to compute the first n prime numbers. Surprisingly, proving the correctness of this simple algorithm from basic principles is far from being obvious and requires a wide range of verification techniques. In this paper, we explain how the verification has been mechanized in the Coq proof system.

Keywords : PROGRAM VERIFICATION COQ PRIME NUMBERS BERTRAND-S POSTULATE





Author: Laurent Théry -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents