Termination in modal Kleene algebra

  • 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.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Jules DesharnaisGND, Bernhard MöllerGND, Georg StruthGND
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/35960
Parent Title (English):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
Place of publication:Boston [u.a.]
Editor:Jean-Jacques Lévy
Type:Part of a Book
Year of first Publication:2004
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
First Page:653
Last Page:666
Series:International Federation for Information Processing ; 155
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht