Journal of Automated Reasoning

, Volume 53, Issue 2, pp 129–139

Proof Pearl: The KeY to Correct and Stable Sorting

Article

DOI: 10.1007/s10817-013-9300-y

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

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.

Keywords

Sorting Correctness Theorem prover KeY Counting sort Radix sort 

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  • Stijn de Gouw
    • 1
    • 2
  • Frank de Boer
    • 1
    • 2
  • Jurriaan Rot
    • 1
    • 2
  1. 1.LIACS – Leiden UniversityLeidenNetherlands
  2. 2.CWIAmsterdamNetherlands

Personalised recommendations