LTS: the list-traversal synopses system

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.