Algebraic notions of termination

Logical Methods in Computer Science

Volumn 7, Issue 1, 2011, Pages

  Desharnais, Jules ^a   Möller, Bernhard ^b   Struth, Georg ^c  

^a Pavillon Adrien Pouliot   (Canada)

^b UNIVERSITY OF AUGSBURG   (Germany)

^c UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Divergence semirings; Idempotent semirings; Kleene algebras; Modal operators; Noetherity; Omega algebras; Program analysis; Program termination; Rewriting theory; Wellfoundedness

Indexed keywords

APPLICATION PROGRAMS; ITERATIVE METHODS;

IDEMPOTENT SEMIRINGS; KLEENE ALGEBRAS; MODAL OPERATORS; NOETHERITY; PROGRAM ANALYSIS; PROGRAM TERMINATION; REWRITING THEORY; SEMIRINGS; WELL-FOUNDEDNESS;

ALGEBRA;

EID: 79955444721     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-7(1:1)2011     Document Type: Article

References (35)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. L. Bachmair and N. Dershowitz. Commutation, transformation, and termination. In J. H. Siekmann, editor, 8th International Conference on Automated Deduction, volume 230 of Lecture Notes in Computer Science, pages 5-20. Springer, 1986.
3. R. Backhouse. Galois connections and fixed point calculus. In R. Backhouse, R. Crole, and J. Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of Lecture Notes in Computer Science, pages 89-148. Springer, 2002.
4. R. Backhouse et al. Fixed point calculus. Information Processing Letters, 53:31-136, 1995.
5. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
6. B. F. Chellas. Modal Logic: An Introduction. Cambridge University Press, 1980.
7. E. Cohen. Separation and reduction. In R. Backhouse and J. N. Oliveira, editors, 5th International Conference on Mathematics of Program Construction, MPC 2000, volume 1837 of Lecture Notes in Computer Science, pages 45-59. Springer, 2000.
8. J. Desharnais, B. Möller, and G. Struth. Modal Kleene algebra and applications-a survey. Journal on Relational Methods in Computer Science, 1:93-131, 2004.
9. J. Desharnais, B. Möller, and G. Struth. Termination in modal Kleene algebra. In J.-J. Levy, E. W. Mayr, and J. C. Mitchell, editors, 3rd International Conference on Theoretical Computer Science, pages 647-660. Kluwer, 2004.
10. J. Desharnais, B. Möller, and G. Struth. Kleene algebra with domain. ACM Transactions on Computational Logic, 7:798-833, 2006.
11. E.W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
12. H. Doornbos, R. C. Backhouse, and J. van der Woude. A calculational approach to mathematical induction. Theoretical Computer Science, 179:103-135, 1997.
13. rd IEEE workshop on Visual Languages and Formal Methods (VLFM'04), volume 127 of Electronic Notes in Theoretical Computer Science, pages 87-105. Elsevier, 2005.
14. T. Ehm, B. Möller, and G. Struth. Kleene modules. In R. Berghammer, B. Möller, and G. Struth, editors, Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Germany, May 12-17, 2003, Revised Selected Papers, volume 3051 of Lecture Notes in Computer Science, pages 112-124. Springer, 2004.
15. R. Goldblatt. An algebraic study of well-foundedness. Studia Logica, 44(4):422-437, 1985.
16. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
17. P. Höfner and G. Struth. Automated reasoning in Kleene algebra. In F. Pfenning, editor, CADE 2007, volume 4603 of Lecture Notes in Artificial Intelligence, pages 279-294. Springer, 2007.
18. D. Jackson. Software Abstractions. The MIT Press, 2006.
19. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366-390, 1994.
20. D. Kozen. Kleene algebra with tests. ACM Transactions on Programming Languages and Systems, 19(3):427-443, 1997.
21. A. Melton, D.A. Schmidt, and G.E. Strecker. Galois connections and computer science applications. In D. Pitt, S. Abramsky, A. Poigné, and D. Rydeheard, editors, Category Theory and Computer Programming, volume 240 of Lecture Notes in Computer Science, pages 299-312. Springer, 1986.
22. B. Möller. Lazy Kleene algebra. In D. Kozen, editor, Mathematics of Program Construction, volume 3125 of Lecture Notes in Computer Science, pages 252-273. Springer, 2004. Revised version: B. Möller. Kleene getting lazy. Science of Computer Programming 65, 195-214 (2007).
23. B. Möller, P. Höfner, and G. Struth. Quantales and temporal logics. In M. Johnson and V. Vene, editors, Algebraic Methodology and Software Technology (AMAST 2006), volume 4019 of Lecture Notes in Computer Science, pages 263-277. Springer, 2006.
24. B. Möller and G. Struth. Algebras of modal operators and partial correctness. Theoretical Computer Science, 351:221-239, 2006.
25. B. Möller and G. Struth. wp is wlp. In W. MacCaull, M. Winter, and I. D̈untsch, editors, Relational Methods in Computer Science, volume 3929 of Lecture Notes in Computer Science, pages 200-211. Springer, 2006.
26. G. Nelson. A generalization of Dijkstra's calculus. ACM Transactions on Programming Languages and Systems, 11:517-561, 1989.
27. G. Schmidt and T. Ströhlein. Relations and Graphs: Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer, 1993.
28. M. Spivey. The Z notation: A reference manual. International Series in Computer Science. Prentice Hall, 1992. Available under http://spivey.oriel.ox.ac.uk/~mike/zrm/.
29. G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut f̈ur Informatik, 1996.
30. G. Struth. Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis, Institut für Informatik, Universiẗat des Saarlandes, Germany, 1998.
31. G. Struth. Calculating Church-Rosser proofs in Kleene algebra. In H.C.M. de Swart, editor, Relational Methods in Computer Science, 6th International Conference, volume 2561 of Lecture Notes in Computer Science, pages 276-290. Springer, 2002.
32. G. Struth. Abstract abstract reduction. Journal of Logic and Algebraic Programming, 66(2):239-270, 2006.
33. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
34. Terese, editor. Term Rewriting Systems. Cambridge University Press, 2003.
35. th International Conference on Mathematics of Program Construction, MPC 2002, volume 2386 of Lecture Notes in Computer Science, pages 233-262. Springer, 2002.