172 search results - page 5 / 35 » Automatic Termination Analysis of Logic Programs |
164
Voted
CADE
2011
Springer
13 years 9 months ago
2011
Springer
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
152
Voted
RTA
2011
Springer
14 years 7 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
1999
Springer
15 years 1 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...