Query database
Add entry by form
Add entry in bibtex format
Edit entries
Show variables

BibTex

International Journals

  1. [2007] Yves André and Anne-Cécile Caron and Denis Debarbieux and Yves Roos and Sophie Tison, Path Constraints in Semi-Structured Data, Theoretical Computer Science 1-3 385, 11-33
  2. [1995] M. Dauchet and A.-C. Caron and J.-L. Coquidé , Reduction properties and automata with constraints, Journal of Symbolic Computation 20, 215--233

International Conferences

  1. [2009] Benoît Groz and Slawek Staworko and Anne-Cécile Caron, and Yves Roos and Sophie Tison, XML Security Views Revisited, 12th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 5708, 52-67
  2. [2004] Yves André and Anne-Cécile Caron and Denis Debarbieux and Yves Roos and Sophie Tison, Extraction and Implication of Path Constraints, 29th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 3153, 863-875
  3. [2003] Denis Debarbieux and Yves Roos and Sophie Tison and Yves Andre and Anne-Cécile Caron, Path Rewriting in Semistructured Data, 4th International Conference on Combinatorics on Words 27, 358--369
  4. [1999] Y. Andr'e and F. Bossut and A.C. Caron., On Decidability of Boundedness Property for Regular Path Queries, Proceedings of DLT'99
  5. [1999] A.-C. Caron and F. Seynhaeve and S. Tison and M. Tommasi, Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting, Proceedings of the tenth International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1631, 103-117
  6. [1994] A.-C. Caron and H. Comon and J.L. Coquidé and M. Dauchet and F. Jacquemard, Pumping, Cleaning and Symbolic constraints solving, Lecture Notes in Computer Science 820, 436--449
  7. [1993] A.-C. Caron and J.L. Coquidé and M. Dauchet, Encompassment properties and Automata with Constraints, proceedings of the 5th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, 328--342
  8. [1992] A.-C. Caron, Decidability of Reachability and Disjoint Union of Term Rewriting Systems, Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 581, 86--101
  9. [1991] A.-C. Caron, Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decisions Properties, Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science 493, 74--89

International Workshops

  1. [2008] Olivier Gauwin and Anne-Cécile Caron and Joachim Niehren and Sophie Tison, Complexity of Earliest Query Answering with Streaming Tree Automata, ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X)
  2. [2005] Yves Andre and Anne-Cecile Caron and Denis Debarbieux and Yves Roos, Indexes and path constraints in semistructured data, DEXA Workshop on Logical Aspects and Applications of Integrity Constraints, 837 - 841

French Conferences

  1. [2003] Anne-Cécile Caron and Denis Debarbieux and Yves Roos, Modéles de données semi-structurées et contraintes d'inclusion, Extraction et Gestion des Connaissances 17, 461-472

Phd and Habilitation thesis

  1. [1993] A.-C. Caron, Structures et Décision en Réécriture, Laboratoire d'Informatique Fondamentale de Lille





Valid HTML 4.01! Valid CSS!