From kleene algebra to refinement algebra

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

Volumn 2386, Issue , 2002, Pages 233-262

  Von Wright, Joakim ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

KLEENE ALGEBRA WITH TESTS; KLEENE ALGEBRAS; PARTIAL CORRECTNESS; REASONING ABOUT PROGRAMS;

ALGEBRA;

EID: 84959048145     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45442-X_14     Document Type: Conference Paper

References (23)

1. C. Aarts et al. Fixpoint calculus. Information Processing Letters, 53(3), February 1995.
2. R. J. Back and J. von Wright. Encoding, decoding, and data refinement. Formal Aspects of Computing, 12(5):313-349, 2000.
3. R.J. Back. Correctness Preserving Program Refinements: Proof Theory and Applications, volume 131 of Mathematical Centre Tracts. Mathematical Centre, Amsterdam, 1980.
4. R.J. Back. Refining atomicity in parallel algorithms. In PARLE Conference on Parallel Architectures and Languages Europe, Eindhoven, the Netherlands, June 1989. Springer-Verlag.
5. R.J. Back and K. Sere. Stepwise refinement of action systems. Structured Programming, 12:17-30, 1991.
6. R.J. Back and J. von Wright. Refinement Calculus: A Systematic Introduction. Springer-Verlag, 1998.
7. R.J. Back and J. von Wright. Reasoning algebraically about loops. Acta Informatica, 36:295-334, 1999.
8. R.C. Backhouse and B.A. Carré. Regular algebra applied to path finding problems. Journal Inst. Math. Appl., 15:161-186, 1975.
9. J.W. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall, 1980.
10. W. Chen and J.T. Udding. Program inversion: more than fun! Report CS 8903, Department of Mathematics and Computer Science, University of Groningen, 1988.
11. E. Cohen. Hypotheses in Kleene Algebra. Unpublished manuscript, Telcordia, 1994.
12. E. Cohen. Separation and reduction. In Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science, Portugal, July 2000. Springer- Verlag.
13. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall International, 1976.
14. R.M. Dijkstra. Computation calculus bridging a formalization gap. Science of Computer Programming, 37:3-36, 20000.
15. D. Gries. The Science of Programming. Springer-Verlag, New York, 1981.
16. I.J. Hayes. Reasoning about real-time repetitions: Terminating and nonterminating. Techn. Rep. 01-04, Software Verification Research Centre, The University of Queensland, February 2001.
17. D. Kozen. Kleene algebra with tests. ACM Transactions on Programming Languages and Systems, 19(3):427-443, 1999.
18. D. Kozen. On Hoare logic and Kleene algebra with tests. ACM Transactions on Computational Logic, 1(1):60-76, 2000.
19. D. Kozen and M-C. Patron. Certification of compiler optimizations using Kleene Algebra with tests. In 1st International Conference on Computational logic, volume 1861 of Lecture Notes in Artificial Intelligence, pages 568-582, London, July 2000. Springer-Verlag.
20. M.S. Manasse and C.G. Nelson. Correct compilation of control structures. Techn. Memo. 11271-840909-09TM, AT&T Bell Laboratories, September 1984.
21. C.C. Morgan. Programming from Specifications. Prentice-Hall, 1990.
22. J.L.A. van de Snepscheut. On lattice theory and program semantics. Technical Report CS-TR-93-19, Caltech, Pasadena, California, USA, 1993.
23. J. von Wright. Program inversion in the refinement calculus. Information Processing Letters, 37(2):95-100, January 1991.