Metrical an Ordered Properties of Powerdomains. - Sophie Tison; Max Dauchet; Gérard Comyn (FCT, 1983)

Decidability of confluence for ground term rewriting systems. - Max Dauchet; Sophie Tison (FCT, 1985)

Decidability of the Confluence of Ground Term Rewriting Systems - Max Dauchet; Sophie Tison; Thierry Heuillard; Pierre Lescanne (LICS, 1987)

About Connections Between Syntactical and Computational Complexity. - Jean-Luc Coquidé; Max Dauchet; Sophie Tison (FCT, 1989)

Fair Termination is Decidable for Ground Systems. - Sophie Tison (RTA, 1989)

The Theory of Ground Rewrite Systems is Decidable - Max Dauchet; Sophie Tison (LICS, 1990)

Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems - Max Dauchet; Thierry Heuillard; Pierre Lescanne; Sophie Tison (Inf. Comput., 1990)

Structural complexity of classes of tree languages. - Max Dauchet; Sophie Tison (Tree Automata and Languages, 1992)

Equality and Disequality Constraints on Direct Subterms in Tree Automata. - Bruno Bogaert; Sophie Tison (STACS, 1992)

Solving Systems of Set Constraints with Negated Subset Relationships - Rémi Gilleron; Sophie Tison; Marc Tommasi (FOCS, 1993)

Solving Systems of Set Constraints using Tree Automata. - Rémi Gilleron; Sophie Tison; Marc Tommasi (STACS, 1993)

Some new Decidability Results on Positive and Negative Set Constraints. - Rémi Gilleron; Sophie Tison; Marc Tommasi (CCL, 1994)

Regular Tree Languages and Rewrite Systems. - Rémi Gilleron; Sophie Tison (Fundam. Informaticae, 1995)

Solving Classes of Set Constraints with Tree Automata. - Philippe Devienne; Jean-Marc Talbot; Sophie Tison (CP, 1997)

Set-Based Analysis for Logic Programming and Tree Automata. - Jean-Marc Talbot; Sophie Tison; Philippe Devienne (SAS, 1997)

Co-definite Set Constraints with Membership Expressions. - Philippe Devienne; Jean-Marc Talbot; Sophie Tison (IJCSLP, 1998)

Homomorphisms and Concurrent Term Rewriting. - Franck Seynhaeve; Sophie Tison; Marc Tommasi (FCT, 1999)

The Recognizability Problem for Tree Automata with Comparisons between Brothers. - Bruno Bogaert; Franck Seynhaeve; Sophie Tison (FoSSaCS, 1999)

Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. - Anne-Cécile Caron; Franck Seynhaeve; Sophie Tison; Marc Tommasi (RTA, 1999)

Set Constraints and Automata. - Rémi Gilleron; Sophie Tison; Marc Tommasi (Inf. Comput., 1999)

Tree Automata and Term Rewrite Systems. - Sophie Tison (RTA, 2000)

Generalized Definite Set Constraints. - Jean-Marc Talbot; Philippe Devienne; Sophie Tison (Constraints An Int. J., 2000)

On rewrite constraints and context unification. - Joachim Niehren; Sophie Tison; Ralf Treinen (Inf. Process. Lett., 2000)

Grid structures and undecidable constraint theories. - Franck Seynhaeve; Sophie Tison; Marc Tommasi; Ralf Treinen (Theor. Comput. Sci., 2001)

Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. - Max Dauchet; Sophie Tison; Marc Tommasi (Theor. Comput. Sci., 2002)

BHDL: Circuit Design in B. - Ammar Aljer; Philippe Devienne; Sophie Tison; Jean-Louis Boulanger; Georges Mariano (ACSD, 2003)

Extraction and Implication of Path Constraints. - Yves Andre; Anne-Cécile Caron; Denis Debarbieux; Yves Roos; Sophie Tison (MFCS, 2004)

