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

BibTex

Sophie Tison s Publications

International Journals

  1. [2010] Olivier Gauwin and Joachim Niehren and Sophie Tison, Queries on XML Streams with Bounded Delay and Concurrency, Information and Computation
  2. [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
  3. [2002] M. Dauchet and S. Tison and M. Tommasi, Recognizable tree languages and non-linear morphisms, Theoretical Computer Science 281, 219--234
  4. [2001] F. Seynhaeve and S. Tison and M. Tommasi and R. Treinen, Grid structures and undecidable constraint theories, Theoretical Computer Science 258, 453--490
  5. [2000] Joachim Niehren and Ralf Treinen and Sophie Tison, On Rewrite Constraints and Context Unification, Information Processing Letters 1-2 74, 35--40
  6. [2000] J.-M. Talbot and P. Devienne and S. Tison, Generalized Definite Set Constraints, Constraints, an International Journal 1-2 5, 161-202
  7. [1999] R. Gilleron and S. Tison and M. Tommasi, Set constraints and automata, Information and Computation 149, 1 -- 41
  8. [1995] R. Gilleron and S. Tison, Regular Tree Languages and Rewrite Systems, Fundamenta Informaticae 24, 157--176

International Conferences

  1. [2009] Olivier Gauwin and Joachim Niehren and Sophie Tison, Earliest Query Answering for Deterministic Nested Word Automata, 17th International Symposium on Fundamentals of Computer Theory, Lecture Notes in Computer Science 5699, 121--132
  2. [2009] Olivier Gauwin and Joachim Niehren and Sophie Tison, Bounded Delay and Concurrency for Earliest Query Answering, 3rd International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 5457, 350-361
  3. [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
  4. [2008] Guillem Godoy and Sebastian Maneth and Sophie Tison, Classes of Tree Homomorphisms with Decidable Preservation of Regularity, Eleventh International Conference on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 4962, 127-141
  5. [2008] Emmanuel Filiot and Sophie Tison, Regular n-ary Queries in Trees and Variable Independence, 5th IFIP International Conference on Theoretical Computer Science 273, 429-443
  6. [2008] Emmanuel Filiot and Jean-Marc Talbot and Sophie Tison, Tree Automata with Global Constraints, 12th International Conference on Developments in Language Theory (DLT), Lecture Notes in Computer Science 5257, 314-326
  7. [2007] Guillem Godoy and Sophie Tison, On the Normalization and Unique Normalization Properties of Term Rewrite Systems, International Conference on Automated Deduction, Lecture Notes in Computer Science 4603, 247-262
  8. [2007] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Polynomial Time Fragments of XPath with Variables, 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 205-214
  9. [2007] Emmanuel Filiot and Jean-Marc Talbot and Sophie Tison, Satisfiability of a Spatial Logic with Tree Variables, 16th EACSL Annual Conference on Computer Science and Logic, Lecture Notes in Computer Science 4646, 130-145
  10. [2005] Joachim Niehren and Laurent Planque and Jean-Marc Talbot and Sophie Tison, N-ary Queries by Tree Automata, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 217--231
  11. [2005] Iovka Boneva and Jean-Marc Talbot and Sophie Tison, Expressiveness of a spatial logic for trees, 20th Annual IEEE Symposium on Logic in Computer Science, 280--289
  12. [2005] Hitoshi Ohsaki and Jean-Marc Talbot and Sophie Tison and Yves Roos, Monotone AC-Tree Automata, 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning, Lecture Notes in Computer Science 3835, 337-351
  13. [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
  14. [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
  15. [1999] F. Seynhaeve and S. Tison and M. Tommasi, Homomorphisms and Concurrent Term Rewriting, Proceedings of the twelfth International Conference on Fundamentals of Computation theory, Lecture Notes in Computer Science 1684, 475-487
  16. [1999] Bruno Bogaert and Franck Seynhaeve and Sophie Tison, The Recognizability Problem for Tree Automata with Comparisons, Foundations of Software Science and Computation Structure, FoSSaCS99, Lecture Notes in Computer Science 1578, 150-164
  17. [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
  18. [1998] Philippe Devienne and Jean-Marc Talbot and Sophie Tison, Co-definite Set Constraints with Membership Expressions., IJCSLP, 25-39
  19. [1997] Philippe Devienne and Jean-Marc Talbot and Sophie Tison, Set-Based Analysis for Logic Programming and Tree Automata., Static Analysis, 4th International Symposium, SAS '97, Lecture Notes in Computer Science 1302, 127-140
  20. [1997] P. Devienne and J.-M. Talbot and S. Tison, Solving Classes of Set Constraints with Tree Automata, 3th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, 62-76
  21. [1994] R. Gilleron and S. Tison and M. Tommasi, Some new decidability results on positive and negative set constraints., ccl94, 336--351
  22. [1993] R. Gilleron and S. Tison and M. Tommasi, Solving systems of set constraints with negated subset relationships, Proceedings of the 34th Symp. on Foundations of Computer Science, 372--380
  23. [1993] R. Gilleron and S. Tison and M. Tommasi, Solving systems of set constraints using tree automata, STACS93, 505--514
  24. [1992] M. Dauchet and S. Tison, Structural Complexity of Classes of Tree Languages, Tree Automata and Languages, 327--353
  25. [1992] B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, International Symposium on Theoretical Aspacts of Computeter Science, 161--171
  26. [1990] M. Dauchet and S. Tison, The Theory of Ground Rewrite Systems is Decidable, IEEE Conference on Logic in Computer Science, 242--248
  27. [1989] Max Dauchet and Sophie Tison, Finite Automata, Algorithms and Software Design, International Conference on Algebraic Methodology And Software Technology
  28. [1989] Max Dauchet and Sophie Tison and Thierry Heuillard and Pierre Lescanne, Decidability of the Confluence of Ground Term Rewriting Systems, IEEE Symposium on Logics in Computer Science, 353--359
  29. [1989] J.L. Coquidé and M. Dauchet and S. Tison, About connections between syntaxical and Computational Complexity, International Symposium on Fundamentals of Computing Theory, Lecture Notes in Computer Science
  30. [1988] Sophie Tison, Fair Termination is Decidable for Ground Systems, International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, 462--476
  31. [1985] M. Dauchet and S. Tison, Tree automata and decidability in ground term rewriting systems, International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science 199, 80--84

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. [2006] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Composing Monadic Queries in Trees, PLAN-X International Workshop, 61--70

French Conferences

  1. [2004] Denis Debarbieux and Yves Roos and Sophie Tison, Models of Path Constraints, 10ièmes Journées Montoises d'Informatique Théorique

Books or Book Chapters

  1. [2007] Hubert Comon and Max Dauchet and Rémi Gilleron and Christof Löding and Florent Jacquemard and Denis Lugiez and Sophie Tison and Marc Tommasi, Tree Automata Techniques and Applications, Available online since 1997: \urlhttp://tata.gforge.inria.fr
  2. [1997] H. Comon and M. Dauchet and R. Gilleron and F. Jacquemard and D. Lugiez and S. Tison and M. Tommasi, Tree Automata Techniques and Applications, Available on: http://www.grappa.univ-lille3.fr/tata

Others

  1. [1990] S. Tison, Automates Comme Outils de Décision dans les Arbres., Laboratoire d'Informatique Fondamentale de Lille
  2. [1990] M. Dauchet and S. Tison, Réduction de la non-linéarite des morphismes d'arbres IT-196
  3. [1988] S. Tison, It is Undecidable Whether A Rewriting System Preserves Recognizability IT-136





Valid HTML 4.01! Valid CSS!