ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Electronic Notes in Theoretical Computer Science
Volume 148, Issue 2, 24 March 2006, Pages 79-103
Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (387 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.entcs.2005.11.041    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Generic Pickling and Minimization

Guido TackE-mail The Corresponding Author, Leif KornstaedtE-mail The Corresponding Author and Gert SmolkaE-mail The Corresponding Author

Programming Systems Lab, Saarland University, Saarbrücken, Germany

Available online 11 March 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

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: pickling; marshalling; serialization; graph minimization; persistence; distributed programming


Electronic Notes in Theoretical Computer Science
Volume 148, Issue 2, 24 March 2006, Pages 79-103
Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.