Conference Papers Year : 2015

A Completion Method to Decide Reachability in Rewrite Systems

Abstract

The Knuth-Bendix method takes in argument a finite set of equations and rewrite rules and, when it succeeds, returns an algorithm to decide if a term is equivalent to another modulo these equations and rules. In this paper, we design a similar method that takes in argument a finite set of rewrite rules and, when it succeeds, returns an algorithm to decide not equivalence but reachability modulo these rules, that is if a term reduces to another. As an application, we give new proofs of the decidability of reachability in finite ground rewrite systems and in pushdown systems.
Fichier principal
Vignette du fichier
pkb.pdf (238.89 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01252138 , version 1 (07-01-2016)

Identifiers

Cite

Guillaume Burel, Gilles Dowek, Ying Jiang. A Completion Method to Decide Reachability in Rewrite Systems. International Symposium on Frontiers of Combining Systems FroCoS'15, Sep 2015, Wroclaw, Poland. pp.205-219, ⟨10.1007/978-3-319-24246-0_13⟩. ⟨hal-01252138⟩
120 View
149 Download

Altmetric

Share

More