172 search results - page 10 / 35 » Automatic Termination Analysis of Logic Programs |
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...
80
Voted
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...
113
click to vote
CSFW
1999
IEEE
15 years 1 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
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...