N-Ary Queries by Tree Automata. - Joachim Niehren; Laurent Planque; Jean-Marc Talbot; Sophie Tison (DBPL, 2005)

Expressiveness of a Spatial Logic for Trees. - Iovka Boneva; Jean-Marc Talbot; Sophie Tison (LICS, 2005)

Monotone AC-Tree Automata. - Hitoshi Ohsaki; Jean-Marc Talbot; Sophie Tison; Yves Roos (LPAR, 2005)

Composing Monadic Queries in Trees. - Emmanuel Filiot; Joachim Niehren; Jean-Marc Talbot; Sophie Tison (PLAN-X, 2006)

On the Normalization and Unique Normalization Properties of Term Rewrite Systems. - Guillem Godoy; Sophie Tison (CADE, 2007)

Satisfiability of a Spatial Logic with Tree Variables. - Emmanuel Filiot; Jean-Marc Talbot; Sophie Tison (CSL, 2007)

Polynomial time fragments of XPath with variables. - Emmanuel Filiot; Joachim Niehren; Jean-Marc Talbot; Sophie Tison (PODS, 2007)

Path constraints in semistructured data. - Yves Andre; Anne-Cécile Caron; Denis Debarbieux; Yves Roos; Sophie Tison (Theor. Comput. Sci., 2007)

Classes of Tree Homomorphisms with Decidable Preservation of Regularity. - Guillem Godoy; Sebastian Maneth; Sophie Tison (FoSSaCS, 2008)

Regular n-ary Queries in Trees and Variable Independence. - Emmanuel Filiot; Sophie Tison (IFIP TCS, 2008)

Complexity of Earliest Query Answering with Streaming Tree Automata. - Olivier Gauwin; Anne-Cécile Caron; Joachim Niehren; Sophie Tison (PLAN-X, 2008)

XML Security Views Revisited. - Benoît Groz; Slawomir Staworko; Anne-Cécile Caron; Yves Roos; Sophie Tison (DBPL, 2009)

Earliest Query Answering for Deterministic Nested Word Automata. - Olivier Gauwin; Joachim Niehren; Sophie Tison (FCT, 2009)

Bounded Delay and Concurrency for Earliest Query Answering. - Olivier Gauwin; Joachim Niehren; Sophie Tison (LATA, 2009)

Tree Automata with Global Constraints. - Emmanuel Filiot; Jean-Marc Talbot; Sophie Tison (Int. J. Found. Comput. Sci., 2010)

View update translation for XML. - Iovka Boneva; Anne-Cécile Caron; Benoît Groz; Yves Roos; Sophie Tison; Slawek Staworko (ICDT, 2011)

Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What's New? - Sophie Tison (TLCA, 2011)

Queries on Xml streams with bounded delay and concurrency. - Olivier Gauwin; Joachim Niehren; Sophie Tison (Inf. Comput., 2011)

Static analysis of XML security views and query rewriting. - Benoît Groz; Slawomir Staworko; Anne-Cécile Caron; Yves Roos; Sophie Tison (Inf. Comput., 2014)

Ontology-Mediated Query Answering for Key-Value Stores. - Meghyn Bienvenu; Pierre Bourhis; Marie-Laure Mugnier; Sophie Tison; Federico Ulliana (IJCAI, 2017)

Oblivious and Semi-Oblivious Boundedness for Existential Rules. - Pierre Bourhis; Michel Leclère; Marie-Laure Mugnier; Sophie Tison; Federico Ulliana; Lily Gallois (IJCAI, 2019)

Theoretical Computer Science: Computability, Decidability and Logic. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Theoretical Computer Science: Computational Complexity. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Containment of Regular Path Queries Under Path Constraints. - Sylvain Salvati; Sophie Tison (ICDT, 2024)

Corrections to "On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164-194]". - Pablo Barceló; Gaëlle Fontaine; Sylvain Salvati; Sophie Tison (J. Comput. Syst. Sci., 2026)