1995 |
9 | | Danny De Schreye,
Kristof Verschaetse:
Deriving Linear Size Relations for Logic Programs by Abstract Interpretation.
New Generation Comput. 13(2): 117-154 (1995) |
1992 |
8 | | Danny De Schreye,
Kristof Verschaetse,
Maurice Bruynooghe:
A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns.
FGCS 1992: 481-488 |
7 | | Kristof Verschaetse,
Stefaan Decorte,
Danny De Schreye:
Automatic Termination Analysis.
LOPSTR 1992: 168-183 |
6 | | Danny De Schreye,
Kristof Verschaetse:
Tutorial on Termination of Logic Programs.
META 1992: 70-88 |
5 | | Kristof Verschaetse,
Danny De Schreye:
Deriving of Linear Size Relations by Abstract Interpretation.
PLILP 1992: 296-310 |
1991 |
4 | | Kristof Verschaetse,
Danny De Schreye:
Deriving Termination Proofs for Logic Programs, Using Abstract Procedures.
ICLP 1991: 301-315 |
1990 |
3 | | Danny De Schreye,
Kristof Verschaetse,
Maurice Bruynooghe:
A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs.
ICLP 1990: 649-663 |
2 | | Kristof Verschaetse,
Danny De Schreye,
Maurice Bruynooghe:
Generation and Compilation of Efficient Computation Rules.
ICLP 1990: 700-714 |
1989 |
1 | | Danny De Schreye,
Maurice Bruynooghe,
Kristof Verschaetse:
On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses.
Artif. Intell. 41(2): 237-248 (1989) |