Loop detection in term rewriting using the eliminating unfoldings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3729436 (Why is no real title available?)
- scientific article; zbMATH DE number 49211 (Why is no real title available?)
- scientific article; zbMATH DE number 512906 (Why is no real title available?)
- scientific article; zbMATH DE number 1088019 (Why is no real title available?)
- scientific article; zbMATH DE number 194506 (Why is no real title available?)
- scientific article; zbMATH DE number 794239 (Why is no real title available?)
- A Transformation System for Developing Recursive Programs
- A calculus of logical relations for over- and underapproximating static analyses
- A lattice-theoretical fixpoint theorem and its applications
- A semantic basis for the termination analysis of logic programs
- Abstract diagnosis of functional programs
- Analyses of unsatisfiability for equational logic programming
- Counterexamples to termination for the direct sum of term rewriting systems
- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
- Foundations of equational logic programming
- Frontiers of Combining Systems
- Grammar Analysis and Parsing by Abstract Interpretation
- Inferring termination conditions for logic programs using backwards analysis
- Logic for Programming, Artificial Intelligence, and Reasoning
- Match-bounded string rewriting systems
- Narrowing directed by a graph of terms
- Non-Looping String Rewriting
- On Proving Uniform Termination and Restricted Termination of Rewriting Systems
- Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings.
- Rules + strategies for transforming lazy functional logic programs
- Semi-unification
- Static Analysis
- Term Rewriting and All That
- Termination of rewriting
- Termination of string rewriting proved automatically
- Termination of term rewriting using dependency pairs
- The integration of functions into logic programming: From theory to practice
- Theory and Applications of Satisfiability Testing
- Tyrolean termination tool: techniques and features
- cTI: a constraint-based termination inference tool for ISO-Prolog
Cited in
(9)- Loop Elimination, a Sound Optimisation Technique for PTTP Related Theorem Proving
- A non-termination criterion for binary constraint logic programs
- Loops under Strategies
- Loop detection by logically constrained term rewriting
- Guided unfoldings for finding loops in standard term rewriting
- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
- scientific article; zbMATH DE number 4035120 (Why is no real title available?)
- Non-termination in Term Rewriting and Logic Programming
- Lower bounds for runtime complexity of term rewriting
This page was built for publication: Loop detection in term rewriting using the eliminating unfoldings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944383)
