Towards a refinement algebra

Science of Computer Programming

Volumn 51, Issue 1-2, 2004, Pages 23-45

  Von Wright, J ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Iteration; Kleene algebra; Predicate transformers; Refinement

Indexed keywords

COMPUTER PROGRAMMING; ITERATIVE METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; THEOREM PROVING;

ITERATION; KLEENE ALGEBRA; PREDICATE TRANSFORMERS; REFINEMENT;

ALGEBRA;

EID: 1942517881     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2003.09.002     Document Type: Conference Paper

References (26)

1. Aarts C., et al. Fixpoint calculus. Inform. Process. Lett. 53(3):1995;131-136.
2. Back R.J. Correctness Preserving Program Refinements: Proof Theory and Applications. Mathematical Centre Tracts. vol. 131:1980;Mathematical Centre, Amsterdam.
3. R.J. Back, Refining atomicity in parallel algorithms, in: PARLE Conf. on Parallel Architectures and Languages Europe, Eindhoven, the Netherlands, Springer, Berlin, 1989.
4. Back R.J., Sere K. Stepwise refinement of action systems. Struct Program. 12:1991;17-30.
5. Back R.J., von Wright J. Refinement Calculus: A Systematic Introduction. 1998;Springer, Berlin.
6. Back R.J., von Wright J. Reasoning algebraically about loops. Acta Inform. 36:1999;295-334.
7. Back R.J., von Wright J. Encoding, decoding, and data refinement. Formal Aspects Comput. 12(5):2000;313-349.
8. Backhouse R.C., Carré B.A. Regular algebra applied to path finding problems. J. Inst. Math. Appl. 15:1975;161-186.
9. de Bakker J.W. Mathematical Theory of Program Correctness. 1980;Prentice-Hall, Englewood Cliffs, NJ.
10. Bergstra J.A., Ponse A. Non-regular iterators in process algebra problems. Theoret. Comput. Sci. 269:2001;203-229.
11. W. Chen, J.T. Udding, Program inversion: more than fun! Report CS 8903, Department of Mathematics and Computer Science, University of Groningen, 1988.
12. E. Cohen, Hypotheses in Kleene Algebra, Telcordia, 1994, unpublished manuscript.
13. E. Cohen, Separation and reduction, in: R. Backhouse, J. Oliveira (Eds.), Mathematics of Program Construction, Lecture Notes in Computer Science, vol. 1837, Portugal, Springer, Berlin, 2000.
14. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall International, Englewood Cliffs, NJ.
15. Dijkstra R.M. Computation calculus bridging a formalization gap. Sci. Comput. Programming. 37:2000;3-36.
16. Gardiner P.H., Morgan C.C. A single complete rule for data refinement. Formal Aspects Comput. 5(4):1993;367-383.
17. Gries D. The Science of Programming. 1981;Springer, New York.
18. Hayes I.J. Reasoning about real-time repetitions. terminating and nonterminating Sci. Comput. Programming. 43(2-3):2002;161-192.
19. Kozen D. Kleene algebra with tests. ACM Trans. Programming Languages Systems. 19(3):1999;427-443.
20. Kozen D. On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Logic. 1(1):2000;60-76.
21. D. Kozen, M.-C. Patron, Certification of compiler optimizations using Kleene Algebra with tests, in: 1st Internat. Conf. on Computational Logic, Lecture Notes in Artificial Intelligence, vol. 186, London, July 2000, Springer, Berlin, pp. 568-582.
22. M.S. Manasse, C.G. Nelson, Correct compilation of control structures, Tech. Memo. 11271-840909-09TM, AT&T Bell Laboratories, September 1984.
23. Morgan C.C. Programming from Specifications. 2nd ed. 1994;Prentice-Hall, Englewood Cliffs, NJ.
24. J.L.A. van de Snepscheut, On lattice theory and program semantics, Tech. Report CS-TR-93-19, Caltech, Pasadena, CA, USA, 1993.
25. von Wright J. Program inversion in the refinement calculus. Inform. Process. Lett. 37(2):1991;95-100.
26. J. von Wright, From Kleene algebra to refinement algebra, in: E.A. Boiten, B.M. Möller (Eds.), Mathematics of Program Construction, Lecture Notes in Computer Science, vol. 2386, Germany, Springer, Berlin, 2002.