This article presents the Dancing Links optimization as applied to Rust, highlighting its capability to enhance algorithm efficiency, particularly for the exact cover problem. It outlines the development of a new subset of Rust, named Restricted Algorithmic Rust (RAR), inspired by prior work with Restricted Algorithmic C (RAC). The paper details an improved RAR toolchain and the formal verification of a circular doubly-linked list structure utilizing Dancing Links, asserting its functional correctness with ACL2. Rust's suitability for hardware/software co-assurance in critical systems also receives emphasis, showing its relevance amid growing industry adoption.
“Dancing Links” represents an optimization technique for efficient data management through a circular doubly-linked list, facilitating rapid element removal and restoration in algorithms.
This paper implements the Dancing Links optimization in Rust, backed by formal verification with ACL2, showcasing Rust’s potential in critical systems via a new subset called RAR.
Collection
[
|
...
]