A dependency pair framework for relative termination of term rewriting
From MaRDI portal
Cites work
- Analysing parallel complexity of term rewriting
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Automated Complexity Analysis Based on the Dependency Pair Method
- Automating the dependency pair method
- Certifying confluence proofs via relative termination and rule labeling
- Complexity analysis for term rewriting by integer transition systems
- Confluence of non-left-linear TRSs via relative termination
- Decreasing diagrams and relative termination
- Frontiers of Combining Systems
- Goal-directed and relative dependency pairs for proving the termination of narrowing
- scientific article; zbMATH DE number 1722701 (Why is no real title available?)
- Logic for Programming, Artificial Intelligence, and Reasoning
- Lower bounds for runtime complexity of term rewriting
- Mechanizing and improving dependency pairs
- Modular complexity analysis for term rewriting
- mu-term: Verify Termination Properties Automatically (System Description)
- Nagoya termination tool
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- Relative termination via dependency pairs
- Sparse tiling through overlap closures for termination of string rewriting
- Term Rewriting and All That
- Termination of Narrowing in Left-Linear Constructor Systems
- Termination of narrowing via termination of rewriting
- Termination of rewriting
- Termination of term rewriting using dependency pairs
- Transforming derivational complexity of term rewriting to runtime complexity
- Tyrolean termination tool: techniques and features
This page was built for publication: A dependency pair framework for relative termination of term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034581)
