Fundamentals of reversible flowchart languages

Theoretical Computer Science

Volumn 611, Issue , 2016, Pages 87-115

  Yokoyama, Tetsuo ^a   Axelsen, Holger Bock ^b   Glück, Robert ^b  

^a NANZAN UNIVERSITY   (Japan)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Flowchart; Program inversion; R Turing completeness; Reversible computing; Structured program theorem; Structured programming

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; FLOWCHARTING; PROGRAM TRANSLATORS; SEMANTICS; STRUCTURED PROGRAMMING; TURING MACHINES;

COMPUTABLE FUNCTIONS; PROGRAM INVERSION; REVERSIBLE COMPUTING; REVERSIBLE TURING MACHINES; STRUCTURED LANGUAGE; STRUCTURED PROGRAM THEOREM; THEORETICAL RESEARCH; TURING COMPLETENESS;

HIGH LEVEL LANGUAGES;

EID: 84975701572     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2015.07.046     Document Type: Article

References (68)

1. Abramov S.M., Glück R. Principles of inverse computation and the universal resolving algorithm. Lecture Notes in Computer Science 2002, vol. 2566:269-295. Springer-Verlag. T.Æ. Mogensen, D.A. Schmidt, I.H. Sudborough (Eds.).
2. Abramsky S. A structural approach to reversible computation. Theoret. Comput. Sci. 2005, 347(3):441-464.
3. Axelsen H.B. Clean translation of an imperative reversible programming language. Lecture Notes in Computer Science 2011, vol. 6601:144-163. Springer-Verlag. J. Knoop (Ed.).
4. Axelsen H.B., Glück R. A simple and efficient universal reversible Turing machine. Lecture Notes in Computer Science 2011, vol. 6638:117-128. Springer-Verlag. A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.).
5. Axelsen H.B., Glück R. What do reversible programs compute?. Lecture Notes in Computer Science 2011, vol. 6604:42-56. Springer-Verlag. M. Hofmann (Ed.).
6. Axelsen H.B., Glück R. Reversible representation and manipulation of constructor terms in the heap. Lecture Notes in Computer Science 2013, vol. 7948:96-109. Springer-Verlag. G.W. Dueck, D.M. Miller (Eds.).
7. Axelsen H.B., Glück R., Yokoyama T. Reversible machine code and its abstract processor architecture. Lecture Notes in Computer Science 2007, vol. 4649:56-69. Springer-Verlag. V. Diekert, M.V. Volkov, A. Voronkov (Eds.).
8. Bennett C.H. Logical reversibility of computation. IBM J. Res. Develop. 1973, 17(6):525-532.
9. Bennett C.H. Thermodynamics of computation-a review. Internat. J. Theoret. Phys. 1982, 21(12):905-940.
10. Bennett C.H. Time/space trade-offs for reversible computation. SIAM J. Comput. 1989, 18(4):766-776.
11. Böhm C., Jacopini G. Flow diagrams, Turing machines and languages with only two formation rules. Commun. ACM 1966, 9(5):366-371.
12. Bowman W.J., James R.P., Sabry A. Dagger traced symmetric monoidal categories and reversible programming. Lecture Notes in Computer Science 2011, vol. 7165:51-56. Springer-Verlag. A. De Vos, R. Wille (Eds.).
13. Carothers C.D., Perumalla K.S., Fujimoto R.M. Efficient optimistic parallel simulations using reverse computation. ACM Trans. Model. Comput. Simul. 1999, 9(3):224-253.
14. Cooper D.C. Böhm and Jacopini's reduction of flow charts. Commun. ACM 1967, 10(8):463. 473.
15. Structured Programming 1972, Academic Press. O.-J. Dahl, E.W. Dijkstra, C.A.R. Hoare (Eds.).
16. Danos V., Krivine J. Reversible communicating systems. Lecture Notes in Computer Science 2004, vol. 3170:292-307. Springer-Verlag. P. Gardner, N. Yoshida (Eds.).
17. Danos V., Krivine J. Formal molecular biology done in CCS-R. Electron. Notes Theoret. Comput. Sci. 2007, 180(3):31-49.
18. De Vos A. Reversible Computing: Fundamentals, Quantum Computing, and Applications 2010, Wiley-VCH.
19. Di Pierro A., Hankin C., Wiklicky H. Reversible Combinatory Logic. Math. Structures Comput. Sci. 2006, 16(4):621-637.
20. Dijkstra E.W. Letters to the editor: go to statement considered harmful. Commun. ACM 1968, 11(3):147-148.
21. Dijkstra E.W. Program inversion. Lecture Notes in Computer Science 1978, vol. 69:54-57. Springer-Verlag. F.L. Bauer, M. Broy (Eds.).
22. Foster J.N., Greenwald M.B., Moore J.T., Pierce B.C., Schmitt A. Combinators for bi-directional tree transformations: a linguistic approach to the view update problem. ACM Trans. Program. Lang. Syst. 2007, 29(3):1-65.
23. Frank M.P. Reversibility for efficient computing 1999, Ph.D. thesis, EECS Dept., Massachusetts Institute of Technology.
24. Fredkin E., Toffoli T. Conservative logic. Internat. J. Theoret. Phys. 1982, 21:219-253.
25. Glück R., Kawabe M. A program inverter for a functional language with equality and constructors. Lecture Notes in Computer Science 2003, vol. 2895:246-264. Springer-Verlag. A. Ohori (Ed.).
26. Glück R., Kawabe M. Derivation of deterministic inverse programs based on LR parsing. Lecture Notes in Computer Science 2004, vol. 2998:291-306. Springer-Verlag. Y. Kameyama, P.J. Stuckey (Eds.).
27. Glück R., Kawabe M. Revisiting an automatic program inverter for Lisp. SIGPLAN Not. 2005, 40(5):8-17.
28. Gomard C.K., Jones N.D. Compiler generation by partial evaluation: a case study. Struct. Program. 1991, 12:123-144.
29. Gries D. The Science of Programming. Texts and Monographs in Computer Science 1981, 265-274. Springer-Verlag, Ch. 21 Inverting Programs.
30. Harel D. On folk theorems. SIGACT News 1980, 12(3):68-80.
31. Hatcliff J. An introduction to online and offline partial evaluation using a simple flowchart language. Lecture Notes in Computer Science 1999, vol. 1706:20-82. Springer-Verlag. J. Hatcliff, T. Mogensen, P. Thiemann (Eds.).
32. Hou C., Vulov G., Quinlan D., Jefferson D., Fujimoto R., Vuduc R. A new method for program inversion. Lecture Notes in Computer Science 2012, vol. 7210:81-100. Springer-Verlag. M. O'Boyle (Ed.).
33. Hu Z., Mu S.-C., Takeichi M. A programmable editor for developing structured documents based on bidirectional transformations. High.-Order Symb. Comput. 2008, 21(1-2):89-118.
34. James R.P., Sabry A. Information effects. Principles of Programming Languages. Proceedings 2012, 73-84. ACM Press.
35. Kari J. Theory of cellular automata: a survey. Theoret. Comput. Sci. 2005, 334(1-3):3-33.
36. Kluge W.E. A reversible SE(M)CD machine. Lecture Notes in Computer Science 2000, vol. 1868:95-113. Springer-Verlag. P. Koopman, C. Clack (Eds.).
37. Knuth D.E. Structured programming with go to statements. ACM Comput. Surv. 1974, 6(4):261-301.
38. Landauer R. Irreversibility and heat generation in the computing process. IBM J. Res. Develop. 1961, 5(3):183-191.
39. Leeman G.B. A formal approach to undo operations in programming languages. ACM Trans. Program. Lang. Syst. 1986, 8(1):50-87.
40. C. Lutz, Janus: a time-reversible language, Letter to R. Landauer, 1986.
41. Manna Z. Mathematical Theory of Computation 1974, McGraw Hill.
42. Matos A.B. Linear programs in a simple reversible language. Theoret. Comput. Sci. 2003, 290(3):2063-2074.
43. Matsuda K., Wang M. FliPpr: a prettier invertible printing system. Lecture Notes in Computer Science 2013, vol. 7792:101-120. Springer-Verlag. M. Felleisen, P. Gardner (Eds.).
44. McCarthy J. The inversion of functions defined by Turing machines. Automata Studies 1956, 177-181. Princeton University Press. C.E. Shannon, J. McCarthy (Eds.).
45. Mogensen T.Æ. Semi-inversion of guarded equations. Lecture Notes in Computer Science 2005, vol. 3676:189-204. Springer-Verlag. R. Glück, M. Lowry (Eds.).
46. Mogensen T.Æ. Partial evaluation of the reversible language Janus. Partial Evaluation and Program Manipulation. Proceedings 2011, 23-32. ACM Press.
47. Mogensen T.Æ. Reference counting for reversible languages. Lecture Notes in Computer Science 2014, vol. 8507:82-94. Springer-Verlag. S. Yamashita, S. Minato (Eds.).
48. Morita K. Reversible computing and cellular automata - a survey. Theoret. Comput. Sci. 2008, 395(1):101-131.
49. Morita K., Yamaguchi Y. A universal reversible Turing machine. Lecture Notes in Computer Science 2007, vol. 4664:90-98. Springer-Verlag. J. Durand-Lose, M. Margenstern (Eds.).
50. Mu S.-C., Hu Z., Takeichi M. An injective language for reversible computation. Lecture Notes in Computer Science 2004, vol. 3125:289-313. Springer-Verlag. D. Kozen (Ed.).
51. Nishida N., Sakai M., Sakabe T. Partial inversion of constructor term rewriting systems. Lecture Notes in Computer Science 2005, vol. 3467:264-278. Springer-Verlag. J. Giesl (Ed.).
52. Object Management Group OMG unified modeling language UML (OMG UML): superstructure, version 2.4.1 2011, Tech. rep. formal/2011-08-06.
53. Phillips I., Ulidowski I. Reversing algebraic process calculi. J. Log. Algebr. Program. 2007, 73(1-2):70-96.
54. Saeedi M., Markov I.L. Synthesis and optimization of reversible circuits - a survey. ACM Comput. Surv. 2013, 45(2):21:1-21:34.
55. Schellekens M.P. MOQA; unlocking the potential of compositional static average-case analysis. J. Log. Algebr. Program. 2010, 79(1):61-83.
56. Stoddart B., Lynas R., Zeyda F. A virtual machine for supporting reversible probabilistic guarded command languages. Electron. Notes Theor. Comput. Sci. 2010, 253(6):33-56.
57. Thomsen M.K., Axelsen H.B., Glück R. A reversible processor architecture and its reversible logic design. Reversible Computation. Proceedings 2012, vol. 7165:30-42. Springer-Verlag. A. De Vos, R. Wille (Eds.).
58. Thomsen M.K., Glück R., Axelsen H.B. Reversible arithmetic logic unit for quantum arithmetic. J. Phys. A 2010, 43(38):382002.
59. Toffoli T. Computation and construction universality of reversible cellular automata. J. Comput. System Sci. 1977, 15(2):213-231.
60. Vieri C.J. Reversible computer engineering and architecture 1999, Ph.D. thesis, EECS Dept., Massachusetts Institute of Technology.
61. Wille R., Drechsler R. Towards a Design Flow for Reversible Logic 2010, Springer-Verlag.
62. Wille R., Offermann S., Drechsler R. SyReC: a programming language for synthesis of reversible circuits. Forum on Specification and Design Languages 2010, 184-189.
63. Yokoyama T., Axelsen H.B., Glück R. Principles of a reversible programming language. Computing Frontiers. Proceedings 2008, 43-54. ACM Press.
64. Yokoyama T., Axelsen H.B., Glück R. Reversible flowchart languages and the structured reversible program theorem. Lecture Notes in Computer Science 2008, vol. 5126:258-270. Springer-Verlag. L. Aceto, I. Damgård, L.A. Goldberg, M.M. Halldórsson, A. Ingólfsdóttir, I. Walukiewicz (Eds.).
65. Yokoyama T., Axelsen H.B., Glück R. Optimizing clean reversible simulation of injective functions. J. Mult.-Valued Logic Soft Comput. 2012, 18(1):5-24.
66. Yokoyama T., Axelsen H.B., Glück R. Towards a reversible functional language. Lecture Notes in Computer Science 2012, vol. 7165:14-29. Springer-Verlag. A. De Vos, R. Wille (Eds.).
67. Yokoyama T., Glück R. A reversible programming language and its invertible self-interpreter. Partial Evaluation and Semantics-Based Program Manipulation. Proceedings 2007, 144-153. ACM Press.
68. Zuliani P. Logical reversibility. IBM J. Res. Develop. 2001, 45(6):807-818.