|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 11 keywords
|
|
|
|
|
Results
Found 32 publication records. Showing 32 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Séverine Fratani, Jean-Marc Talbot |
An Accurate Type System for Information Flow in Presence of Arrays.  |
FMOODS/FORTE  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
Tree Automata with Global Constraints. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot |
On Functionality of Visibly Pushdown Transducers |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot |
Properties of Visibly Pushdown Transducers. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Françoise Gire, Jean-Marc Talbot |
Nested Sibling Tree Automata. |
ITA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorina Ghindici, Isabelle Simplot-Ryl, Jean-Marc Talbot |
A Sound Analysis for Secure Information Flow Using Abstract Memory Graphs. |
FSEN |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
Tree Automata with Global Constraints. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison |
Satisfiability of a Spatial Logic with Tree Variables. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison |
Polynomial time fragments of XPath with variables. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
N-ary queries, XML, logic, XPath |
| 1 | Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison |
Composing Monadic Queries in Trees. |
PLAN-X |
2006 |
DBLP BibTeX RDF |
|
| 1 | Iovka Boneva, Jean-Marc Talbot |
When ambients cannot be opened. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos |
Monotone AC-Tree Automata. |
LPAR |
2005 |
DBLP DOI BibTeX RDF |
equational tree automata, complexity, decidability, closure properties |
| 1 | Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison |
N-ary Queries by Tree Automata. |
Foundations of Semistructured Data |
2005 |
DBLP BibTeX RDF |
|
| 1 | Iovka Boneva, Jean-Marc Talbot |
Automata and Logics for Unranked and Unordered Trees. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison |
N-Ary Queries by Tree Automata. |
DBPL |
2005 |
DBLP DOI BibTeX RDF |
XML, databases, information extraction, pattern, logic, types, automata |
| 1 | Iovka Boneva, Jean-Marc Talbot, Sophie Tison |
Expressiveness of a Spatial Logic for Trees. |
LICS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Iovka Boneva, Jean-Marc Talbot |
On Complexity of Model-Checking for the TQL Logic. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot |
Model checking mobile ambients. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Iovka Boneva, Jean-Marc Talbot |
When Ambients Cannot Be Opened. |
FoSSaCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Witold Charatonik, Jean-Marc Talbot |
Atomic Set Constraints with Projection. |
RTA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Witold Charatonik, Andrew D. Gordon, Jean-Marc Talbot |
Finite-Control Mobile Ambients. |
ESOP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Witold Charatonik, Jean-Marc Talbot |
The Decidability of Model Checking Mobile Ambients. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot |
The Complexity of Model Checking Mobile Ambients. |
FoSSaCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Marc Talbot |
The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Marc Talbot, Philippe Devienne, Sophie Tison |
Generalized Definite Set Constraints. |
Constraints |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Marc Talbot |
On the Alternation-Free Horn Mu-calculus. |
LPAR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Witold Charatonik, Andreas Podelski, Jean-Marc Talbot |
Paths vs. Trees in Set-Based Program Analysis. |
POPL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Niehren, Martin Müller, Jean-Marc Talbot |
Entailment of Atomic Set Constraints is PSPACE-Complete. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Devienne, Jean-Marc Talbot, Sophie Tison |
Co-definite Set Constraints with Membership Expressions. |
IJCSLP |
1998 |
DBLP BibTeX RDF |
|
| 1 | Jean-Marc Talbot, Sophie Tison, Philippe Devienne |
Set-Based Analysis for Logic Programming and Tree Automata. |
SAS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Devienne, Jean-Marc Talbot, Sophie Tison |
Solving Classes of Set Constraints with Tree Automata. |
CP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Nirina Andrianarivelo, Wadoud Bousdira, Jean-Marc Talbot |
On Theorem-Proving in Horn Theories with Built-in Algebras. |
AISMC |
1996 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #32 of 32 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")