209 search results - page 34 / 42 » Termination of Priority Rewriting |
103
click to vote
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
101
click to vote
VTC
2007
IEEE
15 years 6 months ago
2007
IEEE
Energy is a major concern in ad hoc networks as it dictates the lifetime of a terminal and consequently the whole network. In an ad hoc network, not all terminals are equally sol...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
ERSHOV
1999
Springer
15 years 4 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
182
click to vote
POPL
2007
ACM
15 years 12 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...