535 search results - page 9 / 107 » Termination of Abstract Reduction Systems |
PLDI
2004
ACM
14 years 3 months ago
2004
ACM
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
VMCAI
2012
Springer
12 years 5 months ago
2012
Springer
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
TCS
1998
13 years 9 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
CORR
2000
Springer
13 years 9 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
CAV
2012
Springer
12 years 7 days ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...