Semi-persistent Data Structures

DOI10.1007/978-3-540-78739-6_25zbMATH Open1133.68325OpenAlexW2130816688WikidataQ59411584 ScholiaQ59411584MaRDI QIDQ5458407FDOQ5458407

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

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)

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (5)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Uses Software

• KRAKATOA
• Why3
• Spec#
• Alt-Ergo

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)