Skip to main content
SpringerLink
Log in
Book cover

Deductive Software Verification – The KeY Book pp 609–618Cite as

Verification of Counting Sort and Radix Sort

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10001))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Open University, Heerlen, The Netherlands

    Stijn de Gouw

  2. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands

    Frank S. de Boer

  3. Radboud University, Nijmegen, The Netherlands

    Jurriaan Rot

Authors
  1. Stijn de Gouw
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank S. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jurriaan Rot
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stijn de Gouw .

Editor information

Editors and Affiliations

  1. Chalmers University of Technology, Gothenburg, Sweden

    Wolfgang Ahrendt

  2. Karlsruhe Institute of Technology (KIT), Karlsruhe, Baden-Württemberg, Germany

    Bernhard Beckert

  3. Technische Universität Darmstadt, Darmstadt, Germany

    Richard Bubel

  4. Technische Universität Darmstadt, Darmstadt, Hessen, Germany

    Reiner Hähnle

  5. Karlsruher Institut für Technologie (KIT), Karlsruhe, Germany

    Peter H. Schmitt

  6. Karlsruher Institut für Technologie (KIT), Karlsruhe, Germany

    Mattias Ulbrich

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this chapter

Cite this chapter

de Gouw, S., de Boer, F.S., Rot, J. (2016). Verification of Counting Sort and Radix Sort. In: Ahrendt, W., Beckert, B., Bubel, R., Hähnle, R., Schmitt, P., Ulbrich, M. (eds) Deductive Software Verification – The KeY Book. Lecture Notes in Computer Science(), vol 10001. Springer, Cham. https://doi.org/10.1007/978-3-319-49812-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49812-6_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49811-9

  • Online ISBN: 978-3-319-49812-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation