TY  - CHAP
A1  - Desharnais, Jules
A1  - Möller, Bernhard
A1  - Struth, Georg
A2  - Lévy, Jean-Jacques
T1  - Termination in modal Kleene algebra
T2  - Exploring new frontiers of theoretical informatics: IFIP 18th World Computer Congress; TC1 3rd International Conference on Theoretical Computer Science (TCS2004); 22 - 27 August 2004, Toulouse, France: WCC 2004
N2  - Modal Kleene algebras are Kleene algebras with forward and backward modal operators defined via domain and codomain operations. The paper investigates the algebraic structure of modal operators. It studies and compares different notions of termination in this class, including an algebraic correspondence proof of Löb's formula from modal logic. It gives calculational proofs of two fundamental statements from rewriting theory that involve termination: Bachmair's and Dershowitz's well-founded union theorem and Newman's lemma. These results are also of general interest for the termination analysis of programs and state transition systems.
Y1  - 2004
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/35960
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-359609
SN  - 1-4020-8140-5
SP  - 653
EP  - 666
PB  - Kluwer
CY  - Boston [u.a.]
ER  -