Jean-Marc Talbot
Person information
- affiliation: LIFL Lille, France
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2016
- [j8]Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Transducers with Well-Nested Outputs. Int. J. Found. Comput. Sci. 27(2): 235-258 (2016) - [c32]Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot:
Two-Way Visibly Pushdown Automata and Transducers. LICS 2016: 217-226 - [c31]Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot:
A Generalised Twinning Property for Minimisation of Cost Register Automata. LICS 2016: 857-866 - [c30]Clara Bertolissi, Jean-Marc Talbot, Didier Villevalois:
Analysis of access control policy updates through narrowing. PPDP 2016: 62-75 - [e1]Jean-Marc Talbot, Laurent Regnier:
25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France. LIPIcs 62, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2016, ISBN 978-3-95977-022-4 [contents] - [i3]Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot:
Two-Way Visibly Pushdown Automata and Transducers. CoRR abs/1606.00234 (2016) - 2015
- [j7]Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Trimming visibly pushdown automata. Theor. Comput. Sci. 578: 13-29 (2015) - [c29]Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision Problems of Tree Transducers with Origin. ICALP (2) 2015: 209-221 - 2014
- [c28]Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Transducers with Well-Nested Outputs. Developments in Language Theory 2014: 129-141 - 2013
- [c27]Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Trimming Visibly Pushdown Automata. CIAA 2013: 84-96 - [c26]Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot:
Expressiveness of Visibly Pushdown Transducers. TTATT 2013: 17-26 - 2012
- [c25]Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. Developments in Language Theory 2012: 226-238 - 2011
- [c24]Séverine Fratani, Jean-Marc Talbot:
An Accurate Type System for Information Flow in Presence of Arrays. FMOODS/FORTE 2011: 153-167 - 2010
- [j6]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Tree Automata with Global Constraints. Int. J. Found. Comput. Sci. 21(4): 571-596 (2010) - [c23]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 - [i2]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)
2000 – 2009
- 2009
- [j5]
- [c22]Dorina Ghindici, Isabelle Simplot-Ryl, Jean-Marc Talbot:
A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs. FSEN 2009: 355-370 - 2008
- [c21]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Tree Automata with Global Constraints. Developments in Language Theory 2008: 314-326 - 2007
- [c20]Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Satisfiability of a Spatial Logic with Tree Variables. CSL 2007: 130-145 - [c19]Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison:
Polynomial time fragments of XPath with variables. PODS 2007: 205-214 - 2006
- [c18]Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison:
Composing Monadic Queries in Trees. PLAN-X 2006: 61-70 - 2005
- [b1]Jean-Marc Talbot:
Model-checking pour les ambients : des algèbres de processus aux données semi-structurées. Lille University of Science and Technology, France 2005 - [j4]Iovka Boneva, Jean-Marc Talbot:
When ambients cannot be opened. Theor. Comput. Sci. 333(1-2): 127-169 (2005) - [c17]Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison:
N-Ary Queries by Tree Automata. DBPL 2005: 217-231 - [c16]Iovka Boneva, Jean-Marc Talbot, Sophie Tison:
Expressiveness of a Spatial Logic for Trees. LICS 2005: 280-289 - [c15]Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos:
Monotone AC-Tree Automata. LPAR 2005: 337-351 - [c14]Iovka Boneva, Jean-Marc Talbot:
Automata and Logics for Unranked and Unordered Trees. RTA 2005: 500-515 - [i1]Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison:
N-ary Queries by Tree Automata. Foundations of Semistructured Data 2005 - 2004
- [c13]Iovka Boneva, Jean-Marc Talbot:
On Complexity of Model-Checking for the TQL Logic. IFIP TCS 2004: 381-394 - 2003
- [j3]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) - [c12]
- 2002
- [c11]Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot:
Finite-Control Mobile Ambients. ESOP 2002: 295-313 - [c10]
- 2001
- [c9]Witold Charatonik, Jean-Marc Talbot:
The Decidability of Model Checking Mobile Ambients. CSL 2001: 339-354 - [c8]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
- [j2]Jean-Marc Talbot, Philippe Devienne, Sophie Tison:
Generalized Definite Set Constraints. Constraints 5(1/2): 161-202 (2000) - [j1]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) - [c7]
- [c6]Witold Charatonik, Andreas Podelski, Jean-Marc Talbot:
Paths vs. Trees in Set-Based Program Analysis. POPL 2000: 330-337
1990 – 1999
- 1999
- [c5]Joachim Niehren, Martin Müller, Jean-Marc Talbot:
Entailment of Atomic Set Constraints is PSPACE-Complete. LICS 1999: 285-294 - 1998
- [c4]Philippe Devienne, Jean-Marc Talbot, Sophie Tison:
Co-definite Set Constraints with Membership Expressions. IJCSLP 1998: 25-39 - 1997
- [c3]Philippe Devienne, Jean-Marc Talbot, Sophie Tison:
Solving Classes of Set Constraints with Tree Automata. CP 1997: 62-76 - [c2]Jean-Marc Talbot, Sophie Tison, Philippe Devienne:
Set-Based Analysis for Logic Programming and Tree Automata. SAS 1997: 127-140 - 1996
- [c1]Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot:
On Theorem-Proving in Horn Theories with Built-in Algebras. AISMC 1996: 320-338
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-26 16:08 CEST by the dblp team