A machine-checked proof of the average-case complexity of quicksort in coq

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

Volumn 5497 LNCS, Issue , 2009, Pages 256-271

  Van Der Weegen, Eelis ^a   McKinna, James ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC COMPLEXITY; AVERAGE-CASE COMPLEXITY; COMPLEXITY OF ALGORITHM; EXPECTED LENGTH; FUNCTIONAL PROGRAMS; MACHINE-CHECKED PROOFS; NONDETERMINISTIC COMPUTATION; NONDETERMINISTIC PROGRAMS; NOVEL TECHNIQUES; QUICKSORT; SHALLOW EMBEDDING; TECHNICAL LEMMAS; TYPE THEORY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; TEXTBOOKS;

PARALLEL PROCESSING SYSTEMS;

EID: 68749097397     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02444-3_16     Document Type: Conference Paper

References (12)

1. Hoare, C.: Quicksort. The Computer Journal 5, 10-15 (1962)
2. The Coq Development Team: The Coq Proof Assistant Reference Manual - Version V8.2 (February 2009), http://coq.inria.fr
3. Bertot, Y., Castéran, P.: Coq'Art: Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)
4. Constable, R.L.: Expressing computational complexity in constructive type theory. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 131-144. Springer, Heidelberg (1995)
5. Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 24-52. Springer, Heidelberg (1995)
6. Sedgewick, R.: The analysis of quicksort programs. Acta Inf. 7, 327-355 (1977)
7. Sozeau, M.: Subset coercions in Coq. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 237-252. Springer, Heidelberg (2007)
8. Liang, S., Hudak, P., Jones, M.P.: Monad transformers and modular interpreters. In: POPL 1995, pp. 333-343. ACM, New York (1995)
9. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
10. Schellekens, M.: A Modular Calculus for the Average Cost of Data Structuring. Springer, Heidelberg (2008)
11. Audebaud, P., Paulin-Mohring, C.: Proofs of Randomized Algorithms in Coq. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 49-68. Springer, Heidelberg (2006)
12. Hurd, J.: Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge (2002)