 | 2011 |
| 15 |  | Iovka Boneva,
Anne-Cécile Caron,
Benoît Groz,
Yves Roos,
Sophie Tison,
Slawek Staworko:
View update translation for XML.
ICDT 2011: 42-53 |
| 2009 |
| 14 |  | Benoît Groz,
Slawomir Staworko,
Anne-Cécile Caron,
Yves Roos,
Sophie Tison:
XML Security Views Revisited.
DBPL 2009: 52-67 |
| 2008 |
| 13 |  | Olivier Gauwin,
Anne-Cécile Caron,
Joachim Niehren,
Sophie Tison:
Complexity of Earliest Query Answering with Streaming Tree Automata.
PLAN-X 2008 |
| 2007 |
| 12 |  | Yves Andre,
Anne-Cécile Caron,
Denis Debarbieux,
Yves Roos,
Sophie Tison:
Path constraints in semistructured data.
Theor. Comput. Sci. 385(1-3): 11-33 (2007) |
| 2005 |
| 11 |  | Yves Andre,
Anne-Cécile Caron,
Denis Debarbieux,
Yves Roos:
Indexes and Path Constraints in Semistructured Data.
DEXA Workshops 2005: 837-841 |
| 2004 |
| 10 |  | Yves Andre,
Anne-Cécile Caron,
Denis Debarbieux,
Yves Roos,
Sophie Tison:
Extraction and Implication of Path Constraints.
MFCS 2004: 863-875 |
| 2003 |
| 9 |  | Anne-Cécile Caron,
Denis Debarbieux,
Yves Roos:
Modèles de données semi-structurées et contraintes d'inclusion.
EGC 2003: 461-472 |
| 1999 |
| 8 |  | Yves Andre,
Francis Bossut,
Anne-Cécile Caron:
On decidability of boundedness property for regular path queries.
Developments in Language Theory 1999: 245-256 |
| 7 |  | Anne-Cécile Caron,
Franck Seynhaeve,
Sophie Tison,
Marc Tommasi:
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting.
RTA 1999: 103-117 |
| 1995 |
| 6 |  | Max Dauchet,
Anne-Cécile Caron,
Jean-Luc Coquidé:
Automata for Reduction Properties Solving.
J. Symb. Comput. 20(2): 215-233 (1995) |
| 1994 |
| 5 |  | Anne-Cécile Caron,
Hubert Comon,
Jean-Luc Coquidé,
Max Dauchet,
Florent Jacquemard:
Pumping, Cleaning and Symbolic Constraints Solving.
ICALP 1994: 436-449 |
| 4 |  | Anne-Cécile Caron,
Jean-Luc Coquidé:
Decidability of Reachability for Disjoint Union of Term Rewriting Systems.
Theor. Comput. Sci. 126(1): 31-52 (1994) |
| 1993 |
| 3 |  | Anne-Cécile Caron,
Jean-Luc Coquidé,
Max Dauchet:
Encompassment Properties and Automata with Constraints.
RTA 1993: 328-342 |
| 1992 |
| 2 |  | Anne-Cécile Caron:
Decidability of Reachability and Disjoint Union of Term Rewriting Systems.
CAAP 1992: 86-101 |
| 1991 |
| 1 |  | Anne-Cécile Caron:
Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties.
TAPSOFT, Vol.1 1991: 74-89 |