Verifying OpenJDK's sort method for generic collections
From MaRDI portal
Recommendations
- Proving JDK's dual pivot quicksort correct
- An assertional proof of the stability and correctness of Natural Mergesort
- Verification of Java Programs with Generics
- On the worst-case complexity of TimSort
- A Generic Approach to the Verification of the Permutation Property of Sequential and Parallel Swap-Based Sorting Algorithms
Cites work
- Fundamental Approaches to Software Engineering
- Hammering towards QED
- scientific article; zbMATH DE number 437573 (Why is no real title available?)
- Isabelle. A generic theorem prover
- Proof of a recursive program: Quicksort
- Proof pearl: A mechanized proof of GHC's mergesort
- Proof pearl: The KeY to correct and stable sorting
Cited in
(7)- Proving JDK's dual pivot quicksort correct
- Minimal coverability tree construction made complete and efficient
- Fifty years of Hoare's logic
- On the worst-case complexity of TimSort
- Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
- An assertional proof of the stability and correctness of Natural Mergesort
- A Generic Approach to the Verification of the Permutation Property of Sequential and Parallel Swap-Based Sorting Algorithms
This page was built for publication: Verifying OpenJDK's sort method for generic collections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725846)
