Proving weak properties of rewriting
type: Item
instance of: scholarly article
title: Proving weak properties of rewriting
zbMATH Open document ID: 1234.68178
author: Isabelle Gnaedig
author: Hélène Kirchner
published in: Theoretical Computer Science
publication date: 2011-07-29T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5934197
zbMATH Keywords: abstraction
zbMATH Keywords: completeness
zbMATH Keywords: induction
zbMATH Keywords: rewriting
zbMATH Keywords: narrowing
zbMATH Keywords: weak termination
describes a project that uses: ELAN
describes a project that uses: CARIBOO
describes a project that uses: Maude
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.04.028
OpenAlex ID: W2083907114
cites work: Maude: specification and programming in rewriting logic
cites work: Q4417783
cites work: Induction for termination with local strategies
cites work: Outermost ground termination
cites work: Termination of rewriting under strategies
cites work: Theoretical Aspects of Computing - ICTAC 2004
cites work: Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
cites work: Q4255514
cites work: On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
cites work: Q4246947
cites work: Q4783327
cites work: Inductionless induction
cites work: Proofs by induction in equational theories with constructors
cites work: Q3956381
cites work: Q3690200
cites work: Q3783519
cites work: Q3785921
cites work: Automatic proofs by induction in theories without constructors
cites work: Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
cites work: Using induction and rewriting to verify and complete parameterized specifications
cites work: Sufficient completeness verification for conditional and constrained TRS
cites work: Semantic confluence tests and completion methods
cites work: On sufficient-completeness and related properties of term rewriting systems
cites work: Testing for the ground (co-)reducibility property in term-rewriting systems
cites work: Encompassment properties and automata with constraints
cites work: Ground reducibility is EXPTIME-complete
cites work: Rewriting
cites work: Q4799892
cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
cites work: Completeness results for basic narrowing
cites work: Proving innermost normalisation automatically
cites work: Q3408137
DOI: 10.1016/J.TCS.2011.04.028
description: scientific article; zbMATH DE number 5934197