BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × France
1 × Germany
1 × Hungary
1 × Italy
1 × Japan
1 × Spain
1 × Switzerland
1 × The Netherlands
2 × Serbia
2 × United Kingdom
4 × USA
Collaborated with:
J.Talbot ∅ E.Filiot G.Godoy M.Dauchet P.Devienne J.Niehren F.Seynhaeve O.Gauwin S.Maneth I.Boneva B.Bogaert A.Caron M.Tommasi T.Heuillard P.Lescanne
Talks about:
tree (10) automata (7) rewrit (7) constraint (5) system (5) decid (5) term (5) ground (3) logic (3) variabl (2)

Person: Sophie Tison

DBLP DBLP: Tison:Sophie

Facilitated 1 volumes:

RTA 2002Ed

Contributed to:

RTA 20112011
TLCA 20112011
LATA 20092009
DLT 20082008
DLT 20082010
FoSSaCS 20082008
CADE 20072007
CSL 20072007
PODS 20072007
LICS 20052005
RTA 20002000
FoSSaCS 19991999
RTA 19991999
JICSLP 19981998
SAS 19971997
LICS 19901990
RTA 19891989
LICS 19871987

Wrote 18 papers:

RTA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what
Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What’s New? (ST), pp. 1–2.
TLCA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what
Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.
LATA-2009-GauwinNT #bound #concurrent #query
Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.
DLT-2008-FiliotTT #automaton #constraints
Tree Automata with Global Constraints (EF, JMT, ST), pp. 314–326.
DLT-J-2008-FiliotTT10 #automaton #constraints
Tree Automata with Global Constraints (EF, JMT, ST), pp. 571–596.
FoSSaCS-2008-GodoyMT #decidability #morphism
Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
CADE-2007-GodoyT #normalisation #on the #term rewriting
On the Normalization and Unique Normalization Properties of Term Rewrite Systems (GG, ST), pp. 247–262.
CSL-2007-FiliotTT #logic #satisfiability
Satisfiability of a Spatial Logic with Tree Variables (EF, JMT, ST), pp. 130–145.
PODS-2007-FiliotNTT #polynomial #xpath
Polynomial time fragments of XPath with variables (EF, JN, JMT, ST), pp. 205–214.
LICS-2005-BonevaTT #logic
Expressiveness of a Spatial Logic for Trees (IB, JMT, ST), pp. 280–289.
RTA-2000-Tison #automaton #term rewriting
Tree Automata and Term Rewrite Systems (ST), pp. 27–30.
FoSSaCS-1999-BogaertST #automaton #problem
The Recognizability Problem for Tree Automata with Comparisons between Brothers (BB, FS, ST), pp. 150–164.
RTA-1999-CaronSTT #quantifier #satisfiability
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
JICSLP-1998-DevienneTT #constraints #set
Co-definite Set Constraints with Membership Expressions (PD, JMT, ST), pp. 25–39.
SAS-1997-TalbotTD #analysis #automaton #logic programming
Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.
LICS-1990-DauchetT #decidability #formal method #term rewriting
The Theory of Ground Rewrite Systems is Decidable (MD, ST), pp. 242–248.
RTA-1989-Tison #decidability #termination
Fair Termination is Decidable for Ground Systems (ST), pp. 462–476.
LICS-1987-DauchetTHL #confluence #decidability #term rewriting
Decidability of the Confluence of Ground Term Rewriting Systems (MD, ST, TH, PL), pp. 353–359.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.