no image

SOPHIE TISON

professeure des universités

Publications


Article dans des revues

  • Benoit Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison. Static analysis of xml security views and query rewriting. Information and Computation, Elsevier, 2013. ⟨hal-00796297⟩
  • Olivier Gauwin, Joachim Niehren, Sophie Tison. Queries on XML Streams with Bounded Delay and Concurrency. Information and Computation, Elsevier, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. ⟨10.1016/j.ic.2010.08.003⟩. ⟨inria-00491495⟩
  • Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata With Global Constraints. International Journal of Foundations of Computer Science, World Scientific Publishing, 2010, 21 (4), pp.571-596. ⟨10.1142/S012905411000743X⟩. ⟨hal-00526987⟩
  • Yves André, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison. Path constraints in semistructured data. Theoretical Computer Science, Elsevier, 2007, 385 (1-3), pp.11-33. ⟨10.1016/j.tcs.2007.05.010⟩. ⟨hal-00189067⟩
  • Max Dauchet, Sophie Tison, Marc Tommasi. Réduction de la non-linéarité des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. Theoretical Computer Science, Elsevier, 2002, 281 (1-2), pp.219-233. ⟨10.1016/S0304-3975(02)00014-2⟩. ⟨hal-02193763⟩
  • Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen. Grid structures and undecidable constraint theories. Theoretical Computer Science, Elsevier, 2001, 258 (1-2), pp.453-490. ⟨10.1016/S0304-3975(00)00032-3⟩. ⟨hal-02193758⟩
  • Jean-Marc Talbot, Philippe Devienne, Sophie Tison. Generalized Definite Set Constraints. Constraints, Springer Verlag, 2000, 5 (1/2), pp.161-202. ⟨10.1023/A:1009826603139⟩. ⟨hal-02193768⟩
  • Joachim Niehren, Ralf Treinen, Sophie Tison. On Rewrite Constraints and Context Unification. Information Processing Letters, Elsevier, 2000, 74 (1-2), pp.35--40. ⟨inria-00536802⟩
  • Rémi Gilleron, Sophie Tison, Marc Tommasi. Set constraints and automata. Information and Computation, Elsevier, 1999, 149 (1), pp.1--41. ⟨inria-00538886⟩
  • Rémi Gilleron, Sophie Tison. Regular Tree Languages and Rewrite Systems. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 1995, 24 (1/2), pp.157--176. ⟨inria-00538882⟩
  • 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. Information and Computation, Elsevier, 1990, 88 (2), pp.187-201. ⟨10.1016/0890-5401(90)90015-A⟩. ⟨hal-02193891⟩

