Quicksort Revisited - Verifying Alternative Versions of Quicksort
暂无分享,去创建一个
Sophia Drossopoulou | K. Rustan M. Leino | Mark J. Wheelhouse | Benjamin Egelund-Müller | Razvan Certezeanu | Sinduran Sivarajan
[1] Ernst-Rüdiger Olderog,et al. Verification of Sequential and Concurrent Programs , 1997, Graduate Texts in Computer Science.
[2] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.
[3] C. A. R. HOARE,et al. An axiomatic basis for computer programming , 1969, CACM.
[4] K. Rustan M. Leino,et al. Dafny: An Automatic Program Verifier for Functional Correctness , 2010, LPAR.
[5] Bernhard Beckert,et al. Verification of Object-Oriented Software. The KeY Approach - Foreword by K. Rustan M. Leino , 2007, The KeY Approach.
[6] C. A. R. Hoare,et al. Proof of a Recursive Program: Quicksort , 1971, Comput. J..
[7] Zohar Manna,et al. Mathematical Theory of Computation , 2003 .
[8] Zohar Manna,et al. Introduction to mathematical theory of computation , 1972 .
[9] Frank S. de Boer,et al. OpenJDK's Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case , 2015, CAV.