498 search results - page 9 / 100 » Term Rewriting |
118
click to vote
RTA
2010
Springer
15 years 1 months ago
2010
Springer
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
105
click to vote
ESSLLI
2009
Springer
14 years 7 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
153
click to vote
RTA
2011
Springer
14 years 14 days 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...
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
71
Voted
RTA
2010
Springer
15 years 1 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...