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]

Authors

Eelis van der Weegen

This author has not been identified. Look up 'Eelis van der Weegen' in Google

James McKinna

This author has not been identified. Look up 'James McKinna' in Google