534 search results - page 5 / 107 » Proving Termination of Rewrite Systems Using Bounds |
125
click to vote
ENTCS
2008
15 years 4 months ago
2008
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
186
click to vote
WFLP
2009
Springer
15 years 10 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
157
click to vote
ESSLLI
2009
Springer
15 years 1 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
209
click to vote
RTA
2011
Springer
14 years 6 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...