Proof of a recursive program: Quicksort

DOI10.1093/comjnl/14.4.391zbMath0231.68011OpenAlexW2150174224MaRDI QIDQ5639351

No author found.

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)

Related Items

Efficient Verified Implementation of Introsort and Pdqsort, Being and Change: Reasoning About Invariance, A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries, Experiments in program verification using Event-B, Unnamed Item, Verifying OpenJDK's sort method for generic collections, Proving Quicksort Correct in Event-B, The use of Hoare's method of program verification for the Quicksort algorithm, Fifty years of Hoare's logic, Quicksort, Proof pearl: The KeY to correct and stable sorting