Skip to content

Latest commit

 

History

History
8 lines (6 loc) · 409 Bytes

README.md

File metadata and controls

8 lines (6 loc) · 409 Bytes

Proof of correctness of the Firsov–Jeltsch order maintenance algorithm

In the order maintenance problem, the objective is to maintain a total order subject to insertions, deletions, and element comparisons.

This package provides a proof of correctness of the Firsov–Jeltsch order maintenance algorithm, carried out in Isabelle/HOL.