Reachability analysis over term rewriting systems
type: Item
instance of: scholarly article
title: Reachability analysis over term rewriting systems
zbMATH Open document ID: 1075.68038
author: Guillaume Feuillade
author: Thomas Genet
author: Valérie Viet Triem Tong
published in: Journal of Automated Reasoning
publication date: 2005-06-22T00:00:00Z
full work available at URL: RR-4970.pdf
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2177898
zbMATH Keywords: completion algorithm
zbMATH Keywords: reachability analysis
zbMATH Keywords: term rewriting
zbMATH Keywords: Timbuk
zbMATH Keywords: tree automaton
describes a project that uses: OCaml
describes a project that uses: Isabelle/HOL
describes a project that uses: ELAN
describes a project that uses: Timbuk
MaRDI profile type: Publication
OpenAlex ID: W2088129830
cites work: Term Rewriting and All That
cites work: Q4223001
cites work: Tree generating regular systems
cites work: Q3785921
cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
cites work: Q3819993
cites work: Reachability in Conditional Term Rewriting Systems
cites work: Q2723425
cites work: Reachability Analysis of Term Rewriting Systems with Timbuk
cites work: Q4847003
cites work: Linear generalized semi-monadic rewrite systems effectively preserve recognizability
cites work: On sufficient-completeness and related properties of term rewriting systems
cites work: Q5581665
cites work: Q3690200
cites work: Isabelle/HOL. A proof assistant for higher-order logic
cites work: Q3956381
cites work: Q4938423
cites work: Q4808743
cites work: Deterministic tree pushdown automata and monadic tree rewriting systems
cites work: Q4808741
cites work: Q2723905
DOI: 10.1007/S10817-004-6246-0
Recommended article: Reachability Analysis of Term Rewriting Systems with Timbuk
Recommended article: Reachability Analysis for Termination and Confluence of Rewriting
Recommended article: Reachability in Conditional Term Rewriting Systems
Recommended article: Q5277878
Recommended article: Q2980977
Recommended article: Complexity analysis of term-rewriting systems
Recommended article: Q3780429
Recommended article: Proving Termination of Rewrite Systems Using Bounds
Recommended article: Q4871682
Recommended article: A coinductive approach to proving reachability properties in logically constrained term rewriting systems
description: scientific article; zbMATH DE number 2177898