Semi-persistent Data Structures

DOI10.1007/978-3-540-78739-6_25MaRDI QIDQ5458407zbMATH OpenOpenAlexWikidataFDO

Authors Sylvain Conchon, Jean-Christophe Filliâtre

Publication date 11 April 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78739-6_25

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Making data structures persistent
• Making data structures confluently persistent
• Confluent persistence revisited
• scientific article; zbMATH DE number 3864511
• Making data structures confluently persistent. (Extended abstract)

Cited in

(5)

• scientific article; zbMATH DE number 6469156 (Why is no real title available?)
• Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation
• Anti-persistence
• A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
• scientific article; zbMATH DE number 140460 (Why is no real title available?)

Describes a project that uses

Uses Software

• Alt-Ergo
• Spec#
• Why3
• KRAKATOA

This page was built for publication: Semi-persistent Data Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458407)