swMATH9767MaRDI QIDQ21746FDOQ21746
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007%2F978-3-642-22438-6_38
Cited In (39)
- WANDA
- Title not available (Why is that?)
- Nominal confluence tool
- Ground confluence of order-sorted conditional specifications modulo axioms
- Confluence of non-left-linear TRSs via relative termination
- Deciding confluence and normal form properties of ground term rewrite systems efficiently
- CSI -- a confluence tool
- Conditions for confluence of innermost terminating term rewriting systems
- Disproving confluence of term rewriting systems by interpretation and ordering
- De Bruijn's weak diamond property revisited
- Certified rule labeling
- Datatype defining rewrite systems for naturals and integers
- Ground confluence prover based on rewriting induction
- Certifying confluence proofs via relative termination and rule labeling
- Certification of classical confluence results for left-linear term rewrite systems
- CeTA
- Tyrolean
- CRC 3
- CoLoR
- CiME
- IsaFoR
- Saigawa
- Conditional Confluence
- CoLL
- ConCon
- Nagoya Termination Tool
- CoCoWeb
- CO3
- Cops
- Decreasing Diagrams
- FORT
- Decreasing Diagrams II
- Well Quasi Orders
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
- Labelings for decreasing diagrams
- Conditional confluence (system description)
- CoLL: a confluence tool for left-linear term rewrite systems
- Reachability, confluence, and termination analysis with state-compatible automata
- Layer systems for proving confluence
This page was built for software: CSI
