We verify functional correctness of insertion sort as well as the partition function of quicksort. We use Isabelle/UTP and its denotational semantics for imperative programs as a verification framework. We propose a forward Hoare VCG for our reasoning and we discuss the different technical challenges encountered while using Isabelle/UTP.
No takes yet. Share an insight, caveat, or question.
Bockenek et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: