Proving Pearl: Knuth s Algorithm for Prime Numbers

Laurent Théry. Proving Pearl: Knuth s Algorithm for Prime Numbers. In David A. Basin, Burkhart Wolff, editors, Theorem Proving in Higher Order Logics, 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings. Volume 2758 of Lecture Notes in Computer Science, pages 304-318, Springer, 2003. [doi]

Abstract

Abstract is missing.