LTS: the list-traversal synopses system

Authors:
Michael Furman;Yossi Matias;Ely Porat
Affiliations:
School of Computer Science, Tel Aviv University;School of Computer Science, Tel Aviv University;Department of Computer Science, Bar-Ilan University
Venue:
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Year:
2006

Citing 2
Cited 1

Efficient pebbling for list traversal synopses with application to program rollback

Theoretical Computer Science
Efficient pebbling for list traversal synopses

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Efficient pebbling for list traversal synopses with application to program rollback

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The List-Traversal Synopses (LTS) system enables the efficient execution, utilization, and integration of memory-efficient algorithms that can support efficient forward and backward traversal of unidirectional lists. It has applications ranging from traversal of linked structures, garbage collection, hash-chain computations and program rollback. The system provides anima-tion and performance testing platform for traversal algorithms. We will demonstrate the algorithms animation, and will demonstrate how computer programs can be made reversible, and actually run backwards, using the LTS system.