Executing code in the past: efficient in-memory object graph versioning

Authors:
Frédéric Pluquet;Stefan Langerman;Roel Wuyts
Affiliations:
Université Libre de Bruxelles, Brussels, Belgium;Université Libre de Bruxelles, Brussels, Belgium;IMEC and Katholieke Universiteit Leuven, Leuven, Belgium
Venue:
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Year:
2009

Citing 17
Cited 1

Planar point location using persistent search trees

Communications of the ACM
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
IGOR: a system for program debugging via reversible execution

PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
Efficient algorithms for bidirectional debugging

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Object Oriented Reengineering Patterns

Object Oriented Reengineering Patterns
Applying "Design by Contract"

Computer
Object-Oriented Program Tracing and Visualization

Computer
Extending the ODMG Object Model with Time

ECCOP '98 Proceedings of the 12th European Conference on Object-Oriented Programming
Wrappers to the Rescue

ECCOP '98 Proceedings of the 12th European Conference on Object-Oriented Programming
An Overview of AspectJ

ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Model Checking Programs

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
A survey of trace exploration tools and techniques

CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Scalable omniscient debugging

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Taking an object-centric view on dynamic information with object flow analysis

Computer Languages, Systems and Structures
Runtime bytecode transformation for Smalltalk

Computer Languages, Systems and Structures
CodeQuest: scalable source code queries with datalog

ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Efficient object querying for java

ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming

Usable live programming

Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Object versioning refers to how an application can have access to previous states of its objects. Implementing this mechanism is hard because it needs to be efficient in space and time, and well integrated with the programming language. This paper presents HistOOry, an object versioning system that uses an efficient data structure to store and retrieve past states. It needs only three primitives, and existing code does not need to be modified to be versioned. It provides fine-grained control over what parts of objects are versioned and when. It stores all states, past and present, in memory. Code can be executed in the past of the system and will see the complete system at that point in time. We have implemented our model in Smalltalk and used it for three applications that need versioning: checked postconditions, stateful execution tracing and a planar point location implementation. Benchmarks are provided to asses the practical complexity of our implementation.