Proof of a recursive program: Quicksort

DOI10.1093/COMJNL/14.4.391MaRDI QIDQ5639351zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/14.4.391

Mathematics Subject Classification ID

Searching and sorting (68P10) Software, source code, etc. for problems pertaining to computer science (68-04)

Cited in

(12)

• Verifying OpenJDK's sort method for generic collections
• Proof pearl: The KeY to correct and stable sorting
• scientific article; zbMATH DE number 7453193 (Why is no real title available?)
• Fifty years of Hoare's logic
• Experiments in program verification using Event-B
• Saturating sorting without sorts
• A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
• Quicksort
• The use of Hoare's method of program verification for the Quicksort algorithm
• Proving Quicksort Correct in Event-B
• Being and change: reasoning about invariance
• Efficient Verified Implementation of Introsort and Pdqsort

This page was built for publication: Proof of a recursive program: Quicksort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5639351)