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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Matias, Y., Porat, E.: Efficient pebbling for list traversal synopses. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 918–928. Springer, Heidelberg (2003)
Matias, Y., Porat, E.: Efficient pebbling for list traversal synopses with applications to program rollback. Theory of Computing Systems (TOCS) (to appear)
Furman, M., Matias, Y., Porat, E.: The List Traversal Synopses (LTS) System. Technical Report, Tel Aviv University (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furman, M., Matias, Y., Porat, E. (2006). LTS: The List-Traversal Synopses System. In: Etzion, O., Kuflik, T., Motro, A. (eds) Next Generation Information Technologies and Systems. NGITS 2006. Lecture Notes in Computer Science, vol 4032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780991_35
Download citation
DOI: https://doi.org/10.1007/11780991_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35472-7
Online ISBN: 978-3-540-35473-4
eBook Packages: Computer ScienceComputer Science (R0)