113 search results - page 5 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
PPDP
2004
Springer
15 years 2 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
ACL
2011
14 years 1 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...
85
Voted
WADT
1998
Springer
15 years 1 months ago
1998
Springer
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
80
Voted
RTA
2009
Springer
15 years 4 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
65
Voted
VIROLOGY
2008
14 years 9 months ago
2008
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...