103 search results - page 14 / 21 » Polygraphs for termination of left-linear term rewriting sys... |
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
ENTCS
2008
14 years 9 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
82
Voted
CONCUR
2003
Springer
15 years 2 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
66
Voted
FROCOS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...