Jean-Marc Talbot

Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot: Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. Developments in Language Theory 2012: 226-238

Séverine Fratani, Jean-Marc Talbot: An Accurate Type System for Information Flow in Presence of Arrays. FMOODS/FORTE 2011: 153-167

Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Tree Automata with Global Constraints. Int. J. Found. Comput. Sci. 21(4): 571-596 (2010)

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot: Properties of Visibly Pushdown Transducers. MFCS 2010: 355-367

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot: On Functionality of Visibly Pushdown Transducers. CoRR abs/1002.1443 (2010)

Françoise Gire, Jean-Marc Talbot: Nested Sibling Tree Automata. ITA 43(2): 379-402 (2009)

Dorina Ghindici, Isabelle Simplot-Ryl, Jean-Marc Talbot: A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs. FSEN 2009: 355-370

Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Tree Automata with Global Constraints. Developments in Language Theory 2008: 314-326

Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison: Satisfiability of a Spatial Logic with Tree Variables. CSL 2007: 130-145

Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Polynomial time fragments of XPath with variables. PODS 2007: 205-214

Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison: Composing Monadic Queries in Trees. PLAN-X 2006: 61-70

Iovka Boneva, Jean-Marc Talbot: When ambients cannot be opened. Theor. Comput. Sci. 333(1-2): 127-169 (2005)

Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-ary Queries by Tree Automata. Foundations of Semistructured Data 2005

Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison: N-Ary Queries by Tree Automata. DBPL 2005: 217-231

Iovka Boneva, Jean-Marc Talbot, Sophie Tison: Expressiveness of a Spatial Logic for Trees. LICS 2005: 280-289

Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos: Monotone AC-Tree Automata. LPAR 2005: 337-351

Iovka Boneva, Jean-Marc Talbot: Automata and Logics for Unranked and Unordered Trees. RTA 2005: 500-515

Iovka Boneva, Jean-Marc Talbot: On Complexity of Model-Checking for the TQL Logic. IFIP TCS 2004: 381-394

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)

Iovka Boneva, Jean-Marc Talbot: When Ambients Cannot Be Opened. FoSSaCS 2003: 169-184

Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot: Finite-Control Mobile Ambients. ESOP 2002: 295-313

Witold Charatonik, Jean-Marc Talbot: Atomic Set Constraints with Projection. RTA 2002: 311-325

Witold Charatonik, Jean-Marc Talbot: The Decidability of Model Checking Mobile Ambients. CSL 2001: 339-354

Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot: The Complexity of Model Checking Mobile Ambients. FoSSaCS 2001: 152-167

Jean-Marc Talbot, Philippe Devienne, Sophie Tison: Generalized Definite Set Constraints. Constraints 5(1/2): 161-202 (2000)

Jean-Marc Talbot: The forall-exists² fragment of the first-order theory of atomic set constraints is Pi⁰₁-hard. Inf. Process. Lett. 74(1-2): 27-33 (2000)

Jean-Marc Talbot: On the Alternation-Free Horn Mu-calculus. LPAR 2000: 418-435

Witold Charatonik, Andreas Podelski, Jean-Marc Talbot: Paths vs. Trees in Set-Based Program Analysis. POPL 2000: 330-337

Joachim Niehren, Martin Müller, Jean-Marc Talbot: Entailment of Atomic Set Constraints is PSPACE-Complete. LICS 1999: 285-294

Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Co-definite Set Constraints with Membership Expressions. IJCSLP 1998: 25-39

Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Solving Classes of Set Constraints with Tree Automata. CP 1997: 62-76

Jean-Marc Talbot, Sophie Tison, Philippe Devienne: Set-Based Analysis for Logic Programming and Tree Automata. SAS 1997: 127-140

Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot: On Theorem-Proving in Horn Theories with Built-in Algebras. AISMC 1996: 320-338