This communication presents the complete design of a reversible arithmetic logic unit (ALU)
that can be part of a programmable reversible computing device such as a quantum …

Reversible computing is the study of computation models that exhibit both forward and
backward determinism. Understanding the fundamental properties of such models is not …

We describe the design of a purely reversible computing architecture, Bob, and its
instruction set, BobISA. The special features of the design include a simple, yet expressive …

We describe the translation techniques used for the code generation in a compiler from the
high-level reversible imperative programming language Janus to the low-level reversible …

We construct a universal reversible Turing machine (URTM) from first principles. We take a
strict approach to the semantics of reversible Turing machines (RTMs), under which they can …

We provide a treatment of the reversible Turing machines (RTMs) under a strict function
semantics. Unlike many existing reversible computation models, we distinguish strictly …

Reversible logic is a computational model where all gates are logically reversible and
combined in circuits such that no values are lost or duplicated. This paper presents a novel …

Tainted flow attacks originate from program inputs maliciously crafted to exploit software
vulnerabilities. These attacks are common in server-side scripting languages, such as PHP …

Bennett showed that a clean reversible simulation of injective programs is possible without
returning the input of a program as additional output. His method involves two computation …

Abstract Previously, Soeken and Thomsen presented six basic semantics-preserving rules
for rewriting reversible logic circuits, defined using the well-known diagrammatic notation of …