Algebraic Notions of Termination

Details Algebraic Notions of Termination Algebraic Notions of Termination

2010-12-28

arxiv.org/abs/1012.5803v3

LMCS 7 (1:1) 2011

Computer Science

Logic in Computer Science

29 pages

Scientific paper

10.2168/LMCS-7(1:1)2011

Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings, which are additively idempotent semirings with forward and backward modal operators. To model infinite behaviours, idempotent semirings are extended to divergence semirings, divergence Kleene algebras and omega algebras. The resulting notions and techniques are used in calculational proofs of classical theorems of rewriting theory. These applications show that modal semirings are powerful tools for reasoning algebraically about the finite and infinite dynamics of programs and transition systems.

Affiliated with

Also associated with

No associations

Rating

Algebraic Notions of Termination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic Notions of Termination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Notions of Termination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-428405