Semi-persistent Data Structures - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Semi-persistent Data Structures

Résumé

A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, called semi-persistence, where only ancestors of the most recent version can be accessed or updated. Making a data structure semi-persistent may improve its time and space complexity. This is of particular interest in backtracking algorithms manipulating persistent data structures, where this property is usually satisfied. We propose a proof system to statically check the valid use of semi-persistent data structures. It requires a few annotations from the user and then generates proof obligations that are automatically discharged by a dedicated decision procedure. Additionally, we give some examples of semi-persistent data structures (arrays, lists and hash tables).
Fichier principal
Vignette du fichier
spds-rr.pdf (224.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04045849 , version 1 (25-03-2023)

Identifiants

Citer

Sylvain Conchon, Jean-Christophe Filliâtre. Semi-persistent Data Structures. European Symposium on Programming, Mar 2008, Budapest, Hungary. pp.322-336, ⟨10.1007/978-3-540-78739-6_25⟩. ⟨hal-04045849⟩
40 Consultations
34 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More