swMATH10064MaRDI QIDQ22033FDOQ22033
Author name not available (Why is that?)
Official website: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.9381
Cited In (22)
- Twenty years of rewriting logic
- Proving operational termination of membership equational programs
- Proving weak properties of rewriting
- Theoretical Aspects of Computing - ICTAC 2004
- Term Rewriting and Applications
- Orderings and Constraints: Theory and Practice of Proving Termination
- Mechanically proving termination using polynomial interpretations
- Automated Reasoning
- 2OBJ
- K-Maude
- SCC
- MU-TERM
- VMTL
- TORPA
- Tsukuba
- SymPLFIED
- Outermost ground termination
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- The size-change principle and dependency pairs for termination of term rewriting
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
- From Outermost to Context-Sensitive Rewriting
This page was built for software: CARIBOO
