A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq

Eelis van der Weegen, James McKinna. A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. In Stefano Berardi, Ferruccio Damiani, Ugo de Liguoro, editors, Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers. Volume 5497 of Lecture Notes in Computer Science, pages 256-271, Springer, 2008. [doi]

No reviews for this publication, yet.