Communication dans un congrès

  • Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, et al.. Oblivious and Semi-Oblivious Boundedness for Existential Rules. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2019, Macao, China. ⟨lirmm-02148142⟩
  • Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana. Ontology-Mediated Query Answering for Key-Value Stores. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2017, Melbourne, Australia. ⟨lirmm-01632090⟩
  • Sophie Tison. Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?. 22nd International Conference on Rewriting Techniques and Applications (RTA'11), Apr 2011, France. ⟨10.4230/LIPIcs.RTA.2011.1⟩. ⟨hal-00818127⟩
  • Iovka Boneva, Benoit Groz, Sophie Tison, Anne-Cécile Caron, Yves Roos, et al.. View update translation for XML. 14th International Conference on Database Theory (ICDT), Mar 2011, Uppsala, Sweden. ⟨inria-00534857v2⟩
  • Olivier Gauwin, Joachim Niehren, Sophie Tison. Earliest Query Answering for Deterministic Nested Word Automata. 17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. pp.121-132. ⟨inria-00390236v2⟩
  • Benoit Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison. XML Security Views Revisited. International Symposium on Database Programming Languages, Aug 2009, LYON, France. pp 52-67. ⟨hal-00396796⟩
  • Olivier Gauwin, Joachim Niehren, Sophie Tison. Bounded Delay and Concurrency for Earliest Query Answering. 3rd International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.350-361, ⟨10.1007/978-3-642-00982-2⟩. ⟨inria-00348463⟩
  • Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Tree Automata with Global Constraints. 12th International Conference on Developments in Language Theory (DLT), Sep 2008, Kyoto, Japan. pp.314-326. ⟨inria-00292027v2⟩
  • Emmanuel Filiot, Sophie Tison. Regular n-ary Queries in Trees and Variable Independence. 5th IFIP International Conference on Theoretical Computer Science, Sep 2008, Milano, Italy. pp.429-443. ⟨inria-00274648v2⟩
  • Guillem Godoy, Sebastian Maneth, Sophie Tison. Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FOSSACS'08, Apr 2008, Hungary. pp.127-141. ⟨hal-00243123⟩
  • Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison. Complexity of Earliest Query Answering with Streaming Tree Automata. ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States. ⟨inria-00336169⟩
  • Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison. Satisfiability of a Spatial Logic with Tree Variables. 16th EACSL Annual Conference on Computer Science and Logic, Sep 2007, Lausanne, Switzerland. pp.130-145, ⟨10.1007/978-3-540-74915-8_13⟩. ⟨inria-00148462v2⟩
  • Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Polynomial Time Fragments of XPath with Variables. 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Jun 2007, Beijing, China. pp.205-214. ⟨inria-00135678⟩
  • Guillem Godoy, Sophie Tison. On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE, 2007, Germany. pp.247-262, ⟨10.1007/978-3-540-73595-3_17⟩. ⟨hal-00190004⟩
  • Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. Composing Monadic Queries in Trees. PLAN-X, 2006, Unknown, Unknown Region. pp.61-70, ⟨10.1007/978-3-319-04939-7_13⟩. ⟨hal-01196266⟩
  • Iovka Boneva, Jean-Marc Talbot, Sophie Tison. Expressiveness of a spatial logic for trees. 20th Annual IEEE Symposium on Logic in Computer Science, 2005, Chicago, United States. pp.280--289. ⟨inria-00536696⟩
  • Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos. Monotone AC-Tree Automata. 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning, 2005, Montego Bay, Jamaica. pp.337-351. ⟨inria-00536693⟩
  • Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison. N-ary Queries by Tree Automata. 10th International Symposium on Database Programming Languages, 2005, Trondheim, Norway. pp.217--231. ⟨inria-00536522⟩
  • Yves André, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison. Extraction and Implication of Path Constraints. 29th Symposium on Mathematical Foundations of Computer Science, 2004, Prague, Costa Rica. pp.863-875. ⟨inria-00536715⟩
  • Denis Debarbieux, Yves Roos, Sophie Tison, Yves André, Anne-Cécile Caron. Path Rewriting in Semistructured Data. 4th International Conference on Combinatorics on Words, 2003, Turku, Finland. pp.358--369. ⟨inria-00536731⟩
  • Sophie Tison. Tree Automata and Term Rewrite Systems. Rewriting Techniques and Applications, 11th International Conference, RTA 2000, 2000, Norwich, United Kingdom. pp.27-30. ⟨hal-02193893⟩
  • Franck Seynhaeve, Sophie Tison, Marc Tommasi. Homomorphisms and concurrent term rewriting. FCT 1999 - International Symposium on Fundamentals of Computation Theory, Aug 1999, Iasi, Romania. pp.475-487, ⟨10.1007/3-540-48321-7_40⟩. ⟨hal-02193779⟩
  • Bruno Bogaert, Franck Seynhaeve, Sophie Tison. The Recognizability Problem for Tree Automata with Comparisons between Brothers. Foundations of Software Science and Computation Structure, FoSSaCS'99,, 1999, Amsterdam, Netherlands. pp.150-164. ⟨hal-02193786⟩
  • Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi. Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, 1999, Unknown, Unknown Region. pp.103--117, ⟨10.1007/3-540-48685-2_9⟩. ⟨hal-01820502⟩
  • P. Devienne, J. Talbot, S. Tison. Solving classes of set constraints with tree automata. Principles and Practice of Constraint Programming, CP97, 1997, Linz, Austria. pp.62-76. ⟨hal-02193791⟩
  • J. Talbot, S. Tison, P. Devienne. Set-based analysis for logic programming and tree automata. Static Analysis, 4th International Symposium, SAS '97, 1997, Paris, France. pp.127-140. ⟨hal-02193771⟩
  • Rémi Gilleron, Sophie Tison, Marc Tommasi. Some new Decidability Results on Positive and Negative Set Constraints. Proceedings of First International Conference on Constraints in Computational Logics, CCL'94, 1994, Munich, Germany. pp.336--351. ⟨inria-00538880⟩
  • Rémi Gilleron, Sophie Tison, Marc Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. Proceedings of the $34^th$ Symposium on Foundations of Computer Science, FOCS'93, 1993, Palo Alto California, United States. pp.372--380. ⟨inria-00538879⟩
  • Rémi Gilleron, Sophie Tison, Marc Tommasi. Solving Systems of Set Constraints using Tree Automata. Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS'93, 1993, Würzburg, Germany. pp.505--514. ⟨inria-00538878⟩
  • B. Bogaert, S. Tison. Equality and disequality constraints on direct subterms in tree automata. STACS 1992, 1992, Cachan, France. pp.159-171. ⟨hal-02193917⟩
  • M. Dauchet, S. Tison. The theory of ground rewrite systems is decidable. Fifth Annual IEEE Symposium on Logic in Computer Science, 1990, Philadelphia, United States. pp.242-248. ⟨hal-02193918⟩
  • Jean-Luc Coquidé, Max Dauchet, Sophie Tison. About connections between syntactical and computational complexity. Fundamentals of Computation Theory, FCT'89, 1989, Szeged, Hungary. pp.105-115. ⟨hal-02193920⟩
  • Sophie Tison. Fair termination is decidable for ground systems. Rewriting Techniques and Applications, RTA-89,, 1989, Chapel Hill, United States. pp.462-476. ⟨hal-02193919⟩
  • Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne. Decidability of the Confluence of Ground Term Rewriting Systems.. LICS 1987 - Second Annual IEEE Symposium on Logic in Computer Science, Jun 1987, Ithaca, New York, United States. ⟨hal-02193998⟩
  • M. Dauchet, S. Tison. Decidability of confluence for ground term rewriting systems. Fundamentals of Computation Theory, FCT'85, 1985, Cottbus, Germany. pp.80-89. ⟨hal-02193990⟩
  • S. Tison, M. Dauchet, G. Comyn. Metrical and ordered properties of powerdomains. Fundamentals of Computation Theory, FCT'83, 1983, Borgholm, Sweden. pp.465-474. ⟨hal-02193994⟩

Document associé à des manifestations scientifiques

  • Emmanuel Filiot, Florent Jacquemard, Sophie Tison. Tree Automata with Constraints: a brief survey. Tree Transducers and Formal Methods (Dagstuhl Seminar 13192), May 2013, Wadern, Germany. pp.1-18, 2013. ⟨hal-00840959⟩

Chapitre d'ouvrage

  • Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. Pierre Marquis, Odile Papini and Henri Prade. IA Handbook, Cépaduès, pp.1-63, 2010. ⟨inria-00549416⟩
  • Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, et al.. Décidabilité et Complexité. IA Handbook, Cépaduès, pp.1-63, 2010. ⟨hal-00999661⟩

Rapport

  • Pierre Lescanne, Thierry Heuillard, Max Dauchet, Sophie Tison. Decidability of the confluence of ground term rewriting systems. [Research Report] RR-0675, INRIA. 1987. ⟨inria-00075878⟩