Jean-Marc Talbot
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
29
Venues
17
Active years
1996–2026
Best venue rank
A*
Where they publish
Papers
29 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CSL | Reasoning About Quality in Hyperproperties. | Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot |
| 2024 | SECRYPT | Solving Access Control Conflicts in Multi-User Systems. | Alba Martinez Anton, Clara Bertolissi, Jean-Marc Talbot |
| 2022 | CSL | Weighted Automata and Expressions over Pre-Rational Monoids. | Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2019 | FOSSACS | Two-Way Parikh Automata with a Visibly Pushdown Stack. | Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot |
| 2019 | MFCS | Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. | Thodore Lopez, Benjamin Monmege, Jean-Marc Talbot |
| 2016 | LICS | Two-Way Visibly Pushdown Automata and Transducers. | Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2016 | LICS | A Generalised Twinning Property for Minimisation of Cost Register Automata. | Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2016 | PPDP | Analysis of access control policy updates through narrowing. | Clara Bertolissi, Jean-Marc Talbot, Didier Villevalois |
| 2015 | ICALP | Decision Problems of Tree Transducers with Origin. | Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2014 | DLT | Visibly Pushdown Transducers with Well-Nested Outputs. | Pierre-Alain Reynier, Jean-Marc Talbot |
| 2012 | DLT | Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. | Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2011 | FORTE | An Accurate Type System for Information Flow in Presence of Arrays. | Sverine Fratani, Jean-Marc Talbot |
| 2010 | MFCS | Properties of Visibly Pushdown Transducers. | Emmanuel Filiot, Jean-Franois Raskin, Pierre-Alain Reynier, Frdric Servais, Jean-Marc Talbot |
| 2008 | DLT | Tree Automata with Global Constraints. | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
| 2007 | CSL | Satisfiability of a Spatial Logic with Tree Variables. | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
| 2007 | PODS | Polynomial time fragments of XPath with variables. | Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison |
| 2005 | LICS | Expressiveness of a Spatial Logic for Trees. | Iovka Boneva, Jean-Marc Talbot, Sophie Tison |
| 2005 | LPAR | Monotone AC-Tree Automata. | Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos |
| 2003 | FOSSACS | When Ambients Cannot Be Opened. | Iovka Boneva, Jean-Marc Talbot |
| 2002 | ESOP | Finite-Control Mobile Ambients. | Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot |
| 2001 | CSL | The Decidability of Model Checking Mobile Ambients. | Witold Charatonik, Jean-Marc Talbot |
| 2001 | FOSSACS | The Complexity of Model Checking Mobile Ambients. | Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot |
| 2000 | LPAR | On the Alternation-Free Horn Mu-calculus. | Jean-Marc Talbot |
| 2000 | POPL | Paths vs. Trees in Set-Based Program Analysis. | Witold Charatonik, Andreas Podelski, Jean-Marc Talbot |
| 1999 | LICS | Entailment of Atomic Set Constraints is PSPACE-Complete. | Joachim Niehren, Martin Mller, Jean-Marc Talbot |
| 1998 | ICLP | Co-definite Set Constraints with Membership Expressions. | Philippe Devienne, Jean-Marc Talbot, Sophie Tison |
| 1997 | CP | Solving Classes of Set Constraints with Tree Automata. | Philippe Devienne, Jean-Marc Talbot, Sophie Tison |
| 1997 | SAS | Set-Based Analysis for Logic Programming and Tree Automata. | Jean-Marc Talbot, Sophie Tison, Philippe Devienne |
| 1996 | AISC | On Theorem-Proving in Horn Theories with Built-in Algebras. | Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot |