English

A Formalisation of Algorithms for Sorting Network

Data Structures and Algorithms 2022-03-04 v1

Abstract

This notes explains how standard algorithms that construct sorting networks have been formalised and proved correct in the Coq proof assistant using the SSReflect extension.

Keywords

Cite

@article{arxiv.2203.01579,
  title  = {A Formalisation of Algorithms for Sorting Network},
  author = {Laurent Théry},
  journal= {arXiv preprint arXiv:2203.01579},
  year   = {2022}
}
R2 v1 2026-06-24T10:00:29.211Z