|
СТ |
Set-Based Analysis for Logic Programming and Tree Automata |
1997 |
Talbot J. M., Tison S., Devienne P. |
|
|
|
Lecture Notes in Computer Science |
20.09.1997 |
|
СТ |
The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable |
1993 |
Devienne P., Lebegue P., Routier J. -C. |
|
|
|
Logic Programming: Proc./1993 Intern. Symp. |
20.09.1994 |
|
СТ |
One Binary Horn Clause is Enough |
1994 |
Devienne P., Lebegue P., Routier J. -C. |
|
|
|
Lecture Notes in Computer Science |
26.03.1994 |
|
СТ |
Halting Problem of One Binary Horn Clause is Undecidable |
1993 |
Devienne P., Lebegue P., Routier J. -C. |
|
|
|
Lecture Notes in Computer Science |
06.04.1993 |
|
СТ |
Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation |
1992 |
Parrain A., Devienne P., Lebegue P. |
|
|
|
BIGRE |
11.11.1992 |
|
СТ |
Une analyse du comporterment recursif de programmes Prolog par une interpretation abstraite |
1991 |
Lecoutre C., Devienne P., Lebegue P. |
|
|
|
BIGRE |
11.12.1991 |
|
СТ |
Techniques de transformations de programmes generaux et validation de meta-interpreteurs |
1991 |
Parrain A., Devienne P., Lebegue P. |
|
|
|
BIGRE |
11.12.1991 |
|
СТ |
Weighted Systems of Equations |
1991 |
Devienne P., Lebegue P., Dauchet M. |
|
|
INRIA |
Informatika 91: Theoretical Computer Science and Methods of Compilation and Program Construction |
20.11.1991 |
