Artifact for "nekton: a linearizability proof checker"

nekton is a new tool for checking linearizability proofs of highly complex concurrent search structures. The tool’s unique features are its parametric heap abstraction based on separation logic and the flow framework, and its support for hindsight arguments about future-dependent linearization points. We describe the tool, present a case study, and discuss implementation details.

The present artifact demonstrates that nekton (1) can verify the correctness of proof outlines for the linearizability of the FEMRS-tree (without the maintenance operations), and (2) can verify global properties of graph structures. The SHA256 checksum of the artifact 9a89cf92f5b18f96fdb0d237e001a22a779a5d68819936bb46d40268226b0406.