A comparative study of insertion sorting algorithm verification

Focusing on the impact different ways of formalization have on the according verifications of sorting algorithm, this paper presents the formal specifications of insertion sort, and verifies its functional correctness using Isabelle/HOL. For the formalization, the value-based method and the index-based method are compared, which turns out that the index-based method is more suitable for verification in various aspects.