2014
DOI: 10.1007/s10817-013-9300-y
| View full text |Cite
|
Sign up to set email alerts
|

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 15 publications
(18 citation statements)
references
References 8 publications
0
18
0
Order By: Relevance
“…Gouw, Boer and Rot [8] used an auxiliary indexing variable while Sternagel [6] utilized a very similar idea of first associating indices with each sequence to be sorted and then introduced a key function to separate the indices from elements. Considering we are concerned with a declarative version of insertion sort, it is more convenient for us to use associated indices.…”
Section: Usual Stabilitymentioning
confidence: 99%
See 2 more Smart Citations
“…Gouw, Boer and Rot [8] used an auxiliary indexing variable while Sternagel [6] utilized a very similar idea of first associating indices with each sequence to be sorted and then introduced a key function to separate the indices from elements. Considering we are concerned with a declarative version of insertion sort, it is more convenient for us to use associated indices.…”
Section: Usual Stabilitymentioning
confidence: 99%
“…We therefore enhance the notion of what it means to be sorted, expressing stability along with the property of being sorted. It can be viewed as an extension of what Gouw, Boer and Rot [8] used, utilizing an index once equality is established. A very important thing to note here is that throughout the study, we will be using the definition under assignment α ← γ, for which the strict comparison operation with < is defined to compare second components; those represent indices.…”
Section: Specificationmentioning
confidence: 99%
See 1 more Smart Citation
“…12 The KeY proof targets the actual implementation in the OpenJDK standard library, rather than an idealized model of it. That implementation uses low-level bit-wise operations, abrupt termination of loops and arithmetic overflows.…”
Section: Proof Statisticsmentioning
confidence: 99%
“…The work presented here was motivated by our recent success to verify executable Java versions of counting sort and radix sort in KeY with manageable effort [12]. As a further challenge, we planned to verify a complicated sorting algorithm taken from the widely used OpenJDK core library.…”
mentioning
confidence: 99%