Proof Pearl: The KeY to Correct and Stable Sorting

The work

TitleProof Pearl: The KeY to Correct and Stable Sorting
AuthorsStijn de Gouw; Frank S. de Boer; Jurriaan Rot
Typearticle
Year2014
Citekeygouw2014proof

Where it appeared

Published inJournal of Automated Reasoning
PublisherSpringer
Volume53
Issue2
Pages129--139

Identifiers

DOI10.1007/s10817-013-9300-y
OpenAlexW1998392058

Access

Landing pagehttps://doi.org/10.1007/s10817-013-9300-y
Free full texthttps://ir.cwi.nl/pub/23074

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.

Copy held

KindPDF, 306.5 kB
Retrieved2026-08-08
Heldlocal, for personal reference
Where it came fromhttps://ir.cwi.nl/pub/23074/23074D.pdf

Where this came from

How it got herethe agent went looking · found via openalex
First seen2026-08-04
Recordreviewed by a person
Approved2026-08-16

Cite it as

@article{gouw2014proof,
  title = {Proof Pearl: The KeY to Correct and Stable Sorting},
  author = {Stijn de Gouw and Frank S. de Boer and Jurriaan Rot},
  year = {2014},
  journal = {Journal of Automated Reasoning},
  volume = {53},
  number = {2},
  pages = {129--139},
  publisher = {Springer},
  doi = {10.1007/s10817-013-9300-y},
  url = {https://ir.cwi.nl/pub/23074},
}

This record lives at https://refs.drheap.org/gouw2014proof/ and will keep doing so.