The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Marc Talbot: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot
    On Theorem-Proving in Horn Theories with Built-in Algebras. [Citation Graph (0, 0)][DBLP]
    AISMC, 1996, pp:320-338 [Conf]
  2. 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]
  3. Witold Charatonik, Jean-Marc Talbot
    The Decidability of Model Checking Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:339-354 [Conf]
  4. Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
    N-ary Queries by Tree Automata. [Citation Graph (0, 0)][DBLP]
    Foundations of Semistructured Data, 2005, pp:- [Conf]
  5. Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
    N-Ary Queries by Tree Automata. [Citation Graph (0, 0)][DBLP]
    DBPL, 2005, pp:217-231 [Conf]
  6. Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot
    Finite-Control Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    ESOP, 2002, pp:295-313 [Conf]
  7. Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
    The Complexity of Model Checking Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:152-167 [Conf]
  8. Iovka Boneva, Jean-Marc Talbot
    When Ambients Cannot Be Opened. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:169-184 [Conf]
  9. 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]
  10. Iovka Boneva, Jean-Marc Talbot
    On Complexity of Model-Checking for the TQL Logic. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:381-394 [Conf]
  11. Iovka Boneva, Jean-Marc Talbot, Sophie Tison
    Expressiveness of a Spatial Logic for Trees. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:280-289 [Conf]
  12. Joachim Niehren, Martin Müller, Jean-Marc Talbot
    Entailment of Atomic Set Constraints is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:285-294 [Conf]
  13. Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
    Monotone AC-Tree Automata. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:337-351 [Conf]
  14. Jean-Marc Talbot
    On the Alternation-Free Horn Mu-calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:418-435 [Conf]
  15. Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
    Composing Monadic Queries in Trees. [Citation Graph (0, 0)][DBLP]
    PLAN-X, 2006, pp:61-70 [Conf]
  16. Witold Charatonik, Andreas Podelski, Jean-Marc Talbot
    Paths vs. Trees in Set-Based Program Analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 2000, pp:330-337 [Conf]
  17. Iovka Boneva, Jean-Marc Talbot
    Automata and Logics for Unranked and Unordered Trees. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:500-515 [Conf]
  18. Witold Charatonik, Jean-Marc Talbot
    Atomic Set Constraints with Projection. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:311-325 [Conf]
  19. 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]
  20. 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]
  21. Jean-Marc Talbot
    The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:27-33 [Journal]
  22. Iovka Boneva, Jean-Marc Talbot
    When ambients cannot be opened. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:1-2, pp:127-169 [Journal]
  23. Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
    Model checking mobile ambients. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:308, n:1-3, pp:277-331 [Journal]
  24. Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
    Satisfiability of a Spatial Logic with Tree Variables. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:130-145 [Conf]
  25. Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
    Polynomial time fragments of XPath with variables. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:205-214 [Conf]

  26. Tree Automata with Global Constraints. [Citation Graph (, )][DBLP]


  27. Properties of Visibly Pushdown Transducers. [Citation Graph (, )][DBLP]


  28. A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs. [Citation Graph (, )][DBLP]


  29. On Functionality of Visibly Pushdown Transducers [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.031secs
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