A Formalisation of Algorithms for Sorting Network

03/03/2022
by   Laurent Théry, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2021

Is this the simplest (and most surprising) sorting algorithm ever?

We present an extremely simple sorting algorithm. It may look like it is...
research
12/08/2020

An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels

We show that 11-channel sorting networks have at least 35 comparators an...
research
10/04/2018

Deriving sorting algorithms via abductive logic program transformation

Logic program transformation by the unfold/fold method ad- vocates the w...
research
08/21/2019

Engineering Faster Sorters for Small Sets of Items

Sorting a set of items is a task that can be useful by itself or as a bu...
research
09/04/2019

Proof-Based Synthesis of Sorting Algorithms Using Multisets in Theorema

Using multisets, we develop novel techniques for mechanizing the proofs ...
research
10/15/2019

Apply Sorting Algorithms to FAST Problem

FAST problem is finding minimum feedback arc set problem in tournaments....
research
07/12/2023

WiscSort: External Sorting For Byte-Addressable Storage

We present WiscSort, a new approach to high-performance concurrent sorti...

Please sign up or login with your details

Forgot password? Click here to reset