213 search results - page 5 / 43 » Automated Termination Analysis for Logic Programs with Cut |
LOPSTR
1998
Springer
15 years 1 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
LOPSTR
2004
Springer
15 years 2 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
FMOODS
2008
14 years 11 months ago
2008
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
