Optimizing reversible programs

DOI10.1007/978-3-031-09005-9_16OpenAlexW4293210559MaRDI QIDQ2097435FDOQ2097435

Authors: Niklas Deworetzki, Martin Kutrib, Uwe Meyer, Pia-Doreen Ritzke 

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09005-9_16

zbMATH Keywords

optimizationreversible programming languagesJanusreverse computingreversible static-single-assignment

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites Work

• Irreversibility and Heat Generation in the Computing Process
• Fundamentals of reversible flowchart languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Designing a reversible stack machine
• RSSA: A Reversible SSA Form
• Title not available (Why is that?)
• Compiling Janus to RSSA

Cited In (6)

• Programs with restoration of computations
• Optimization of reversible control flow graphs
• Towards a dereversibilizer: fewer asserts, statically
• Program reversals for evolutions with non-uniform step costs
• Reversible Functional Array Programming
• Concurrent RSSA for CRIL: flow analysis for a concurrent reversible programming language

This page was built for publication: Optimizing reversible programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097435)