1385 search results - page 41 / 277 » Natural Rewriting for General Term Rewriting Systems |
167
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
141
click to vote
JSC
2010
15 years 4 months ago
2010
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
174
click to vote
FUIN
2006
15 years 6 months ago
2006
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
161
click to vote
TACS
1994
Springer
15 years 10 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
172
Voted
ACL
2011
14 years 9 months ago
2011
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...