Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10817-013-9300-y | Journal of Automated Reasoning |
Keywords | Field | DocType |
Sorting,Correctness,Theorem prover,KeY,Counting sort,Radix sort | Counting sort,Discrete mathematics,Merge sort,Automated theorem proving,Correctness,Radix sort,Algorithm,Arithmetic,Sorting,Sorting algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
53 | 2 | 0168-7433 |
Citations | PageRank | References |
4 | 0.50 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stijn de Gouw | 1 | 67 | 11.57 |
| Frank S. de Boer | 2 | 2013 | 159.02 |
| Jurriaan Rot | 3 | 104 | 18.53 |