Termination of just/fair computations in term rewriting

DOI10.1016/j.ic.2007.11.002zbMath1146.68040OpenAlexW2022556237MaRDI QIDQ924727

José Meseguer, Salvador Lucas

Publication date: 19 May 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2142/11296

zbMATH Keywords

fairnessprogram analysisterminationterm rewritingconcurrent programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (1)

Twenty years of rewriting logic

Uses Software

• Tyrolean
• AProVE
• CiME
• MU-TERM
• Jambox
• TPA
• Matchbox

Cites Work

• Orderings for term-rewriting systems
• Termination of rewriting
• Computing in systems described by equations
• A note on simplification orderings
• Conditional rewriting logic as a unified model of concurrency
• The chemical abstract machine
• Rewriting logic: Roadmap and bibliography
• Transfinite reductions in orthogonal term rewriting systems
• Proving operational termination of membership equational programs
• Proving Termination of Context-Sensitive Rewriting with MU-TERM
• TPA: Termination Proved Automatically
• Fair termination is decidable for ground systems
• Termination of Fair Computations in Term Rewriting
• Frontiers of Combining Systems
• Term Rewriting and Applications
• Term Rewriting and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination of just/fair computations in term rewriting