18 search results - page 2 / 4 » Quasi-terminating logic programs for ensuring the terminatio... |
WFLP
2009
Springer
14 years 5 days ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
LOPSTR
2004
Springer
13 years 11 months ago
2004
Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
WLP
1997
Springer
13 years 9 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
ESOP
2010
Springer
14 years 2 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
LOPSTR
2007
Springer
13 years 11 months ago
2007
Springer
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...