Reversible Computation: 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings

by Simon Devitt, Ivan Lanese

Overview

This book constitutes the refereed proceedings of the 8th International Conference on Reversible Computation, RC 2016, held in Bologna, Italy, in July 2016.
The 18 full and 5 short papers included in this volume were carefully reviewed and selected from 38 submissions. The papers are organized in topical sections named: process calculi; reversible models; programming languages; quantum computing; quantum programming; circuit theory; and syntheses.

Product Details

ISBN-13:	9783319405773
Publisher:	Springer International Publishing
Publication date:	08/07/2016
Series:	Lecture Notes in Computer Science , #9720
Edition description:	1st ed. 2016
Pages:	339
Product dimensions:	6.10(w) x 9.25(h) x (d)

Table of Contents

Process Calculi.- Rigid Families for the Reversible pi-calculus.- A calculus for local reversibility.- Static VS Dynamic Reversibility in CCS.- Reversing Single Sessions.- Reversible Models.- Reversible causal graph dynamics.- Boosting Reversible Pushdown Machines By Preprocessing.- Reversible Computation vs. Reversibility in Petri Nets.- Programming Languages.- Energy Efficient Language and Compiler for (Partially) Reversible Algorithms.- Mixing Hardware and Software Reversibility for Speculative Parallel Discrete Event Simulation.- Quaglia.- Elements of a Reversible Object-Oriented Language.- Initial Ideas for Automatic Design and Verification of Control Logic in Reversible HDLs.- Quantum Computing.- Design and Fabrication of CSWAP Gate Based on Nanoelectromechanical Systems.- Design of p-valued Deutsch quantum gates with multiple control signals and mixed polarity.- Using pi-DDs for Nearest Neighbor Optimization of Quantum Circuits.- Quantum Programming.- Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits.- Towards Quantum Programs Verification: From Quipper Circuits to QPMC.- Circuit Theory.-Application of Permutation Group Theory in Reversible Logic Synthesis.- Strongly Universal Reversible Gate Sets.- Enumeration of reversible functions and its application to circuit complexity.- A finite alternation result for reversible Boolean circuits.- Syntheses.- Generating reversible circuits from higher-order functional programs.- A fast symbolic transformation based algorithm for reversible logic synthesis.-Checking Reversibility of Boolean Functions.