Loop detection in term rewriting using the eliminating unfoldings
type: Item
instance of: scholarly article
title: Loop detection in term rewriting using the eliminating unfoldings
zbMATH Open document ID: 1154.68436
author: Étienne Payet
published in: Theoretical Computer Science
publication date: 2008-09-16T00:00:00Z
full work available at URL: Loop detection in term rewriting using eliminating unfoldings.pdf
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5344352
zbMATH Keywords: term rewriting system
zbMATH Keywords: non-termination
zbMATH Keywords: loop
zbMATH Keywords: unfoldings
zbMATH Keywords: useless rule
describes a project that uses: Matchbox
describes a project that uses: MiniSat
describes a project that uses: AProVE
describes a project that uses: Tyrolean
MaRDI profile type: Publication
OpenAlex ID: W1972319677
cites work: Abstract Diagnosis of Functional Programs
cites work: Analyses of unsatisfiability for equational logic programming
cites work: Q4364365
cites work: Rules + strategies for transforming lazy functional logic programs
cites work: Q4281615
cites work: Termination of term rewriting using dependency pairs
cites work: Term Rewriting and All That
cites work: A Transformation System for Developing Recursive Programs
cites work: Narrowing directed by a graph of terms
cites work: A semantic basis for the termination analysis of logic programs
cites work: Grammar Analysis and Parsing by Abstract Interpretation
cites work: Q3917482
cites work: Termination of rewriting
cites work: Q4692463
cites work: Theory and Applications of Satisfiability Testing
cites work: Inferring Termination Conditions for Logic Programs Using Backwards Analysis
cites work: Match-bounded string rewriting systems
cites work: Non-Looping String Rewriting
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Frontiers of Combining Systems
cites work: On Proving Uniform Termination and Restricted Termination of Rewriting Systems
cites work: The integration of functions into logic programming: From theory to practice
cites work: Tyrolean termination tool: techniques and features
cites work: Foundations of equational logic programming
cites work: Semi-unification
cites work: Q3998014
cites work: cTI: a constraint-based termination inference tool for ISO-Prolog
cites work: Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
cites work: Static Analysis
cites work: A calculus of logical relations for over- and underapproximating static analyses
cites work: Q4846999
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: Counterexamples to termination for the direct sum of term rewriting systems
cites work: Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings.
cites work: Termination of string rewriting proved automatically
DOI: 10.1016/J.TCS.2008.05.013
description: scientific article; zbMATH DE number 5344352