| 2024 | ICDT | Containment of Regular Path Queries Under Path Constraints. | Sylvain Salvati, Sophie Tison |
| 2019 | IJCAI | Oblivious and Semi-Oblivious Boundedness for Existential Rules. | Pierre Bourhis, Michel Leclre, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois |
| 2017 | IJCAI | Ontology-Mediated Query Answering for Key-Value Stores. | Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana |
| 2011 | ICDT | View update translation for XML. | Iovka Boneva, Anne-Ccile Caron, Benot Groz, Yves Roos, Sophie Tison, Slawek Staworko |
| 2009 | FCT | Earliest Query Answering for Deterministic Nested Word Automata. | Olivier Gauwin, Joachim Niehren, Sophie Tison |
| 2009 | LATA | Bounded Delay and Concurrency for Earliest Query Answering. | Olivier Gauwin, Joachim Niehren, Sophie Tison |
| 2008 | DLT | Tree Automata with Global Constraints. | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
| 2008 | FOSSACS | Classes of Tree Homomorphisms with Decidable Preservation of Regularity. | Guillem Godoy, Sebastian Maneth, Sophie Tison |
| 2007 | CADE | On the Normalization and Unique Normalization Properties of Term Rewrite Systems. | Guillem Godoy, Sophie Tison |
| 2007 | CSL | Satisfiability of a Spatial Logic with Tree Variables. | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
| 2007 | PODS | Polynomial time fragments of XPath with variables. | Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison |
| 2005 | LICS | Expressiveness of a Spatial Logic for Trees. | Iovka Boneva, Jean-Marc Talbot, Sophie Tison |
| 2005 | LPAR | Monotone AC-Tree Automata. | Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos |
| 2004 | MFCS | Extraction and Implication of Path Constraints. | Yves Andre, Anne-Ccile Caron, Denis Debarbieux, Yves Roos, Sophie Tison |
| 1999 | FCT | Homomorphisms and Concurrent Term Rewriting. | Franck Seynhaeve, Sophie Tison, Marc Tommasi |
| 1999 | FOSSACS | The Recognizability Problem for Tree Automata with Comparisons between Brothers. | Bruno Bogaert, Franck Seynhaeve, Sophie Tison |
| 1998 | ICLP | Co-definite Set Constraints with Membership Expressions. | Philippe Devienne, Jean-Marc Talbot, Sophie Tison |
| 1997 | CP | Solving Classes of Set Constraints with Tree Automata. | Philippe Devienne, Jean-Marc Talbot, Sophie Tison |
| 1997 | SAS | Set-Based Analysis for Logic Programming and Tree Automata. | Jean-Marc Talbot, Sophie Tison, Philippe Devienne |
| 1993 | FOCS | Solving Systems of Set Constraints with Negated Subset Relationships | Rmi Gilleron, Sophie Tison, Marc Tommasi |
| 1993 | STACS | Solving Systems of Set Constraints using Tree Automata. | Rmi Gilleron, Sophie Tison, Marc Tommasi |
| 1992 | STACS | Equality and Disequality Constraints on Direct Subterms in Tree Automata. | Bruno Bogaert, Sophie Tison |
| 1990 | LICS | The Theory of Ground Rewrite Systems is Decidable | Max Dauchet, Sophie Tison |
| 1989 | FCT | About Connections Between Syntactical and Computational Complexity. | Jean-Luc Coquid, Max Dauchet, Sophie Tison |
| 1987 | LICS | Decidability of the Confluence of Ground Term Rewriting Systems | Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne |
| 1985 | FCT | Decidability of confluence for ground term rewriting systems. | Max Dauchet, Sophie Tison |
| 1983 | FCT | Metrical an Ordered Properties of Powerdomains. | Sophie Tison, Max Dauchet, Grard Comyn |