283
click to vote
RTA
14 years 10 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...
224
click to vote
RTA
14 years 10 months ago
2011 Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
|
Theoretical Computer Science