Generic pickling and minimization

Guido Tack; Leif Kornstaedt; Gert Smolka

doi:10.1016/j.entcs.2005.11.041

Generic pickling and minimization

Guido Tack, Leif Kornstaedt, Gert Smolka

Research output: Contribution to journal › Article › Research › peer-review

3 Citations (Scopus)

Abstract

This paper presents generic pickling and minimization mechanisms that are provided as services similar to garbage collection. Pickling is used to externalize and internalize data. Minimization means to maximize the sharing in arbitrary data structures. The paper introduces the notion of an abstract store as a formal basis for the algorithms, and analyzes design decisions for the implementation aspects of pickling and minimization. The mechanisms presented here are fully implemented in the Alice programming system.

Original language	English
Pages (from-to)	79-103
Number of pages	25
Journal	Electronic Notes in Theoretical Computer Science
Volume	148
Issue number	2
DOIs	https://doi.org/10.1016/j.entcs.2005.11.041
Publication status	Published - 24 Mar 2006
Externally published	Yes

Keywords

Distributed programming
Graph minimization
Marshalling
Persistence
Pickling
Serialization

Access to Document

10.1016/j.entcs.2005.11.041

Link to publication in Scopus

Cite this

@article{086f8cd72bc24eb1a6678c0e50dd53c1,

title = "Generic pickling and minimization",

abstract = "This paper presents generic pickling and minimization mechanisms that are provided as services similar to garbage collection. Pickling is used to externalize and internalize data. Minimization means to maximize the sharing in arbitrary data structures. The paper introduces the notion of an abstract store as a formal basis for the algorithms, and analyzes design decisions for the implementation aspects of pickling and minimization. The mechanisms presented here are fully implemented in the Alice programming system.",

keywords = "Distributed programming, Graph minimization, Marshalling, Persistence, Pickling, Serialization",

author = "Guido Tack and Leif Kornstaedt and Gert Smolka",

year = "2006",

month = mar,

day = "24",

doi = "10.1016/j.entcs.2005.11.041",

language = "English",

volume = "148",

pages = "79--103",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Generic pickling and minimization

AU - Tack, Guido

AU - Kornstaedt, Leif

AU - Smolka, Gert

PY - 2006/3/24

Y1 - 2006/3/24

N2 - This paper presents generic pickling and minimization mechanisms that are provided as services similar to garbage collection. Pickling is used to externalize and internalize data. Minimization means to maximize the sharing in arbitrary data structures. The paper introduces the notion of an abstract store as a formal basis for the algorithms, and analyzes design decisions for the implementation aspects of pickling and minimization. The mechanisms presented here are fully implemented in the Alice programming system.

AB - This paper presents generic pickling and minimization mechanisms that are provided as services similar to garbage collection. Pickling is used to externalize and internalize data. Minimization means to maximize the sharing in arbitrary data structures. The paper introduces the notion of an abstract store as a formal basis for the algorithms, and analyzes design decisions for the implementation aspects of pickling and minimization. The mechanisms presented here are fully implemented in the Alice programming system.

KW - Distributed programming

KW - Graph minimization

KW - Marshalling

KW - Persistence

KW - Pickling

KW - Serialization

UR - http://www.scopus.com/inward/record.url?scp=33644912596&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2005.11.041

DO - 10.1016/j.entcs.2005.11.041

M3 - Article

AN - SCOPUS:33644912596

VL - 148

SP - 79

EP - 103

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

IS - 2

ER -