A design-based model of reversible computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4010 LNCS, Issue , 2006, Pages 63-83

  Stoddart, Bill ^a   Zeyda, Prank ^a   Robert, Lynas ^a  

^a TEESSIDE UNIVERSITY   (United Kingdom)

Author keywords

Backtracking; Hoare He Designs; Prospective values; Reversible computing; Wp calculus

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; PROBABILITY; THEOREM PROVING;

BACKTRACKING; HOARE HE DESIGNS; PROSPECTIVE VALUES; REVERSIBLE COMPUTING; WP CALCULUS;

COMPUTER PROGRAMMING;

EID: 33746055727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11768173_4     Document Type: Conference Paper

References (21)

1. J-R Abrial and W J Mussat. On Using Conditional Definitions in Formal Theories. In Bert D, Bowen J, Henson M, and Robinson K, editors, ZB2002, number 2272 in Lecture Notes in Computer Science, 2002.
2. C Bennett. The Logical Reversibility of Computation. IBM Journal of Research and Development, 6, 1973.
3. C Bennett. The Thermodynamics of Computation. International Journal of Theoretical Physics, 21 pp 905-940, 1982.
4. R P Feynman. Lectures on Computation. Westview Press, 1996.
5. R W Floyd. Non-deterministic Algorithms. Journal of the ACM, 14(4), 1967.
6. M P Frank. Reversibility for Efficiant Computing. PhD thesis, MIT, 1999.
7. E C R Hehner. Bunch theory: A simple set theory for computer science. Information Processing Letters, 12.1 pp26-31, 1981.
8. E C R Hehner. A Practical Theory of Programming. Springer Verlag, 1993.
9. C A R Hoare and He Jifeng. Unifying Theories of Programming. Prentice Hall, 1998.
10. R Landauer. Irreversibility and Heat Generated in the Computing Process. IBM J R&D, 5, 1961.
11. Yves Lecerf. Machines de Turing Reversibles. Comptes rendus de l'Académie Française des Sciences, 257(1963), 1963.
12. C Morgan. The specification statement. ACM Transactions on Programming Systems, 10(3), 1988.
13. Carroll Morgan and Annabel McIver. pGCL: Formal Reasoning for Random Algorithms. South African Computer J., 22:14-27, 1999.
14. J Morris and A Bunkenburg. A theory of bunches. Acta Informatica, 37(8), 2001.
15. R F Paige and E C R Hehner. Bunches for Object Oriented, Current and Real Time Specification. In J M Wing, Woodcock J, and Davies J, editors, FM99 vol 1, number 1708 in Lecture Notes in Computer Science. Springer Verlag, 1999.
16. W J Stoddart, S E Dunne, and Galloway A J. Undefined Expressions and Logic in Z and B. Formal Methods in System Design, 15(3), 1999.
17. L Szilard. On the Decrease of Entropy in a Thermodynamic System by the intervention of Intelligent Beings. Z Phys, 53, 1929.
18. J von Neumann. Theory of Self Reproducing Automata, University of Illinois Press, Year of book publication 1966. The remark was originally made in a talk given in 1949. Edited and completed by Arthur Burks.
19. F Zeyda, W J Stoddart, and S E Dunne. The Refinement of Reversible Computations. In T Muntean and K Sere, editors, 2nd International Workshop on Refinement of Critical Systems, 2003. Available from www.esil.univmrs.fr/spc/ rcs03/rcs03.
20. Frank Zeyda, Bill Stoddart, and Steve Dunne. A Prospective-value Semantics for the GSL. In M Henson, S King, S Schneider, and H Treharne, editors, ZB2005, number 3455 in Lecture Notes in Computer Science, 2005.
21. P Zuliani. Logical reversibility. IBM J R&D, 4.5(6), 2001.