Lazy Kleene algebra

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

Volumn 3125, Issue , 2004, Pages 252-273

  Möller, Bernhard ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

DIJKSTRA; DISTRIBUTIVITY; KLEENE ALGEBRAS; MODAL OPERATORS; PREDICATE TRANSFORMERS; VON WRIGHTS;

ALGEBRA;

EID: 35048895351     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27764-4_14     Document Type: Article

References (24)

1. R. Back, J. von Wright: Refinement calculus - a systematic introduction. Springer 1998
2. R. C. Backhouse et al.: Fixed point calculus. Inform. Proc. Letters, 53:131-136, 1995.
3. J.A. Bergstra, I. Bethke, A. Ponse: Process algebra with iteration and nesting. The Computer Journal 37(4), 243-258, 1994
4. E. Cohen: Separation and reduction. In R. Backhouse and J.N. Oliveira (eds.): Mathematics of Program Construction. Lecture Notes in Computer Science 1837. Berlin: Springer 2000, 45-59
5. J.H. Conway: Regular algebra and finite machines. London: Chapman and Hall 1971
6. J. Desharnais, B. Möller, G. Struth: Kleene algebra with domain. Technical Report 2003-07, Universität Augsburg, Institut für Informatik, June 2003
7. J. Desharnais, B. Möller, G. Struth: Termination in modal Kleene algebra. Technical Report 2004-04, Universität Augsburg, Institut für Informatik, January 2004.
8. Revised version: Proc. IFIP World Computer Congress 2004, Toulouse, August 22-27, 2004, Subconference TCS-Logic (to appear)
9. R.M. Dijkstra: Computation calculus - bridging a formalization gap. In: J. Jeuring (ed.): Proc. MPC 1998. LNCS 1422, 151-174
10. R.M. Dijkstra: Computation calculus bridging a formalization gap. Science of Computer Programming 37, 3-36 (2000)
11. C.C. Elgot: Matricial theories. Journal of Algebra 42, 391-422 (1976)
12. B. von Karger, C.A.R. Hoare: Sequential calculus. Information Processing Letters 53, 1995, 123-130
13. D. Kozen: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110:2, 366-390 (1994)
14. D. Kozen: Kleene algebras with tests. ACM TOPLAS 19:427-443, 1997.
15. D. Kozen: Kleene Algebra with Tests and the Static Analysis of Programs. Cornell University, Department of Computer Science, Technical Report TR2003-1915, 2003
16. J.J. Lukkien: An operational semantics for the guarded command language. In: R.S. Bird, C.C. Morgan, J.C.P. Woodcock (eds.): Mathematics of Program Construction. Lecture Notes in Computer Science 669. Berlin: Springer 1993, 233-249
17. J. J. Lukkien: Operational semantics and generalized weakest preconditions. Science of Computer Programming 22, 137-155 (1994)
18. B. Möller: Ideal stream algebra. In: B. Möller, J.V. Tucker (eds.): Prospects for hardware foundations. Lecture Notes in Computer Science 1546. Berlin: Springer 1998, 69-116
19. B. Möller, G. Struth: Modal Kleene algebra and partial correctness. Technical Report 2003-08, Universität Augsburg, Institut für Informatik, May 2003.
20. Revised version: Proc. AMAST 2004, Stirling, July 12-16, 2004 (to appear)
21. K.I. Rosenthal: Quantales and their applications. Pitman Research Notes in Mathematics Series, Vol. 234. Longman Scientific&Technical 1990.
22. L. Staiger: Omega languages. In G. Rozenberg, A. Salomaa (eds.): Handbook of formal languages, Vol. 3. Springer 1997, 339-387
23. J. von Wright: From Kleene algebra to refinement algebra. In E. Boiten, B. Möller (eds.): Mathematics of Program Construction. Lecture Notes in Computer Science 2386. Berlin: Springer 2002, 233-262
24. J. von Wright: Towards a refinement algebra. Science of Computer Programming 51, 23-45 (2004)