Introduction to Reversible Computing

Introduction to Reversible Computing

Volumn , Issue , 2013, Pages 1-293

  Perumalla, Kalyan S ^a  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85130675081     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b15719     Document Type: Book

References (158)

1. Andrew Adamatzky. Collision-based Computing. Springer, 2002. ISBN 978-1-85233-540-3.
2. Tankut Akgul and Vincent J. Mooney III. Assembly instruction level reverse execution for debugging. ACM Trans. Softw. Eng. Methodol., 13(2):149- 198, April 2004. ISSN 1049-331X.
3. Ian F. Akyildiz, Liang Chen, Samir Ranjan Das, Richard Fujimoto, and Richard F. Serfozo. Performance analysis of ”time warp” with limited memory. In SIGMETRICS, pages 213-224, 1992.
4. A.N. Al-Rabadi. Reversible Logic Synthesis: From Fundamentals to Quantum Computing. Springer Series in Advanced Microelectronics. Prelim.Entry. 13, 13. Springer-Verlag, 2004. ISBN 9783540009351.
5. Eric Allen, David Chase, Christine Flood, Victor Luchangco, Jan-Willem Maessen, Sukyoung Ryu, and Guy L. Steele Jr. Project fortress: A multicore language for multicore processors. Linux Magazine, September 2007.
6. Eric Allen, David Chase, Hallett, Victor Luchangco, Jan-Willem Maessen, Sukyoung Ryu, Guy L. Steele, and Tobin-Hochstadt. The fortress language specification, version 1.0. Oracle, Inc., 2008, 2008.
7. James E. Archer, Jr., Richard Conway, and Fred B. Schneider. User recovery and reversal in interactive systems. ACM Trans. Program. Lang. Syst., 6 (1):1-19, 1984. ISSN 0164-0925.
8. Holger Axelsen and Robert Glück. A simple and efficient universal reversible Turing machine. In Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martn-Vide, editors, Language and Automata Theory and Applications, volume 6638 of Lecture Notes in Computer Science, pages 117-128. Springer Berlin/Heidelberg, 2011. ISBN 978-3-642-21253-6.
9. Johann Sebastian Bach. The Art of the Fugue & A Musical Offering. Dover Publications, 1747. ISBN 978-0486270067.
10. Mouad Bahi and Christine Eisenbeis. Register Reverse Rematerialization. Rapport de recherche (Research Report) inria-00607323, ALCHEMY-IN-RIA Saclay-Ile de France, July 2011.
11. Mouad Bahi and Christine Eisenbeis. Impact of reverse computing on information locality in register allocation for high performance computing. International Journal of Parallel Programming, pages 1-28, 2012. ISSN 0885-7458.
12. Henry G. Baker. Nreversal of fortune-the thermodynamics of garbage collection. In Proceedings of the International Workshop on Memory Management, IWMM ’92, pages 507-524, London, UK, UK, 1992. Springer-Verlag. ISBN 3-540-55940-X.
13. Henry G. Baker. Thermodynamics and garbage collection. SIGPLAN Not., 29(4):58-63, April 1994. ISSN 0362-1340.
14. Amir M. Ben-Amram. The Church-Turing thesis and its look-alikes. SIGACT News, 36(3):113-114, 2005.
15. C. H. Bennett. Logical reversibility of computation. IBM J. Res. Dev., 17(6): 525-532, November 1973. ISSN 0018-8646.
16. Charles Bennett. Thermodynamics of computation. International Journal of Physics, 21:905-940, 1982.
17. Charles Bennett. Is information physical, or is physics informational? In International Workshop on Reversible Computing (Special Session at ACM Computing Frontiers), 2005.
18. Charles H. Bennett. On Random and Hard-to-describe Numbers. IBM RC. IBM Thomas J.Watson Research Center, 1979.
19. Charles H. Bennett. Notes on the history of reversible computation. IBM Journal of Research and Development, 32(1):16-23, Jan. 1988. ISSN 0018-8646.
20. Charles H. Bennett. Notes on Landauer’s principle, reversible computation, and Maxwell’s demon. Studies In History and Philosophy of Science Part B: Studies In History and Philosophy of Modern Physics, 34(3):501-510, 2003. ISSN 1355-2198.
21. Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh V. Vazi-rani. Strengths and Weaknesses of Quantum Computing. SIAM Journal on Computing, 26:1510-1523, 1997.
22. Phillip A. Berstein and Eric Newcomer. Principles of Transaction Processing. Morgan Kaufmann; 2 edition, 2009. ISBN 978-1558606234.
23. Antoine Bérut, Artak Arakelyan, Artyom Petrosyan, Sergio Ciliberto, Raoul Dillenschneider, and Eric Lutz. Experimental verification of Landauer’s principle linking information and thermodynamics. Nature, 483:187-189, 2012.
24. P.G. Bishop. Using reversible computing to achieve fail-safety. In Proceedings of the Eighth International Symposium On Software Reliability Engineering, pages 182 -191, 2-5 1997.
25. Bitan Biswas and Rajiv Mall. Reverse execution of programs. ACM SIGPLAN Notices, 34(4):61-69, April 1999.
26. Ludwig Boltzmann. On the relation of a general mechanical theorem to the second law of thermodynamics. Sitzungsberichte Akad. Wiss., Vienna, 75: 67-73, 1877.
27. Bob Boothe. Efficient algorithms for bidirectional debugging. SIGPLAN Not., 35(5):299-310, 2000.
28. Kevin J. Bowers, Edmond Chow, Huafeng Xu, Ron O. Dror, Michael P. Eastwood, Brent A. Gregersen, John L. Klepeis, Istvan Kolossvary, Mark A. Moraes, Federico D. Sacerdoti, John K. Salmon, Yibing Shan, and David E. Shaw. Scalable algorithms for molecular dynamics simulations on commodity clusters. In Proceedings of the 2006 ACM/IEEE conference on Super-computing, SC ’06, New York, NY, USA, 2006. ACM. ISBN 0-7695-2700-0.
29. Richard P. Brent and Paul Zimmermann. Modern Computer Arithmetic. Cambridge University Press, 2010. ISBN 978-0521194693.
30. J. S. Briggs. Generating reversible programs. Software Practice Experience, 17(7):439-454, July 1987. ISSN 0038-0644.
31. Leon Brillouin. Science and Information Theory. Academic Press, 2nd Edition, 1956. ISBN 978-0121349509.
32. Jeffrey Bub. Maxwell’s demon and the thermodynamics of computation. Studies In History and Philosophy of Science Part B: Studies In History and Philosophy of Modern Physics, 32(4):569 - 579, 2001. ISSN 1355-2198.
33. Harry Buhrman, John Tromp, and Paul Vitanyi. Time and space bounds for reversible simulation. Journal of Physics A: Mathematical and General, 34: 6821-6830, 2001.
34. Christopher Carothers, Kalyan S. Perumalla, and Richard M. Fujimoto. Efficient optimistic parallel simulations using reverse computation. ACM Transactions on Modeling and Computer Simulation, 9(3):224-253, 1999.
35. A. K. Chandra. Efficient compilation of linear recursive programs. Technical Report Stanford Artificial Intelligence Project Memo AIM-167, STAN-CS-72-282, Computer Science Department, Stanford University, April 1972.
36. Ben Collins-Sussman, Brian W. Fitzpatrick, and C. Michael Pilato. Version Control With Subversion-The Official Guide And Reference Manual. Cre-ateSpace Independent Publishing Platform, 2009. ISBN 978-1441437761.
37. C. J. Date. An Introduction to Database Systems. Addison-Wesley; 8th edition, 2003. ISBN 978-0321197849.
38. Bart Desoete and Alexis De Vos. A reversible carry-look-ahead adder using control gates. Integration, 33(1-2):89-104, 2002.
39. Edsger W. Dijkstra. Program inversion. In Program Construction, International Summer Schoo, pages 54-57, London, UK, UK, 1979. Springer-Verlag. ISBN 3-540-09251-X.
40. R. Drechsler and R. Wille. From truth tables to programming languages: Progress in the design of reversible circuits. In 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL), pages 78 -85, 2011.
41. Rolf Drechsler and Robert Wille. Reversible circuits: Recent accomplishments and future challenges for an emerging technology. In Hafizur Rahaman, Sanatan Chattopadhyay, and Santanu Chattopadhyay, editors, Progress in VLSI Design and Test, volume 7373 of Lecture Notes in Computer Science, pages 383-392. Springer Berlin Heidelberg, 2012. ISBN 978-3-642-31493-3.
42. Michel Dubois, Murali Annavaram, and Per Stenstrom. Parallel Computer Organization and Design. Cambridge University Press, 2012. ISBN 978-0521886758.
43. Margaret A. Ellis and Bjarne Stroustrup. The annotated C++ reference manual. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1990. ISBN 0-201-51459-1.
44. David Eppstein. A heuristic approach to program inversion. In Proceedings of the 9th international joint conference on Artificial intelligence-Volume 1, IJCAI’85, pages 219-221, San Francisco, CA, USA, 1985. Morgan Kaufmann Publishers Inc. ISBN 0-934613-02-8, 978-0-934-61302-6.
45. J. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, C-30(7):478-490, 1981.
46. Joseph A Fisher. Very long instruction word architectures and the ELI-512, volume 11. ACM, 1983.
47. Michael Frank. Introduction to reversible computing: Motivation, progress, and challenges. In International Workshop on Reversible Computing (Spe-cial Session at ACM Computing Frontiers), 2005.
48. Michael P. Frank. Reversibility for Efficient Computing. PhD thesis, Massachusetts Institute of Technology, 1999.
49. Edward Fredkin and Tommaso Toffoli. Conservative logic. International Journal of Theoretical Physics, 21:219-253, 1982. ISSN 0020-7748.
50. James D. French. The false assumption underlying Berry’s paradox. The Journal of Symbolic Logic, 53(4):1220-1223, 1988.
51. Richard M. Fujimoto. Parallel and Distributed Simulation Systems. Wiley-Interscience, 2000. ISBN 978-0471183839.
52. Richard M. Fujimoto, Jya-Jang Tsai, and Ganesh C. Gopalakrishnan. Design and evaluation of the rollback chip: Special purpose hardware for time warp. IEEE Trans. Comput., 41(1):68-82, January 1992. ISSN 0018-9340.
53. James E. Gentle. Random Number Generation and Monte Carlo Methods (Statistics and Computing). Springer, 2003. ISBN 978-0387001784.
54. Robert Glück and Masahiko Kawabe. A program inverter for a functional language with equality and constructors. In Atsushi Ohori, editor, Programming Languages and Systems, volume 2895 of Lecture Notes in Computer Science, pages 246-264. Springer Berlin / Heidelberg, 2003. ISBN 978-3-540-20536-4.
55. Robert Glück and Masahiko Kawabe. Derivation of deterministic inverse programs based on lr parsing. In Yukiyoshi Kameyama and Peter Stuckey, editors, Functional and Logic Programming, volume 2998 of Lecture Notes in Computer Science, pages 187-191. Springer Berlin/Heidelberg, 2004. ISBN 978-3-540-21402-1.
56. David Goldberg. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 23(1):5-48, 1991.
57. Herman H. Goldstine. The Computer from Pascal to von Neumann. Princeton University Press, 1980. ISBN 978-0691023670.
58. Georg A. Gottwald and Marcel Oliver. Boltzmann’s dilemma: An introduction to statistical mechanics via the Kac ring. SIAM Review, 51(3):613-635, 2009.
59. Ananth Grama, George Karypis, Vipin Kumar, and Anshul Gupta. Introduction to Parallel Computing. Addison-Wesley, 2003. ISBN 978-0201648652.
60. Andreas Griewank and Andrea Walther. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation (Second Edition). Society for Industrial and Applied Mathematics, 2008. ISBN 0898716594.
61. Zhijin Guan, Wenjuan Li, Weiping Ding, Yueqin Hang, and Lihui Ni. An arithmetic logic unit design based on reversible logic gates. In Communications, Computers and Signal Processing (PacRim), 2011 IEEE Pacific Rim Conference on, pages 925 -931, 2011.
62. Storrs Hall. A reversible instruction set architecture and algorithms. In Physics and Computation, pages 128-134, 1994.
63. James Harland. Analysis of busy beaver machines via induction proofs. In Proceedings of the Thirteenth Australasian Symposium on Theory of Computing-Volume 65, CATS ’07, pages 71-78. Australian Computer Society, Inc., 2007. ISBN 1-920-68246-5.
64. Berthold Hoffmann. Term rewriting with sharing and memoization. In Proceedings of the Third International Conference on Algebraic and Logic Programming, pages 128-142, London, UK, 1992. Springer-Verlag. ISBN 3-540-55873-X.
65. J.K. Hollingsworth. Critical path profiling of message passing and shared-memory programs. IEEE Transactions on Parallel and Distributed Systems, 9(10):1029-1040, 1998.
66. P. Hontalas, B. Beckman, M. DiLorento, L. Blume, P. Reiher, K. Sturdevant, L. V. Warren, J. Wedel, F. Wieland, and D. R. Jefferson. Performance of the colliding pucks simulation on the time warp operating system. In Distributed Simulation, 1989.
67. Reimann Hugo. Text-book of simple and double counterpoint including imitation or canon. Nabu Press, 1904). ISBN 978-1172452330.
68. Keith Hutchison. Is classical mechanics really time-reversible and deterministic? The British Journal for the Philosophy of Science, 44(2):307-323, 1993.
69. D. Jefferson and P. Reiher. Supercritical speedup [discrete event simulation]. In Simulation Symposium, 1991., Proceedings of the 24th Annual, pages 159-168, 1991.
70. David R. Jefferson. Virtual time. ACM Transactions on Programming Languages and Systems, 7(3):404-425, 1985.
71. David R. Jefferson, B. Beckman, F. Wieland, L. Blume, M. DiLorento, P. Hontalas, P. Reiher, K. Sturdevant, J. Tupman, J. Wedel, and H. Younger. The time warp operating systems. In Symposium on Operating Systems Principles, volume 21, pages 77-93, 1987.
72. Susmit Kumar Jha. Towards Automated System Synthesis Using SCIDUC-TION. PhD thesis, EECS Department, University of California, Berkeley, Nov. 2011.
73. Mark Kac. Some remarks on the use of probability in classical statistical mechanics. Académie Royale de Belgique, Bulletin de la Classe de Sciences, 5(42):356-361, 1956.
74. Masahiko Kawabe and Robert Glück. The program inverter lrinv and its structure. In Manuel Hermenegildo and Daniel Cabeza, editors, Practical Aspects of Declarative Languages, volume 3350 of Lecture Notes in Computer Science, pages 219-234. Springer Berlin/Heidelberg, 2005. ISBN 978-3-540-24362-5.
75. F. P. Kelly. Reversibility and Stochastic Networks. New: Cambridge University Press 2011; Original: Wiley, Chichester, 1979.
76. Youngbae Kim, J. S. Plank, and J. J. Dongarra. Fault tolerant matrix operations using checksum and reverse computation. In Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation, FRONTIERS ’96, pages 70-, Washington, DC, USA, 1996. IEEE Computer Society. ISBN 0-8186-7551-9.
77. Julian Knight, Steve Bull, and Gary Palmer. Cricket For Dummies. For Dummies, 2007. ISBN 978-0470034545.
78. Andrei N Kolmogorov. On tables of random numbers. Sankhyā: The Indian Journal of Statistics, Series A, 25(4):369-376, 1963.
79. Luis Antonio Brasil Kowada, Renato Portugal, and Celina Miraglia Herrera de Figueiredo. Reversible karatsuba’s algorithm. 12(5):499-511, Jun 2006.
80. Rolf Landauer. Irreversibility and heat generation in the computing process. IBM Journal of Research and Development, 5(3):183-191, 1961.
81. J. L. Lebowitz. Time’s arrow and Boltzmann’s entropy. In Physical Origins of Time Asymmetry, pages 131-146. Cambridge University Press, 1994.
82. n, ou θ est un “isomorphisme de codes”. In Comptes Rendus Hebdomadaires des Séances de L’Académie des Sciences, volume 257, pages 2597-2600. 1963.
83. Pierre L’Ecuyer and Terry H. Andres. A random number generator based on the combination of four lcgs. In Mathematics and Computers in Simulation, pages 99-107, 1997.
84. Pierre L’Ecuyer and Richard Simard. Testu01: A c library for empirical testing of random number generators. ACM Trans. Math. Softw., 33(4), August 2007. ISSN 0098-3500.
85. Jooyong Lee. Dynamic reverse code generation for backward execution. Electronic Notes Theoretical Computer Science, 174(4):37-54, May 2007. ISSN 1571-0661.
86. George B. Leeman, Jr. A formal approach to undo operations in programming languages. ACM Trans. Program. Lang. Syst., 8(1):50-87, January 1986. ISSN 0164-0925.
87. D. Levesque and L. Verlet. Molecular dynamics and time reversibility. Journal of Statistical Physics, 72:519-537, 1993. ISSN 0022-4715.
88. R. Levine and A. Sherman. A note on bennetts time-space tradeoff for reversible computation. SIAM Journal on Computing, 19(4):673-677, 1990.
89. Ming Li and Paul Vitanyi. Reversible simulation of irreversible computation. In IEEE Conference on Computational Complexity (CCC), 1996.
90. Ming Li, John Tromp, and Paul Vitanyi. Reversible simulation of irreversible computation. Physica D, 120(1):168-176, 1998.
91. Michael Lienhardt, Ivan Lanese, Claudio Mezzina, and Jean-Bernard Stefani. A reversible abstract machine and its space overhead. In Holger Giese and Grigore Rosu, editors, Formal Techniques for Distributed Systems, volume 7273 of Lecture Notes in Computer Science, pages 1-17. Springer Berlin/Heidelberg, 2012. ISBN 978-3-642-30792-8.
92. Y.-B. Lin and B. R. Preiss. Optimal memory management for time warp parallel simulation. ACM Transactions on Modeling and Computer Simulation, 1(4), 1991.
93. Jon Loeliger and Matthew McCullough. Version Control with Git: Powerful Tools and Techniques for Collaborative Software Development. O’Reilly Media, 2012. ISBN 978-1449316389.
94. Chris Lutz and Howard Derby. Janus: A time-reversible language. Letter written in 1986 by authors, then at California Institute of Technology, to R. Landauer of IBM Inc.; work claimed to be dated in 1982, 1986.
95. D. Manivannan and Mukesh Singhal. A low-overhead recovery technique using quasi-synchronous checkpointing. In Proc. IEEE Int. Conference on Distributed Computing Systems, pages 100-107, 1996.
96. O. J. E. Maroney. The (absence of a) relationship between thermodynamic and logical reversibility. ArXiv Physics e-prints, 2004.
97. O. J. E. Maroney. The (absence of a) relationship between thermodynamic and logical reversibility. Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics, 36(2):355 - 374, 2005.
98. O. J. E. Maroney. Generalizing Landauer’s Principle. Phys. Rev. E, 79(3): 031105, Mar 2009.
99. George Marsaglia. Diehard battery of tests of randomness, stat.fsu.edu/pub/diehard, 1995.
100. Armando B. Matos. Linear programs in a simple reversible language. Theor. Comput. Sci., 290(3):2063-2074, January 2003. ISSN 0304-3975.
101. Makoto Matsumoto and Takuji Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul., 8(1):3-30, 1998. ISSN 1049-3301.
102. John McCarthy. The inversion of functions defined by Turing machines. Automata Studies, pages 177-181, 1956.
103. Pascal Michel. Small Turing machines and generalized busy beaver competition. Theoretical Computer Science, 326(1-3):45-56, 2004.
104. Shin-Cheng Mu, Zhenjiang Hu, and Masato Takeichi. An injective language for reversible computation. In Dexter Kozen, editor, Mathematics of Program Construction, volume 3125 of Lecture Notes in Computer Science, pages 289-313. Springer Berlin/Heidelberg, 2004. ISBN 978-3-540-22380-1.
105. John Von Neumann. Theory of Self-Reproducing Automata. University of Illinois Press, Champaign, IL, USA, 1966.
106. J. Orban and A. Bellemans. Velocity-inversion and irreversibility in a dilute gas of hard disks. Physics Letters A, 24(11):620 - 621, 1967. ISSN 0375-9601.
107. Bryan O’Sullivan. Mercurial: The Definitive Guide. O’Reilly Media, 2009. ISBN 978-0596800673.
108. Gheorghe Paun, Grzegorz Rozenberg, and Arto Salomaa. DNA Computing: New Computing Paradigms. Springer, 2006. ISBN 978-3540641964.
109. Kalyan Perumalla, Matthew Andrews, and Sandeep Bhatt. TED models for ATM internetworks. SIGMETRICS Perform. Eval. Rev., 25(4):12-21, 1998.
110. Kalyan S. Perumalla. Techniques for efficient parallel simulation and their application to large-scale telecommunication network models. PhD thesis, Georgia Institute of Technology, 1999.
111. Kalyan S. Perumalla. Generating perfect reversals of simple linear codes. Technical Report GT-CC-03-04, College of Computing, Georgia Institute of Technology, 2003.
112. 4 processors on the blue gene supercomputer. In International Conference on Computing Frontiers, pages 69-76, Ischia, Italy, 2007.
113. Kalyan S. Perumalla and Alfred J. Park. Reverse computation for rollback-based fault tolerance in large parallel systems. Cluster Computing, 16(2), 2013.
114. Kalyan S. Perumalla and Valdimir A. Protopopescu. Reversible simulations of elastic collisions. ACM Transactions on Modeling and Computer Simulation, 23(2), 2013.
115. Clifford A. Pickover. The Mobius Strip: Dr. August Mobius’s Marvelous Band in Mathematics, Games, Literature, Art, Technology, and Cosmology. Basic Books, 2007. ISBN 978-1560259527.
116. Michel Raynal. Concurrent Programming: Algorithms, Principles, and Foundations. Springer, 2012. ISBN 978-3642320262.
117. Jie Ren and V.K. Semenov. Progress with physically and logically reversible superconducting digital circuits. IEEE Transactions on Applied Superconductivity, 21(3):780 -786, June 2011. ISSN 1051-8223.
118. Yvan Rentergem, Alexis Vos, and Koen Keyser. Six synthesis methods for reversible logic. Open Systems & Information Dynamics, 14:91-116, 2007. ISSN 1230-1612.
119. R.F. Resende and A. El Abbadi. On the serializability theorem for nested transactions. Information Processing Letters, 50(4):177 - 183, 1994. ISSN 0020-0190.
120. Andrew Lewis Ressler. The design of a conservative logic computer and a graphical editor simulator. Master’s thesis, Massachusetts Institute of Technology, 1981.
121. Eleanor G. Rieffel and Wolfgang H. Polak. Quantum Computing: A Gentle Introduction. The MIT Press, 2011. ISBN 978-0262015066.
122. Brian W. Roberts. When we do (and do not) have a classical arrow of time. Philosophy of Science, 2012.
123. K. Sakiyama, B. Preneel, and I. Verbauwhede. A fast dual-field modular arithmetic logic unit and its hardware implementation. In Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium, pages 787-790, 2006.
124. John K. Salmon, Mark A. Moraes, Ron O. Dror, and David E. Shaw. Parallel random numbers: as easy as 1, 2, 3. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC ’11, pages 16:1-16:12, New York, NY, USA, 2011. ACM. ISBN 978-1-4503-0771-0.
125. A.N. Shiryayev. On tables of random numbers. In A.N. Shiryayev, editor, Selected Works of A. N. Kolmogorov, volume 27 of Mathematics and Its Applications, pages 176-183. Springer Netherlands, 1993. ISBN 978-90-481-8456-9.
126. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. on Computing, pages 1484-1509, 1997.
127. Mathias Soeken, Stefan Frehse, Robert Wille, and Rolf Drechsler. Revkit: An open source toolkit for the design of reversible circuits. In Alexis De Vos and Robert Wille, editors, Reversible Computation, volume 7165 of Lecture Notes in Computer Science, pages 64-76. Springer Berlin / Heidelberg, 2012. ISBN 978-3-642-29516-4.
128. Ray J. Solomonoff. A formal theory of inductive inference. Part i. Information and Control, 7(1):1-22, 1964a.
129. Ray J. Solomonoff. A formal theory of inductive inference. Part ii. Information and Control, 7(2):224-254, 1964b.
130. Ravishankar Somasundaram. Git: Version control for everyone. Packt Publishing, 2013. ISBN 978-1849517522.
131. Rok Sosic. History cache: Hardware support for reverse execution. Computer Architecture News, 22(5):11-18, December 1994.
132. Saurabh Srivastava, Sumit Gulwani, Swarat Chaudhuri, and Jeffrey S. Foster. Path-based inductive synthesis for program inversion. SIGPLAN Notices, 46(6):492-503, 2011a.
133. Saurabh Srivastava, Sumit Gulwani, Swarat Chaudhuri, and Jeffrey S. Foster. Path-based inductive synthesis for program inversion. In Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’11, pages 492-503, New York, NY, USA, 2011b. ACM. ISBN 978-1-4503-0663-8.
134. Milena Stankovi and Suzana Stojkovi. Reversible synthesis through shared functional decision diagrams. In Roberto Moreno-Daz, Franz Pichler, and Alexis Quesada-Arencibia, editors, Computer Aided Systems Theory-EU-ROCAST 2009, volume 5717 of Lecture Notes in Computer Science, pages 510-517. Springer Berlin/Heidelberg, 2009. ISBN 978-3-642-04771-8.
135. Vincent S. Steckline. Zermelo, Boltzmann, and the recurrence paradox. American Journal of Physics, 51(10):894-897, 1983.
136. Doron Swade. The Difference Engine: Charles Babbage and the Quest to Build the First Computer. Viking Adult, 2001. ISBN 978-0670910205.
137. Leó Szilárd. On entropy reduction in a thermodynamic system by inference by intelligent subjects. Zeitschrift für Physik, 53:840-856, 1929. (original title “Über die Entropieverminderung in einem thermodynamischen System bei Eingriffen intelligenter Wesen”).
138. W. Teitelman. INTERLISP Reference Manual. Xerox PARC, Palo Alto, California, 1975.
139. W. Teitelman. Automated programming: The programmer’s assistant. Integrated Programming Environments, 1984.
140. Dave Thomas and Andy Hunt. Pragmatic Version Control Using CVS. The Pragmatic Programmers, 2003. ISBN 978-0974514000.
141. Michael Thomsen and Holger Axelsen. Parallel optimization of a reversible (quantum) ripple-carry adder. In Cristian Calude, Jos Costa, Rudolf Freund, Marion Oswald, and Grzegorz Rozenberg, editors, Unconventional Computing, volume 5204 of Lecture Notes in Computer Science, pages 228- 241. Springer Berlin/Heidelberg, 2008. ISBN 978-3-540-85193-6.
142. Michael Kirkedal Thomsen, Robert Glück, and Holger Bock Axelsen. Reversible arithmetic logic unit for quantum arithmetic. Journal of Physics A: Mathematical and Theoretical, 43(38):382002, 2010.
143. TOP500.org. Top500 supercomputer sites. http://www.top500.org, 2013. Accessed: 2013-05-01.
144. Yvan Van Rentergem and Alexis De Vos. Optimal design of a reversible full adder. International Journal of Unconventional Computing, 1:339-355, 2005.
145. Carlin Vieri, M. Josephine Ammer, Michael Frank, Norman Margolus, and Tom Knight. A fully reversible asymptotically zero energy microprocessor, 1998.
146. Carlin James Vieri. Pendulum: A reversible computer architecture. Master’s thesis, Massachusetts Institute of Technology, 1995.
147. Carlin James Vieri. Reversible computer engineering and architecture. PhD thesis, Massachusetts Institute of Technology, 1999.
148. Alexis De Vos. Reversible Computing. Wiley-VCH, 2010. ISBN 978-3527409921.
149. G. Vulov, Cong Hou, R. Vuduc, R. Fujimoto, D. Quinlan, and D. Jefferson. The backstroke framework for source level reverse computation applied to parallel discrete event simulation. In Simulation Conference (WSC), Proceedings of the 2011 Winter, pages 2960 -2974, 2011.
150. A. N. Whitehead and B. Russell. Principia Mathematica, Vol. 1. Cambridge University Press, London, 1925.
151. R. Wille, H.M. Le, G.W. Dueck, and D. Grosse. Quantified synthesis of reversible logic. In Design, Automation and Test in Europe, 2008. DATE ’08, pages 1015 -1020, 2008.
152. C.-Q. Yang and B.P. Miller. Critical path analysis for the execution of parallel and distributed programs. In Distributed Computing Systems, 1988., 8th International Conference on, pages 366-373, 1988.
153. Tetsuo Yokoyama. Reversible computation and reversible programming languages. Electron. Notes Theor. Comput. Sci., 253(6):71-81, March 2010. ISSN 1571-0661.
154. Tetsuo Yokoyama and Robert Glück. A reversible programming language and its invertible self-interpreter. In Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, PEPM ’07, pages 144-153, New York, NY, USA, 2007. ACM. ISBN 978-1-59593-620-2.
155. Tetsuo Yokoyama, Holger Axelsen, and Robert Glück. Towards a reversible functional language. In Alexis De Vos and Robert Wille, editors, Reversible Computation, volume 7165 of Lecture Notes in Computer Science, pages 14-29. Springer Berlin/Heidelberg, 2012. ISBN 978-3-642-29516-4.
156. Saed G. Younis and Tom F. Knight. Asymptotically zero energy computing using split-level charge recovery logic. In Proceedings of the International Workshop on Low Power Design, pages 177-182, 1994.
157. Ernst Zermelo. On a theorem of dynamics and the mechanical theory of heat. Annalen der Physik, 57:485-494, 1896.
158. P. Zuliani. Logical reversibility. IBM Journal of Research and Development, 45(6):807 -818, nov. 2001. ISSN 0018-8646.