139 search results - page 2 / 28 » Automated Termination Proofs for Logic Programs by Term Rewr... |
ALP
1994
Springer
15 years 1 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
CAV
2012
Springer
13 years 5 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...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
154
click to vote
RTA
2011
Springer
14 years 17 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...
TOPLAS
2011
14 years 4 months ago
2011