The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sophie Tison: [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. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Some new Decidability Results on Positive and Negative Set Constraints. [Citation Graph (0, 0)][DBLP]
    CCL, 1994, pp:336-351 [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. 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. Jean-Luc Coquidé, Max Dauchet, Sophie Tison
    About Connections Between Syntactical and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:105-115 [Conf]
  7. Max Dauchet, Sophie Tison
    Decidability of confluence for ground term rewriting systems. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:80-89 [Conf]
  8. Sophie Tison, Max Dauchet, Gérard Comyn
    Metrical an Ordered Properties of Powerdomains. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:465-474 [Conf]
  9. Franck Seynhaeve, Sophie Tison, Marc Tommasi
    Homomorphisms and Concurrent Term Rewriting. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:475-487 [Conf]
  10. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Solving Systems of Set Constraints with Negated Subset Relationships [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:372-380 [Conf]
  11. Bruno Bogaert, Franck Seynhaeve, Sophie Tison
    The Recognizability Problem for Tree Automata with Comparisons between Brothers. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1999, pp:150-164 [Conf]
  12. 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]
  13. 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]
  14. Max Dauchet, Sophie Tison
    The Theory of Ground Rewrite Systems is Decidable [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:242-248 [Conf]
  15. Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
    Decidability of the Confluence of Ground Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:353-359 [Conf]
  16. Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
    Monotone AC-Tree Automata. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:337-351 [Conf]
  17. Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
    Extraction and Implication of Path Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:863-875 [Conf]
  18. 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]
  19. Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi
    Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:103-117 [Conf]
  20. Sophie Tison
    Tree Automata and Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:27-30 [Conf]
  21. Sophie Tison
    Fair Termination is Decidable for Ground Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:462-476 [Conf]
  22. 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]
  23. Bruno Bogaert, Sophie Tison
    Equality and Disequality Constraints on Direct Subterms in Tree Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:161-171 [Conf]
  24. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Solving Systems of Set Constraints using Tree Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:505-514 [Conf]
  25. 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]
  26. Rémi Gilleron, Sophie Tison
    Regular Tree Languages and Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:24, n:1/2, pp:157-174 [Journal]
  27. Max Dauchet, Thierry Heuillard, Pierre Lescanne, Sophie Tison
    Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:88, n:2, pp:187-201 [Journal]
  28. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Set Constraints and Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:149, n:1, pp:1-41 [Journal]
  29. Joachim Niehren, Sophie Tison, Ralf Treinen
    On rewrite constraints and context unification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:35-40 [Journal]
  30. Max Dauchet, Sophie Tison, Marc Tommasi
    Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:219-233 [Journal]
  31. Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen
    Grid structures and undecidable constraint theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:453-490 [Journal]
  32. Guillem Godoy, Sophie Tison
    On the Normalization and Unique Normalization Properties of Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:247-262 [Conf]
  33. 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]
  34. 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]
  35. Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
    Path constraints in semistructured data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:11-33 [Journal]

  36. XML Security Views Revisited. [Citation Graph (, )][DBLP]


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


  38. Earliest Query Answering for Deterministic Nested Word Automata. [Citation Graph (, )][DBLP]


  39. Classes of Tree Homomorphisms with Decidable Preservation of Regularity. [Citation Graph (, )][DBLP]


  40. Regular n-ary Queries in Trees and Variable Independence. [Citation Graph (, )][DBLP]


  41. Complexity of Earliest Query Answering with Streaming Tree Automata. [Citation Graph (, )][DBLP]


  42. Bounded Delay and Concurrency for Earliest Query Answering. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002