A unification of probabilistic choice within a design-based model of reversible computation

Formal Aspects of Computing

Volumn 25, Issue 1, 2013, Pages 107-131

  Stoddart, Bill ^a   Zeyda, Frank ^b  

^a TEESSIDE UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Backtracking; Bunches; Hoare He designs; Probability; Reversible computing

Indexed keywords

BACKTRACKING; BUNCHES; DISTRIBUTION SPACE; EXECUTION LANGUAGES; GALOIS CONNECTION; GENERALISATION; GUARDED COMMANDS; IMPLEMENTATION PLATFORMS; NON-DETERMINISM; NON-PROBABILISTIC; OPERATIONAL INTERPRETATION; PROBABILISTIC CHOICES; PROBABILISTIC DESIGN; PROGRAMMING STRUCTURES; RELATIONAL MODEL; REVERSE COMPUTATION; REVERSIBLE COMPUTATIONS; REVERSIBLE COMPUTING; SEARCH SPACES; SEQUENTIAL COMPUTATIONS; SYMMETRY-BREAKING; THEORETICAL INVESTIGATIONS; VIRTUAL MACHINES;

COMPUTATION THEORY; PROBABILITY; SOFTWARE ENGINEERING;

DESIGN;

EID: 84872322475     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-007-0048-1     Document Type: Conference Paper

References (22)

1. Abrial J-R, Mussat WJ (2002) On using conditional definitions in formal theories. In: ZB 2002: Formal Specification and Development in Z and B, Vol 2272. Lecture Notes in Computer Science. Springer, Heidelberg
2. Bennett C (1973) The logical reversibility of computation. IBM J Res Dev 6
3. Bennett C (1982) The thermodynamics of computation. Int J Theor Phys 21:905-940
4. den Hartog J (2001) Probabilistic extensions of semantic models. PhD thesis, IPA, Amsterdam
5. Feynman RP (1996) Lectures on computation. Westview, Boulder
6. Floyd RW (1967) Nondeterministic algorithms. J ACM 14(4):636-644
7. Hehner ECR (1981) Bunch theory: a simple set theory for computer science. Inf Process Lett 12(1):26-30
8. Hehner ECR (1993) A practical theory of programming. Texts and Monographs in Computer Science. Springer, Heidelberg
9. He J, Sanders JW (2006) Unifying probability. In: First international symposium on unifying theories of programming, UTP 2006, Vol 4010. Lecture Notes in Computer Science. Springer, Heidelberg, pp 173-199
10. He J, Seidel K, McIver A (1997) Probabilistic models for the guarded command language. Sci Comput Program 28(2-3):171-192
11. Landauer R (1961) Irreversibility and heat generated in the computing process. IBM J R D 5
12. McIver A, Morgan CC (2004) Abstraction, refinement and proof for probabilistic systems. Springer, Heidelberg
13. Morgan CC (1988) The specification statement. ACM Trans Program Lang Syst 10(3):403-419
14. Nelson G (1989) A generalization of Dijkstra's calculus. ACM Trans Program Lang Syst 11(4):517-561
15. Stoddart WJ, Dunne SE, Galloway AJ (1999) Undefined expressions and logic in Z and B. Form Methods Syst Des 15(3)
16. Stoddart WJ (2006) The reversible virtual machine. User and technical manuals, University of Teesside, UK
17. Stoddart WJ, Zeyda F, Lynas AR (2006) A design-based model of reversible computation. In: UTP 2006, First international symposium on unifying theories of programming, Vol 4010. Lecture Notes in Computer Science, Springer, Heidelberg, pp 63-83
18. Varacca D, Winskel G (2007) Distributing probability over nondeterminism. Mathematical Structures in Computer Science (in press)
19. Zeyda F (2007) Reversible computation in B. PhD thesis, University of Teesside
20. Zeyda F, Stoddart WJ, Dunne S (2003) The refinement of reversible computations. In: RCS'03: 2nd International workshop on refinement of critical systems: methods, tools and developments
21. Zeyda F, Stoddart WJ, Dunne S (2005) A prospective-value semantics for the GSL. In: ZB 2005: Formal specification and development in Z and B, Vol 3455. Lecture Notes in Computer Science, Springer, Heidelberg, pp 187-202
22. Zuliani P (2001) Logical reversibility. IBM J R D 45(6)