Snapshottable Stores

We say that an imperative data structure is snapshottable or supports snapshots if we can efficiently capture its current state, and restore a previously captured state to become the current state again. This is useful, for example, to implement backtracking search processes that update the data str...

Full description

Saved in:
Bibliographic Details
Published inProceedings of ACM on programming languages Vol. 8; no. ICFP; pp. 338 - 369
Main Authors Allain, Clément, Clément, Basile, Moine, Alexandre, Scherer, Gabriel
Format Journal Article
LanguageEnglish
Published New York, NY, USA ACM 15.08.2024
Subjects
Data structures design and analysis
Functional languages
Program verification
Software and its engineering
Theory of computation
Persistence
Semi-persistence
Backtracking
Program verification
Online AccessGet full text

Cover

Be the first to leave a comment!
You must be logged in first