Termination of Fair Computations in Term Rewriting

DOI10.1007/11591191_14zbMATH Open1143.68491OpenAlexW170274440MaRDI QIDQ5387839

Salvador Lucas, J. Meseguer

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11591191_14

zbMATH Keywords

fairnessprogram analysisterminationterm rewritingConcurrent programming

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

A proof rule for fair termination of guarded commands ⋮ Termination of just/fair computations in term rewriting ⋮ Unnamed Item ⋮ Fair termination revisited - with delay

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Termination of just/fair computations in term rewriting 👍 👎
• Automatically disproving fair termination of higher-order functional programs 👍 👎
• On the Computational Content of Termination Proofs 👍 👎
• Termination of rewriting in the Calculus of Constructions 👍 👎
• The termination hierarchy for term rewriting 👍 👎
• Termination proofs for ground rewrite systems -- interpretations and derivational complexity 👍 👎

This page was built for publication: Termination of Fair Computations in Term Rewriting