| Co-design and refinement for safety critical systems | 4 | 0.50 | 2004 |
| BHDL: circuit design in B | 6 | 0.66 | 2003 |
| Generalized Definite Set Constraints | 8 | 0.59 | 2000 |
| Co-definite set constraints with membership expressions | 7 | 0.46 | 1998 |
| Source-to-source Prolog program compression | 0 | 0.34 | 1998 |
| Solving Classes of Set Constraints with Tree Automata | 18 | 0.91 | 1997 |
| Set-Based Analysis for Logic Programming and Tree Automata | 11 | 0.56 | 1997 |
| Smallest horn clause programs | 5 | 0.57 | 1996 |
| One Binary Horn Clause is Enough | 3 | 0.40 | 1994 |
| The emptiness problem of one binary recursive horn clause is undecidable | 4 | 0.46 | 1993 |
| Weighted systems of equations | 2 | 0.54 | 1993 |
| Halting Problem of One Binary Horn Clause is Undecidable | 21 | 1.27 | 1993 |
| Termination induction by means of an abstract OLDT resolution | 1 | 0.37 | 1992 |
| Weighted Systems Revisited | 0 | 0.34 | 1992 |
| JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France | 27 | 8.29 | 1992 |
| Towards Optimization of Full Prolog Programs guided by Abstract Interpretation. | 0 | 0.34 | 1992 |
| Prolog Program Transformations and Meta-Interpreters | 1 | 0.37 | 1991 |
| Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite | 0 | 0.34 | 1991 |
| Abstract Interpretation and Recursive Behaviour of Logic Programs | 1 | 0.37 | 1991 |
| Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs | 0 | 0.34 | 1991 |
| Weighted graphs: a tool for studying the halting problem and time complexity in term rewriting systems and logic programming | 8 | 1.35 | 1990 |
| WEIGHTED GRAPHS, A Tool for Expressing the Behavious of Recursive Rules in Logic Programming | 4 | 0.58 | 1988 |
