1385 search results - page 5 / 277 » Natural Rewriting for General Term Rewriting Systems |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
107
click to vote
PLILP
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
PLILP
1998
Springer
15 years 1 months ago
1998
Springer
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
ENTCS
2007
14 years 9 months ago
2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...