Reversible Computation: 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings (Lecture Notes in Computer Science Book 9720)

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. Front Matter....Pages I-XIII Front Matter....Pages 1-1 A Calculus for Local Reversibility....Pages 3-19 Static VS Dynamic Reversibility in CCS....Pages 20-35 Reversing Single Sessions....Pages 36-51 Front Matter....Pages 52-69 Reversible Causal Graph Dynamics....Pages 71-71 Boosting Reversible Pushdown Machines by Preprocessing....Pages 73-88 Reversible Computation vs. Reversibility in Petri Nets....Pages 89-104 Front Matter....Pages 105-118 Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms....Pages 119-119 Mixing Hardware and Software Reversibility for Speculative Parallel Discrete Event Simulation....Pages 121-136 Elements of a Reversible Object-Oriented Language....Pages 137-152 Initial Ideas for Automatic Design and Verification of Control Logic in Reversible HDLs....Pages 153-159 Front Matter....Pages 160-166 Design and Fabrication of CSWAP Gate Based on Nano-Electromechanical Systems....Pages 167-167 Design of p-Valued Deutsch Quantum Gates with Multiple Control Signals and Mixed Polarity....Pages 169-174 Front Matter....Pages 175-180 Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits....Pages 181-196 Towards Quantum Programs Verification: From Quipper Circuits to QPMC....Pages 197-197 Front Matter....Pages 199-212 Application of Permutation Group Theory in Reversible Logic Synthesis....Pages 213-219 Strongly Universal Reversible Gate Sets....Pages 221-221 Enumeration of Reversible Functions and Its Application to Circuit Complexity....Pages 223-238 A Finite Alternation Result for Reversible Boolean Circuits....Pages 239-254 Front Matter....Pages 255-270 Generating Reversible Circuits from Higher-Order Functional Programs....Pages 271-285 A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis....Pages 287-287 Checking Reversibility of Boolean Functions....Pages 289-306 Back Matter....Pages 307-321 ....Pages 322-337