882 search results - page 38 / 177 » A Taste of Rewrite Systems |
130
click to vote
ALP
1994
Springer
15 years 7 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
159
click to vote
PLILP
1994
Springer
15 years 7 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...
118
click to vote
JAR
2006
15 years 3 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
145
Voted
NAACL
2010
15 years 1 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
133
click to vote
ATVA
2008
Springer
15 years 5 months ago
2008
Springer
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...