Frontiers of Combining Systems

DOI10.1007/11559306MaRDI QIDQ5491902zbMATH OpenOpenAlexFDO

Authors Adam Koprowski, Hans Zantema

Publication date 10 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2043538
• Termination of Fair Computations in Term Rewriting
• Termination of just/fair computations in term rewriting
• Simulating liveness by reduction strategies
• Liveness verification in TRSs using tree automata and termination analysis

Cited in

(9)

• Relative termination via dependency pairs
• Simulating liveness by reduction strategies
• Liveness verification in TRSs using tree automata and termination analysis
• Reducing relative termination to dependency pair problems
• scientific article; zbMATH DE number 2043538 (Why is no real title available?)
• Proving Liveness by Backwards Reachability
• Proving liveness of fair transition systems
• A dependency pair framework for relative termination of term rewriting
• Termination of just/fair computations in term rewriting

This page was built for publication: Frontiers of Combining Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491902)