2008 |
26 | EE | Emmanuel Filiot,
Jean-Marc Talbot,
Sophie Tison:
Tree Automata with Global Constraints.
Developments in Language Theory 2008: 314-326 |
2007 |
25 | EE | Emmanuel Filiot,
Jean-Marc Talbot,
Sophie Tison:
Satisfiability of a Spatial Logic with Tree Variables.
CSL 2007: 130-145 |
24 | EE | Emmanuel Filiot,
Joachim Niehren,
Jean-Marc Talbot,
Sophie Tison:
Polynomial time fragments of XPath with variables.
PODS 2007: 205-214 |
2006 |
23 | | Emmanuel Filiot,
Joachim Niehren,
Jean-Marc Talbot,
Sophie Tison:
Composing Monadic Queries in Trees.
PLAN-X 2006: 61-70 |
2005 |
22 | EE | Joachim Niehren,
Laurent Planque,
Jean-Marc Talbot,
Sophie Tison:
N-Ary Queries by Tree Automata.
DBPL 2005: 217-231 |
21 | EE | Joachim Niehren,
Laurent Planque,
Jean-Marc Talbot,
Sophie Tison:
N-ary Queries by Tree Automata.
Foundations of Semistructured Data 2005 |
20 | EE | Iovka Boneva,
Jean-Marc Talbot,
Sophie Tison:
Expressiveness of a Spatial Logic for Trees.
LICS 2005: 280-289 |
19 | EE | Hitoshi Ohsaki,
Jean-Marc Talbot,
Sophie Tison,
Yves Roos:
Monotone AC-Tree Automata.
LPAR 2005: 337-351 |
18 | EE | Iovka Boneva,
Jean-Marc Talbot:
Automata and Logics for Unranked and Unordered Trees.
RTA 2005: 500-515 |
17 | EE | Iovka Boneva,
Jean-Marc Talbot:
When ambients cannot be opened.
Theor. Comput. Sci. 333(1-2): 127-169 (2005) |
2004 |
16 | | Iovka Boneva,
Jean-Marc Talbot:
On Complexity of Model-Checking for the TQL Logic.
IFIP TCS 2004: 381-394 |
2003 |
15 | EE | Iovka Boneva,
Jean-Marc Talbot:
When Ambients Cannot Be Opened.
FoSSaCS 2003: 169-184 |
14 | EE | Witold Charatonik,
Silvano Dal-Zilio,
Andrew D. Gordon,
Supratik Mukhopadhyay,
Jean-Marc Talbot:
Model checking mobile ambients.
Theor. Comput. Sci. 308(1-3): 277-331 (2003) |
2002 |
13 | EE | Witold Charatonik,
Andrew D. Gordon,
Jean-Marc Talbot:
Finite-Control Mobile Ambients.
ESOP 2002: 295-313 |
12 | EE | Witold Charatonik,
Jean-Marc Talbot:
Atomic Set Constraints with Projection.
RTA 2002: 311-325 |
2001 |
11 | EE | Witold Charatonik,
Jean-Marc Talbot:
The Decidability of Model Checking Mobile Ambients.
CSL 2001: 339-354 |
10 | EE | Witold Charatonik,
Silvano Dal-Zilio,
Andrew D. Gordon,
Supratik Mukhopadhyay,
Jean-Marc Talbot:
The Complexity of Model Checking Mobile Ambients.
FoSSaCS 2001: 152-167 |
2000 |
9 | EE | Jean-Marc Talbot:
On the Alternation-Free Horn Mu-calculus.
LPAR 2000: 418-435 |
8 | EE | Witold Charatonik,
Andreas Podelski,
Jean-Marc Talbot:
Paths vs. Trees in Set-Based Program Analysis.
POPL 2000: 330-337 |
7 | | Jean-Marc Talbot,
Philippe Devienne,
Sophie Tison:
Generalized Definite Set Constraints.
Constraints 5(1/2): 161-202 (2000) |
6 | EE | Jean-Marc Talbot:
The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard.
Inf. Process. Lett. 74(1-2): 27-33 (2000) |
1999 |
5 | EE | Joachim Niehren,
Martin Müller,
Jean-Marc Talbot:
Entailment of Atomic Set Constraints is PSPACE-Complete.
LICS 1999: 285-294 |
1998 |
4 | | Philippe Devienne,
Jean-Marc Talbot,
Sophie Tison:
Co-definite Set Constraints with Membership Expressions.
IJCSLP 1998: 25-39 |
1997 |
3 | | Philippe Devienne,
Jean-Marc Talbot,
Sophie Tison:
Solving Classes of Set Constraints with Tree Automata.
CP 1997: 62-76 |
2 | | Jean-Marc Talbot,
Sophie Tison,
Philippe Devienne:
Set-Based Analysis for Logic Programming and Tree Automata.
SAS 1997: 127-140 |
1996 |
1 | | Nirina Andrianarivelo,
Wadoud Bousdira,
Jean-Marc Talbot:
On Theorem-Proving in Horn Theories with Built-in Algebras.
AISMC 1996: 320-338 |