The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philippe Devienne: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.301secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002