Termination of term rewriting using dependency pairs
From MaRDI portal
Publication:1978641
Recommendations
Cites work
- scientific article; zbMATH DE number 4047065 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 3729436 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1142319 (Why is no real title available?)
- scientific article; zbMATH DE number 1761896 (Why is no real title available?)
- scientific article; zbMATH DE number 1380897 (Why is no real title available?)
- scientific article; zbMATH DE number 794237 (Why is no real title available?)
- scientific article; zbMATH DE number 794239 (Why is no real title available?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Automatic termination proofs with transformation orderings
- Automating the Knuth Bendix ordering
- Counterexamples to termination for the direct sum of term rewriting systems
- Dummy elimination: Making termination easier
- Generating polynomial orderings
- Generating polynomial orderings for termination proofs
- Modular proofs for completeness of hierarchical term rewriting systems
- Natural termination
- On proving termination by innermost termination
- Orderings for term-rewriting systems
- Proving innermost normalisation automatically
- Proving termination of (conditional) rewrite systems. A semantic approach
- Pushing the frontiers of combining rewrite systems farther outwards
- Rewriting techniques and applications. 9th international conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998. Proceedings
- Simple termination of rewrite systems
- Termination by absence of infinite chains of dependency pairs
- Termination by completion
- Termination of constructor systems
- Termination of nested and mutually recursive algorithms
- Termination of rewriting
- Termination of rewriting systems by polynomial interpretations and its implementation
- Termination of term rewriting using dependency pairs
- Termination of term rewriting: Interpretation and type elimination
Cited in
(only showing first 100 items - show all)- Signature extensions preserve termination. An alternative proof via dependency pairs
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- A distribution semantics for probabilistic term rewriting
- Proving termination properties with \textsc{mu-term}
- Real or natural number interpretation and their effect on complexity
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
- Proving innermost normalisation automatically
- Termination of Narrowing in Left-Linear Constructor Systems
- Match-bounds revisited
- scientific article; zbMATH DE number 7559275 (Why is no real title available?)
- All-Termination(T)
- Total termination of term rewriting
- Tuple interpretations for termination of term rewriting
- Multi-dimensional interpretations for termination of term rewriting
- On proving \(C_E\)-termination of rewriting by size-change termination
- Relaxing monotonicity for innermost termination
- Towards a systematic method for proving termination of graph transformation systems
- Analysing parallel complexity of term rewriting
- scientific article; zbMATH DE number 1765702 (Why is no real title available?)
- mu-term: Verify Termination Properties Automatically (System Description)
- Linear termination is undecidable
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- A combination framework for complexity
- Increasing Interpretations
- Harnessing first order termination provers using higher order dependency pairs
- Automatic Termination
- Term orderings for non-reachability of (conditional) rewriting
- The Computability Path Ordering: The End of a Quest
- Uncurrying for termination and complexity
- Complexity of Fractran and Productivity
- Effectively Checking the Finite Variant Property
- Pattern eliminating transformations
- Proving termination of context-sensitive rewriting with MU-TERM
- Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- Automating the dependency pair method
- Termination checking with types
- Using well-founded relations for proving operational termination
- Termination of narrowing via termination of rewriting
- Transforming termination by self-labelling
- Certification of Termination Proofs Using CeTA
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Termination of graph transformation systems using weighted subgraph counting
- Termination of narrowing revisited
- Operational semantics of resolution and productivity in Horn clause logic
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Normalization of Infinite Terms
- Reducing relative termination to dependency pair problems
- The Derivational Complexity Induced by the Dependency Pair Method
- Degrees of Undecidability in Term Rewriting
- Beyond Dependency Graphs
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Dependency triples for improving termination analysis of logic programs with cut
- Hierarchical termination revisited.
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- Proving termination by dependency pairs and inductive theorem proving
- Logic for Programming, Artificial Intelligence, and Reasoning
- Automating the dependency pair method.
- Linear integer arithmetic revisited
- Polynomials over the reals in proofs of termination : from theory to practice
- Proving termination of context-sensitive rewriting by transformation
- A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems
- Determinization of conditional term rewriting systems
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Search Techniques for Rational Polynomial Orders
- Size-based termination of higher-order rewriting
- Argument filterings and usable rules for simply typed dependency pairs
- Use of logical models for proving infeasibility in term rewriting
- Root-Labeling
- Transforming SAT into termination of rewriting
- Certifying a Termination Criterion Based on Graphs, without Graphs
- Right-linear half-monadic term rewrite systems
- Relative termination via dependency pairs
- KBO orientability
- scientific article; zbMATH DE number 3921958 (Why is no real title available?)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Mechanically proving termination using polynomial interpretations
- On normalizing, non-terminating one-rule string rewriting systems
- Verifying termination and reduction properties about higher-order logic programs
- Termination by absence of infinite chains of dependency pairs
- Termination of dependently typed rewrite rules
- Applications and extensions of context-sensitive rewriting
- Elimination transformations for associative-commutative rewriting systems
- An integrated framework for the diagnosis and correction of rule-based programs
- Termination of Narrowing Using Dependency Pairs
- A dependency pair framework for relative termination of term rewriting
- Generating priority rewrite systems for OSOS process languages
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
- Improving dependency pairs
- Modular termination proofs for rewriting using dependency pairs
- Deciding Innermost Loops
- Modular Termination of Basic Narrowing
- A dependency pair framework for innermost complexity analysis of term rewrite systems
- Dependency Pairs for Rewriting with Non-free Constructors
- Termination of term rewriting using dependency pairs
- Higher-order constrained dependency pairs for (universal) computability
- On complexity bounds and confluence of parallel term rewriting
This page was built for publication: Termination of term rewriting using dependency pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978641)
