### Abstract

Original language | English |
---|---|

Title of host publication | Deductive Software Verification - The KeY Book |

Subtitle of host publication | From Theory to Practice |

Editors | Wolfgang Ahrendt , Bernhard Beckert , Richard Bubel , Reiner Hähnle , Peter H. Schmitt , Mattias Ulbrich |

Publisher | Springer |

Pages | 609-618 |

Number of pages | 10 |

ISBN (Electronic) | 978-3-319-49812-6 |

ISBN (Print) | 978-3-319-49811-9 |

DOIs | |

Publication status | Published - 2016 |

### Publication series

Series | Lecture Notes in Computer Science |
---|---|

Volume | 10001 |

ISSN | 0302-9743 |

### Fingerprint

### Cite this

*Deductive Software Verification - The KeY Book: From Theory to Practice*(pp. 609-618). Springer. Lecture Notes in Computer Science, Vol.. 10001 https://doi.org/10.1007/978-3-319-49812-6_19

}

*Deductive Software Verification - The KeY Book: From Theory to Practice.*Springer, Lecture Notes in Computer Science, vol. 10001, pp. 609-618. https://doi.org/10.1007/978-3-319-49812-6_19

**Verification of Counting Sort and Radix Sort.** / Gouw, Stijn de; Boer, Frank S. de; Rot, Jurriaan.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

TY - CHAP

T1 - Verification of Counting Sort and Radix Sort

AU - Gouw, Stijn de

AU - Boer, Frank S. de

AU - Rot, Jurriaan

PY - 2016

Y1 - 2016

N2 - We discuss a mechanized correctness proof in KeY of Counting sort and Radix sort. Counting sort is an unusual sorting algorithm in the sense that it is based on arithmetic rather than comparisons. Radix sort is tailored to sorting arrays of large numbers. It uses an auxiliary sorting algorithm, such as Counting sort, to sort the digits of the large numbers one-by-one. The correctness of Radix sort requires the stability of the auxiliary sorting algorithm. Stability here means that the order between different occurrences of the same number is preserved. The correctness proof of Counting sort includes a proof of its stability.

AB - We discuss a mechanized correctness proof in KeY of Counting sort and Radix sort. Counting sort is an unusual sorting algorithm in the sense that it is based on arithmetic rather than comparisons. Radix sort is tailored to sorting arrays of large numbers. It uses an auxiliary sorting algorithm, such as Counting sort, to sort the digits of the large numbers one-by-one. The correctness of Radix sort requires the stability of the auxiliary sorting algorithm. Stability here means that the order between different occurrences of the same number is preserved. The correctness proof of Counting sort includes a proof of its stability.

UR - https://link.springer.com/book/10.1007/978-3-319-49812-6

U2 - 10.1007/978-3-319-49812-6_19

DO - 10.1007/978-3-319-49812-6_19

M3 - Chapter

SN - 978-3-319-49811-9

T3 - Lecture Notes in Computer Science

SP - 609

EP - 618

BT - Deductive Software Verification - The KeY Book

A2 - , Wolfgang Ahrendt

A2 - , Bernhard Beckert

A2 - , Richard Bubel

A2 - , Reiner Hähnle

A2 - , Peter H. Schmitt

A2 - , Mattias Ulbrich

PB - Springer

ER -