Termination of just/fair computations in term rewriting
type: Item
instance of: scholarly article
title: Termination of just/fair computations in term rewriting
zbMATH Open document ID: 1146.68040
author: Salvador Lucas
author: José Meseguer
published in: Information and Computation
publication date: 2008-05-19T00:00:00Z
full work available at URL: http://hdl.handle.net/2142/11296
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68N19
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5276416
zbMATH Keywords: concurrent programming
zbMATH Keywords: fairness
zbMATH Keywords: term rewriting
zbMATH Keywords: program analysis
zbMATH Keywords: termination
describes a project that uses: TPA
describes a project that uses: Matchbox
describes a project that uses: AProVE
describes a project that uses: Tyrolean
describes a project that uses: CiME
describes a project that uses: MU-TERM
describes a project that uses: Jambox
MaRDI profile type: Publication
OpenAlex ID: W2022556237
cites work: Proving termination of context-sensitive rewriting with MU-TERM
cites work: The chemical abstract machine
cites work: A note on simplification orderings
cites work: Orderings for term-rewriting systems
cites work: Termination of rewriting
cites work: Proving operational termination of membership equational programs
cites work: Q3738540
cites work: Term Rewriting and Applications
cites work: Q4297316
cites work: Transfinite reductions in orthogonal term rewriting systems
cites work: Q4023900
cites work: TPA: Termination Proved Automatically
cites work: Frontiers of Combining Systems
cites work: Q3922147
cites work: Termination of Fair Computations in Term Rewriting
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Rewriting logic: Roadmap and bibliography
cites work: Computing in systems described by equations
cites work: Q2783416
cites work: Q3696524
cites work: Q3783524
cites work: Q4846999
cites work: Q4799892
cites work: Fair termination is decidable for ground systems
DOI: 10.1016/J.IC.2007.11.002
Recommended article: Termination of Fair Computations in Term Rewriting
Recommended article: Q3696524
Recommended article: Q3783524
Recommended article: Q3709891
Recommended article: Termination of rewriting in the Calculus of Constructions
Recommended article: Q4202962
Recommended article: Automatically disproving fair termination of higher-order functional programs
Recommended article: The termination hierarchy for term rewriting
Recommended article: Termination proofs for ground rewrite systems -- interpretations and derivational complexity
Recommended article: Q5389154
description: scientific article; zbMATH DE number 5276416