Algebraic Notions of Termination

DOI10.2168/LMCS-7(1:1)2011zbMath1214.68185arXiv1012.5803MaRDI QIDQ3003302

Georg Struth, Jules Desharnais, Bernhard Möller

Publication date: 26 May 2011

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.5803

zbMATH Keywords

program analysisidempotent semiringsrewriting theoryKleene algebrasmodal operatorsprogram terminationNoetheritydivergence semiringsomega algebraswellfoundedness

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

Taming Multirelations ⋮ Normal design algebra ⋮ Algebraic coherent confluence and higher globular Kleene algebras ⋮ Abstract representation theorems for demonic refinement algebras ⋮ Algebraic notions of nontermination: Omega and divergence in idempotent semirings ⋮ Left omega algebras and regular equations ⋮ On the Structure of Demonic Refinement Algebras with Enabledness and Termination ⋮ Reactive Probabilistic Programs and Refinement Algebra ⋮ Hopscotch -- reaching the target hop by hop ⋮ Geographic wayfinders and space-time algebra ⋮ Relational characterisations of paths ⋮ Enabledness and termination in refinement algebra ⋮ Algebras for iteration and infinite computations

Uses Software

• Z

This page was built for publication: Algebraic Notions of Termination