| 2004 |
|---|
| 25 | EE | Ammar Aljer,
Philippe Devienne:
Co-Design and Refinement for Safety Critical Systems.
DFT 2004: 78-86 |
| 2003 |
|---|
| 24 | EE | Ammar Aljer,
Philippe Devienne,
Sophie Tison,
Jean-Louis Boulanger,
Georges Mariano:
BHDL: Circuit Design in B.
ACSD 2003: 241-242 |
| 2000 |
|---|
| 23 | | Jean-Marc Talbot,
Philippe Devienne,
Sophie Tison:
Generalized Definite Set Constraints.
Constraints 5(1/2): 161-202 (2000) |
| 1998 |
|---|
| 22 | | Philippe Devienne,
Anne Parrain,
Patrick Taillibert,
S. Varennes:
Source-to-source Prolog Program Compression.
IJCSLP 1998: 205-219 |
| 21 | | Philippe Devienne,
Jean-Marc Talbot,
Sophie Tison:
Co-definite Set Constraints with Membership Expressions.
IJCSLP 1998: 25-39 |
| 1997 |
|---|
| 20 | | Philippe Devienne,
Jean-Marc Talbot,
Sophie Tison:
Solving Classes of Set Constraints with Tree Automata.
CP 1997: 62-76 |
| 19 | | Jean-Marc Talbot,
Sophie Tison,
Philippe Devienne:
Set-Based Analysis for Logic Programming and Tree Automata.
SAS 1997: 127-140 |
| 1996 |
|---|
| 18 | | Philippe Devienne,
Patrick Lebègue,
Anne Parrain,
Jean-Christophe Routier,
Jörg Würtz:
Smallest Horn Clause Programs.
J. Log. Program. 27(3): 227-267 (1996) |
| 1994 |
|---|
| 17 | | Philippe Devienne,
Patrick Lebègue,
Jean-Christophe Routier,
Jörg Würtz:
One Binary Horn Clause is Enough.
STACS 1994: 21-32 |
| 1993 |
|---|
| 16 | | Philippe Devienne,
Patrick Lebègue,
Jean-Christophe Routier:
The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable.
ILPS 1993: 250-265 |
| 15 | | Philippe Devienne,
Patrick Lebègue,
Jean-Christophe Routier:
Halting Problem of One Binary Horn Clause is Undecidable.
STACS 1993: 48-57 |
| 14 | | Philippe Devienne,
Patrick Lebègue,
Max Dauchet:
Weighted Systems of Equations.
Theor. Comput. Sci. 119(1): 39-62 (1993) |
| 1992 |
|---|
| 13 | | Jean-Paul Delahaye,
Philippe Devienne,
Philippe Mathieu,
Pascal Yim:
JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France
JFPL 1992 |
| 12 | | Christophe Lecoutre,
Philippe Devienne,
Patrick Lebègue:
Termination induction by means of an abstract OLDT resolution.
JFPL 1992: 353-373 |
| 11 | | Anne Parrain,
Philippe Devienne,
Patrick Lebègue:
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation.
LOPSTR 1992: 228-241 |
| 10 | | Philippe Devienne,
Patrick Lebègue,
Jean-Christophe Routier:
Halting Problem of One Binary Horn Clause id Undecidable.
Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 5-14 |
| 9 | | Philippe Devienne,
Patrick Lebègue,
Jean-Christophe Routier:
Weighted Systems Revisited.
WSA 1992: 163-173 |
| 8 | | Anne Parrain,
Philippe Devienne,
Patrick Lebègue:
Towards Optimization of Full Prolog Programs guided by Abstract Interpretation.
WSA 1992: 295-303 |
| 1991 |
|---|
| 7 | | Anne Parrain,
Philippe Devienne,
Patrick Lebègue:
Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs.
JTASPEFT/WSA 1991: 132-138 |
| 6 | | Christophe Lecoutre,
Philippe Devienne,
Patrick Lebègue:
Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite.
JTASPEFT/WSA 1991: 62-69 |
| 5 | | Christophe Lecoutre,
Philippe Devienne,
Patrick Lebègue:
Abstract Interpretation and Recursive Behaviour of Logic Programs.
LOPSTR 1991: 147-166 |
| 4 | | Anne Parrain,
Philippe Devienne,
Patrick Lebègue:
Prolog Program Transformations and Meta-Interpreters.
LOPSTR 1991: 238-251 |
| 1990 |
|---|
| 3 | | Philippe Devienne:
Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming.
Theor. Comput. Sci. 75(1&2): 157-215 (1990) |
| 1988 |
|---|
| 2 | | Philippe Devienne:
WEIGHTED GRAPHS, A Tool for Expressing the Behavious of Recursive Rules in Logic Programming.
FGCS 1988: 397-404 |
| 1986 |
|---|
| 1 | | Philippe Devienne,
Patrick Lebègue:
Weighted Graphs: A Tool for Logic Programming.
CAAP 1986: 100-111 |
