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]
@inproceedings{WeegenM08, title = {A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq}, author = {Eelis van der Weegen and James McKinna}, year = {2008}, doi = {10.1007/978-3-642-02444-3_16}, url = {http://dx.doi.org/10.1007/978-3-642-02444-3_16}, researchr = {https://researchr.org/publication/WeegenM08}, cites = {0}, citedby = {0}, pages = {256-271}, booktitle = {Types for Proofs and Programs, International Conference, TYPES 2008, Torino, Italy, March 26-29, 2008, Revised Selected Papers}, editor = {Stefano Berardi and Ferruccio Damiani and Ugo de Liguoro}, volume = {5497}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-02443-6}, }