000 04215nam a22005895i 4500
001 978-3-319-40578-0
003 DE-He213
005 20180206183038.0
007 cr nn 008mamaa
008 160629s2016 gw | s |||| 0|eng d
020 _a9783319405780
_9978-3-319-40578-0
050 4 _aQA76.9.L63
072 7 _aUYF
_2bicssc
072 7 _aCOM036000
_2bisacsh
082 0 4 _a621.395
_223
245 1 0 _aReversible Computation
_h[recurso electrónico] :
_b8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings /
_cedited by Simon Devitt, Ivan Lanese.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXIII, 339 p. 109 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9720
505 0 _aProcess 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-DDsforNearestNeighborOptimizationofQuantumCircuits -- 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aLogic design.
650 0 _aProgramming languages (Electronic computers).
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aQuantum computers.
650 1 4 _aComputer Science.
650 2 4 _aLogic Design.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aQuantum Computing.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aDevitt, Simon.
_eeditor.
700 1 _aLanese, Ivan.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319405773
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9720
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://dx.doi.org/10.1007/978-3-319-40578-0
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cLIBRO_ELEC
999 _c226717
_d226717