Fundamentals of reversible flowchart languages

Yokoyama, T.; Axelsen, Holger Bock; Glück, Robert

doi:10.1016/j.tcs.2015.07.046

Cited by 40 publications

(39 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the following, we shall make heavy use of program inversion, so the direct coupling between the mechanical and semantical transformation is significant. The possibility to perform program inversion locally is also key to the implementation of reversible programming languages [35][36][37] and reversible microprocessors [6,32] because it allows on-the-fly program inversion.…”

Section: Then T −1 Is An Rtm That Computes the Inverse Function Of [[mentioning

confidence: 99%

“…3. A central insight from reversible flowcharts [36] is that the inverse of a test (a conditional split in control flow) is an assertion (a conditional join of control flow). Thus, the inversion yields a (partial) RTM program that can merge two control branches if we know two strings are equal in one branch, and different in the other.…”

Section: Then T −1 Is An Rtm That Computes the Inverse Function Of [[mentioning

confidence: 99%

“…Figure 7 shows a high-level state diagram of the program: nodes are states, and edges are the actions of the associated rules. We use a diagrammatic notation combining ordinary state diagrams with reversible flowcharts [36]. The diamond (test) and circle (assertion) with inscribed expressions are reversible control flow operators (CFOs).…”

Section: Lemma 17 (Program Inversion By Encoding Reversal) Let T Be Amentioning

confidence: 99%

“…[35,36] (where the r-Turing completeness concept was informally proposed). In these cases, we were able to exploit the reversibility of the interpreted machines directly, and did not have to rely on reversibilization of any kind, which eased the implementation greatly.…”

Section: A Standard For Reversible Computability: R-turing Completenessmentioning

confidence: 99%

“…A more programming-oriented computation model is given by the reversible flowchart languages [36], from which we borrowed the graphical notation of assertions. These can directly model low-level (unstructured) and high-level (structured) imperative reversible languages with richer data structures and random-access storage, including machine code for reversible von Neumann machines [6,31].…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

On reversible Turing machines and their function universality

Axelsen

Glück

2016

Acta Informatica

Self Cite

View full text Add to dashboard Cite

We provide a treatment of the reversible Turing machines (RTMs) under a strict function semantics. Unlike many existing reversible computation models, we distinguish strictly between computing the function λx. f (x) and computing the function λx. (x, f (x)), or other injective embeddings of f . We reinterpret and adapt a number of important foundational reversible computing results under this semantics. Unifying the results in a single model shows that, as expected (and previously claimed), the RTMs are robust and can compute exactly all injective computable functions. Because injectivity entails that the RTMs are not strictly Turing-complete w.r.t. functions, we use an appropriate alternative universality definition, and show how to derive universal RTMs (URTMs) from existing irreversible universal machines. We then proceed to construct a URTM from the ground up. This resulting machine is the first URTM which does not depend on a reversible simulation of an existing universal machine. The new construction has the advantage that the interpretive overhead of the URTM is limited to a (program dependent) constant factor. Another novelty is that the URTM can function as an inverse interpreter at no asymptotic cost. Mathematics Subject Classification 68Q05 · 68Q10 · 03D10Revised and extended version of the conference papers [4,5].

show abstract

Section: Then T −1 Is An Rtm That Computes the Inverse Function Of [[mentioning

confidence: 99%

Section: Then T −1 Is An Rtm That Computes the Inverse Function Of [[mentioning

confidence: 99%

Section: Lemma 17 (Program Inversion By Encoding Reversal) Let T Be Amentioning

confidence: 99%

Section: A Standard For Reversible Computability: R-turing Completenessmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

On reversible Turing machines and their function universality

Axelsen

Glück

2016

Acta Informatica

Self Cite

View full text Add to dashboard Cite

show abstract

Foundations of Reversible Computation

Aman

Ciobanu

Glück

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled "Reversible Computation-Extending Horizons of Computing", which took place in the years 2015-2019.

show abstract

A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs

Hoey

Lanese

Nishida

et al. 2020

Reversible Computation: Extending Horizons of Computing

View full text Add to dashboard Cite

Reversible computing allows one to run programs not only in the usual forward direction, but also backward. A main application area for reversible computing is debugging, where one can use reversibility to go backward from a visible misbehaviour towards the bug causing it. While reversible debugging of sequential systems is well understood, reversible debugging of concurrent and distributed systems is less settled. We present here two approaches for debugging concurrent programs, one based on backtracking, which undoes actions in reverse order of execution, and one based on causal consistency, which allows one to undo any action provided that its consequences, if any, are undone beforehand. The first approach tackles an imperative language with shared memory, while the second one considers a core of the functional message-passing language Erlang. Both the approaches are based on solid formal foundations.

show abstract

Fundamentals of reversible flowchart languages

Cited by 40 publications

References 61 publications

On reversible Turing machines and their function universality

On reversible Turing machines and their function universality

Foundations of Reversible Computation

A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs

Contact Info

Product

Resources

About