Generic pickling and minimization

Guido Tack, Leif Kornstaedt, Gert Smolka

Research output: Contribution to journalArticleResearchpeer-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 languageEnglish
Pages (from-to)79-103
Number of pages25
JournalElectronic Notes in Theoretical Computer Science
Volume148
Issue number2
DOIs
Publication statusPublished - 24 Mar 2006
Externally publishedYes

Keywords

  • Distributed programming
  • Graph minimization
  • Marshalling
  • Persistence
  • Pickling
  • Serialization

Cite this