Proving pearl: Knuth's algorithm for prime numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2758, Issue , 2003, Pages 304-318

  Théry, Laurent ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; FORMAL LOGIC;

BASIC PRINCIPLES; PRIME NUMBER; PROOF SYSTEM; S-ALGORITHMS; SIMPLE ALGORITHM; VERIFICATION TECHNIQUES;

THEOREM PROVING;

EID: 35248876677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10930755_20     Document Type: Article

References (16)

1. Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. PRIMES is in P. Preprint, 2002, Available at http://ww.cse.iit.ac.in/primality.pdf.
2. Martin Aigner and Günter M. Ziegler. Proofs from THE BOOK. Springer, 1998.
3. José C. Almeida and Laurent Théry. Correctness of the RSA algorithm. Coq contribution, 1999, Available at http://coq.inria.fr/contribs/summary.html.
4. Yves Bertot, Nicolas Magaud, and Paul Zimmermann. A GMP program computing square roots and its proof within Coq. Journal of Automated Reasoning, 29(3-4), 2002.
5. Olga Caprotti and Martijn Oostdijk. Formal and Efficient Primality Proofs by Use of Computer Algebra Oracles. Journal of Symbolic Computation, 32(1):55-70, 2001.
6. Paul Erdös. Beweis eines Satzes von Tschebyschef. In Acta Scientifica Mathematica, volume 5, pages 194-198, 1932.
7. Jean-Christophe Filliâtre. Proof of Imperative Programs in Type Theory. In TYPES '98, volume 1657 of LNCS, 1998.
8. John Harrison. Floating Point Verification in HOL. In Higher Order Logic Theorem Proving and Its Applications, volume 971 of LNCS, pages 186-199, 1995.
9. John Harrison and Laurent Théry. A Skeptic's Approach to Combining HOL and Maple. Journal of Automated Reasoning, 21(3):279-294, 1998.
10. C. Anthony R. Hoare. An Axiomatic Basis for Computer Programming. Communication of the ACM, 12(10):576-80, 583, October 1969.
11. Joe Hurd. Formal Verification of Probabilistic Algorithms. Phd Thesis, University of Cambridge, 2002.
12. Donald E. Knuth. The Art of Computer Programming: Fundamental Algorithms, pages 147-149. Addison-Wesley, 1997.
13. PCoq. A Graphical User-interface to Coq, Available at http://www-sop.inria.fr /lemme/pcoq/.
14. Art Quaife. Automated development of fundamental mathematical theories. Automated reasoning series: 2. Kluwer, 1992.
15. Arkadii Slinko. Number Theory. Tutorial 5: Bertrand's Postulate. Available at http://matholymp.com/tutorials/bertrand.pdf.
16. Laurent Théry. A Tour of Formal Verification with Coq: Knuth's Algorithm for Prime Numbers. Research Report 4600, INRIA, 2002.