Sophie Tison

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 4

Top Topics

Query Rewriting

Static Analysis

Top Venues

Publications

Sylvain Salvati, Sophie Tison
Containment of Regular Path Queries Under Path Constraints. ICDT (2024)
Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois
Oblivious and Semi-Oblivious Boundedness for Existential Rules. CoRR (2020)
Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois
Oblivious and Semi-Oblivious Boundedness for Existential Rules. IJCAI (2019)
Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana
Ontology-Mediated Query Answering for Key-Value Stores. IJCAI (2017)
Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison
Static analysis of XML security views and query rewriting. Inf. Comput. 238 (2014)
Sophie Tison
Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What's New? TLCA (2011)
Olivier Gauwin, Joachim Niehren, Sophie Tison
Queries on Xml streams with bounded delay and concurrency. Inf. Comput. 209 (3) (2011)
Sophie Tison
Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?. RTA (2011)
Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawek Staworko
View update translation for XML. ICDT (2011)
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Tree Automata with Global Constraints. Int. J. Found. Comput. Sci. 21 (4) (2010)
Benoît Groz, Slawomir Staworko, Anne-Cécile Caron, Yves Roos, Sophie Tison
XML Security Views Revisited. DBPL (2009)
Olivier Gauwin, Joachim Niehren, Sophie Tison
Earliest Query Answering for Deterministic Nested Word Automata. FCT (2009)
Olivier Gauwin, Joachim Niehren, Sophie Tison
Bounded Delay and Concurrency for Earliest Query Answering. LATA (2009)
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Tree Automata with Global Constraints. Developments in Language Theory (2008)
Emmanuel Filiot, Sophie Tison
Regular n-ary Queries in Trees and Variable Independence. IFIP TCS (2008)
Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison
Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X (2008)
Guillem Godoy, Sebastian Maneth, Sophie Tison
Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS (2008)
Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
Path constraints in semistructured data. Theor. Comput. Sci. 385 (1-3) (2007)
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
Polynomial time fragments of XPath with variables. PODS (2007)
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
Satisfiability of a Spatial Logic with Tree Variables. CSL (2007)
Guillem Godoy, Sophie Tison
On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE (2007)
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison
Composing Monadic Queries in Trees. PLAN-X (2006)
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
N-Ary Queries by Tree Automata. DBPL (2005)
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
N-ary Queries by Tree Automata. Foundations of Semistructured Data (2005)
Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
Monotone AC-Tree Automata. LPAR (2005)
Iovka Boneva, Jean-Marc Talbot, Sophie Tison
Expressiveness of a Spatial Logic for Trees. LICS (2005)
Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
Extraction and Implication of Path Constraints. MFCS (2004)
Ammar Aljer, Philippe Devienne, Sophie Tison, Jean-Louis Boulanger, Georges Mariano
BHDL: Circuit Design in B. ACSD (2003)
Max Dauchet, Sophie Tison, Marc Tommasi
Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. Theor. Comput. Sci. 281 (1-2) (2002)
Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen
Grid structures and undecidable constraint theories. Theor. Comput. Sci. 258 (1-2) (2001)
Joachim Niehren, Sophie Tison, Ralf Treinen
On rewrite constraints and context unification. Inf. Process. Lett. 74 (1-2) (2000)
Jean-Marc Talbot, Philippe Devienne, Sophie Tison
Generalized Definite Set Constraints. Constraints An Int. J. 5 (1/2) (2000)
Sophie Tison
Tree Automata and Term Rewrite Systems. RTA (2000)
Franck Seynhaeve, Sophie Tison, Marc Tommasi
Homomorphisms and Concurrent Term Rewriting. FCT (1999)
Bruno Bogaert, Franck Seynhaeve, Sophie Tison
The Recognizability Problem for Tree Automata with Comparisons between Brothers. FoSSaCS (1999)
Anne-Cécile Caron, Franck Seynhaeve, Sophie Tison, Marc Tommasi
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. RTA (1999)
Rémi Gilleron, Sophie Tison, Marc Tommasi
Set Constraints and Automata. Inf. Comput. 149 (1) (1999)
Philippe Devienne, Jean-Marc Talbot, Sophie Tison
Co-definite Set Constraints with Membership Expressions. IJCSLP (1998)
Philippe Devienne, Jean-Marc Talbot, Sophie Tison
Solving Classes of Set Constraints with Tree Automata. CP (1997)
Jean-Marc Talbot, Sophie Tison, Philippe Devienne
Set-Based Analysis for Logic Programming and Tree Automata. SAS (1997)
Rémi Gilleron, Sophie Tison
Regular Tree Languages and Rewrite Systems. Fundam. Informaticae 24 (1/2) (1995)
Rémi Gilleron, Sophie Tison, Marc Tommasi
Some new Decidability Results on Positive and Negative Set Constraints. CCL (1994)
Rémi Gilleron, Sophie Tison, Marc Tommasi
Solving Systems of Set Constraints using Tree Automata. STACS (1993)
Rémi Gilleron, Sophie Tison, Marc Tommasi
Solving Systems of Set Constraints with Negated Subset Relationships FOCS (1993)
Bruno Bogaert, Sophie Tison
Equality and Disequality Constraints on Direct Subterms in Tree Automata. STACS (1992)
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 Inf. Comput. 88 (2) (1990)
Max Dauchet, Sophie Tison
The Theory of Ground Rewrite Systems is Decidable LICS (1990)
Jean-Luc Coquidé, Max Dauchet, Sophie Tison
About Connections Between Syntactical and Computational Complexity. FCT (1989)
Sophie Tison
Fair Termination is Decidable for Ground Systems. RTA (1989)
Max Dauchet, Sophie Tison, Thierry Heuillard, Pierre Lescanne
Decidability of the Confluence of Ground Term Rewriting Systems LICS (1987)
Max Dauchet, Sophie Tison
Decidability of confluence for ground term rewriting systems. FCT (1985)
Sophie Tison, Max Dauchet, Gérard Comyn
Metrical an Ordered Properties of Powerdomains. FCT (1983)