Notes on the history of reversible computation
IBM Journal of Research and Development
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Randomized algorithms
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Towards Verified Systems
Proceedings of the 7th Colloquium on Automata, Languages and Programming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Logical reversibility
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum Programming With Mixed States
Electronic Notes in Theoretical Computer Science (ENTCS)
A Virtual Machine for Supporting Reversible Probabilistic Guarded Command Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Reversible Computation and Reversible Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Preference and non-deterministic choice
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A design-based model of reversible computation
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.02 |
A method has been developed for transforming a program written in the probabilistic guarded-command language (pGCL) into an equivalent but reversible program. The method extends previous work on logical reversibility to that language and pertains to "demonic" nondeterminism and probability. Use is made of a formal definition of logical reversibility and the expectation-transformer semantics for pGCL. The method should be useful in the compilation of a general-purpose programming language for quantum computation.