Proof Pearl: The KeY to Correct and Stable Sorting
- First Online:
- Cite this article as:
- de Gouw, S., de Boer, F. & Rot, J. J Autom Reasoning (2014) 53: 129. doi:10.1007/s10817-013-9300-y
- 225 Downloads
We discuss a proof of the correctness of two sorting algorithms: Counting sort and Radix sort. The semi-automated proof is formalized in the state-of-the-art theorem prover KeY.