Reversible Flowchart Languages and the Structured Reversible Program Theorem

  • Tetsuo Yokoyama
  • Holger Bock Axelsen
  • Robert Glück
Conference paper

DOI: 10.1007/978-3-540-70583-3_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5126)
Cite this paper as:
Yokoyama T., Axelsen H.B., Glück R. (2008) Reversible Flowchart Languages and the Structured Reversible Program Theorem. In: Aceto L., Damgård I., Goldberg L.A., Halldórsson M.M., Ingólfsdóttir A., Walukiewicz I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5126. Springer, Berlin, Heidelberg

Abstract

Many irreversible computation models have reversible counterparts, but these are poorly understood at present. We introduce reversible flowcharts with an assertion operator and show that any reversible flowchart can be simulated by a structured reversible flowchart using only three control flow operators. Reversible flowcharts are r- Turing-complete, meaning that they can simuluate reversible Turing machines without garbage data. We also demonstrate the injectivization of classical flowcharts into reversible flowcharts. The reversible flowchart computation model provides a theoretical justification for low-level machine code for reversible microprocessors as well as high-level block-structured reversible languages. We give examples for both such languages and illustrate them with a lossless encoder for permutations given by Dijkstra.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tetsuo Yokoyama
    • 1
  • Holger Bock Axelsen
    • 2
  • Robert Glück
    • 2
  1. 1.NCES, Graduate School of Information ScienceNagoya University 
  2. 2.DIKU, Department of Computer ScienceUniversity of Copenhagen 

Personalised recommendations