Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 129-139 |
Number of pages | 11 |
Journal | Journal of Automated Reasoning |
Volume | 53 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2014 |
Externally published | Yes |