Modal kleene algebra and partial correctness

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

Volumn 3116, Issue , 2004, Pages 379-393

  Möller, Bernhard ^a   Struth, Georg ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; FORMAL LOGIC; SEMANTICS; SOFTWARE ENGINEERING;

FORWARD-AND-BACKWARD; FREE STYLE; GALOIS CONNECTION; HOARE LOGIC; KLEENE ALGEBRAS; PARTIAL CORRECTNESS; SEMIRINGS; SOUNDNESS AND COMPLETENESS;

ALGEBRA;

EID: 35048851020     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27815-3_30     Document Type: Article

References (22)

1. K.-R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Springer, 2nd edition, 1997.
2. K. Clenaghan. Calculational graph algorithmics: Reconciling two approaches with dynamic algebra. Technical Report CS-R9518, CWI, Amsterdam, 1994.
3. E. Cohen. Separation and reduction. In R. Backhouse and J. N. Oliveira, editors, Proc. of Mathematics of Program Construction, 5th International Conference, MPC 2000, volume 1837 of LNCS, pages 45-59. Springer, 2000.
4. J. Desharnais, B. Möller, and G. Struth. Kleenc algebra with domain. Technical Report 2003-07, Universität Augsburg, Institut für Informatik, 2003.
5. J. Desharnais, B. Möller, and G. Struth. Applications of modal Kleene algebra - a survey. Technical Report DIUL-RR-0401, Département d'informatique et de génie logiciel, Université Lavai, Québec, 2004.
6. J. Desharnais, B. Möller, and G. Struth. Termination in modal Kleene algebra. Technical Report 2004-04, Universität Augsburg, Institut für Informatik, 2004.
7. T. Ehm, B. Möller, and G. Struth. Kleene modules. In R. Berghammer and B. Möller, editors, Proc. 7th Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, volume 3051 of LNCS. Springer, 2004. (to appear).
8. J. M. Fischer and R. F. Ladner. Prepositional dynamic logic of regular programs. J. Comput. System Sci., 18(2):194-211, 1979.
9. C. Hardin and D. Kozen. On the elimination of hypotheses in Kleene algebra with tests. Technical Report 2002-1879, Computer Science Department, Cornell University, October 2002.
10. B. Jónsson and A. Tarski. Boolean algebras with operators, Part I. American Journal of Mathematics, 73:891-939, 1951.
11. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366-390, 1994.
12. D. Kozen. Kleene algebra with tests. Trans. Programming Languages and Systems, 19(3):427-443, 1997.
13. D. Kozen. On Hoare logic and Kleene algebra with tests. Trans. Computational Logic, 1(1):60-76, 2001.
14. D. Kozen and M.-C. Patron. Certification of compiler optimizations using Kleene algebra with tests. In J. Lloyd, editor, 1st International Conference on Computational Logic, volume 1861 of LNCS, pages 568-582. Springer, 2000.
15. J. Loeckx and K. Sieber. The Foundations of Program Verification. Wiley Teubner, 2nd edition, 1987.
16. B. Möller. Lazy Kleene algebra. In D. Kozen, editor, Proc. of Mathematics of Program Construction, 7th International Conference, MPC 2004, LNCS. Springer, 2004. (to appear). Preliminary version: Report No. 2003-17, Institut für Informatik, Universität Augsburg, December 2003.
17. B. Möller and G. Struth. Modal Kleene algebra and partial correctness. Technical Report 2003-08, Universität Augsburg, Institut für Informatik, 2003.
18. B. Möller and G. Struth. Greedy-like algorithms in modal Kleene algebra. In R. Berghammer and B. Möller, editors, Proc. 7th Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, volume 3051 of LNCS. Springer, 2004. (to appear).
19. G. W. Schmidt and T. Ströhlein. Relations and Graphs: Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer, 1993.
20. G. Struth. Calculating Church-Rosser proofs in Kleene algebra. In H.C.M. de Swart, editor, Relational Methods in Computer Science, 6th International Conference, volume2561 of LNCS, pages 276-290. Springer, 2002.
21. B. von Karger. Temporal algebra. Mathematical Structures in Computer Science, 8(3):277-320, 1998.
22. J. von Wright. From Kleene algebra to refinement algebra. In B. Möller and E. Boiten, editors, Mathematics of Program Construction, 6th International Conference, MPC 2002, volume 2386 of LNCS, pages 233-262. Springer, 2002.