| # |  | Year | Author(s) [non member] | Editor(s) [non member] | | Title | Type | |
|---|
| 11 |
 | Talbot, Jean-Marc |
| |
| | 2003 | Charatonik, Witold
[Dal Zilio, Silvano]
[Gordon, Andrew Donald]
[Mukhopadhyay, Supratik]
[Talbot, Jean-Marc] | | | Model checking mobile ambients
In: Theoretical Computer Science [308], 277-331 | Journal Article | |
| | 2002 | Charatonik, Witold
[Gordon, Andrew Donald]
[Talbot, Jean-Marc] | [Le Métayer, Daniel] | | Finite-Control Mobile Ambients
In: Programming languages and systems: 11th European Symposium on Programming, ESOP 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, 295-313 | Proceedings Article | |
| | 2002 | Charatonik, Witold
[Talbot, Jean-Marc] | [Tison, Sophie] | | Atomic Set Constraints with Projection
In: Rewriting Techniques and Applications. 13th International Conference, RTA 2002, 311-325 | Proceedings Article | |
| | 2001 | Charatonik, Witold
[Dal Zilio, Silvano]
[Gordon, Andrew Donald]
Mukhopadhyay, Supratik
[Talbot, Jean-Marc] | | | The Complexity of Model Checking Mobile Ambients | Report | |
| | 2001 | Charatonik, Witold
[Dal Zilio, Silvano]
[Gordon, Andrew Donald]
Mukhopadhyay, Supratik
Talbot, Jean-Marc | [Honsell, Furio]
[Miculan, Marino] | | The Complexity of Model Checking Mobile Ambients
In: Foundations of Software Science and Computation Structures. Proceedings of the 4th International Conference (FOSSACS-01). Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS-01), 152-167 | Proceedings Article | |
| | 2001 | Charatonik, Witold
[Talbot, Jean-Marc] | Fribourg, Laurent | | The Decidability of Model Checking Mobile Ambients
In: Computer science logic (CSL-01) : 15th International Workshop, CSL 2001, Annual Conference of the EACSL, 339-354 | Proceedings Article | |
| | 2000 | Charatonik, Witold
Podelski, Andreas
Talbot, Jean-Marc | | | Paths vs. Trees in Set-based Program Analysis
In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), 330-337 | Proceedings Article | |
| | 2000 | Talbot, Jean-Marc | | | The $\exists \forall^2$ fragment of the First-Order Theory of Set Constraints is $\pi^0_1$-hard
In: Information Processing Letters [74], 27-33 | Journal Article | |
| | 2000 | Talbot, Jean-Marc
[Devienne, Philippe]
[Tison, Sophie] | | | Generalized Definite Set Constraints
In: Constraints [5], 161-202 | Journal Article | |
| | 2000 | Talbot, Jean-Marc | [Parigot, Michel]
[Voronkov, Andrei] | | On the Alternation-free Horn mu-calculus
In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR-2000), 418-435 | Proceedings Article | |
| | 1999 | Talbot, Jean-Marc
[Niehren, Joachim]
[Müller, Martin] | [Longo, Giuseppe] | | Entailment of Atomic Set Constraints is PSPACE-Complete
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 285-294 | Proceedings Article | |
| 1 |
 | Tammet, Tanel |
| |
| 1 |
| |
| 1 |
| Tan, Hongyan |
| |
| 11 |
| |
| 1 |
| Tari, Zahir (ed.) |
| |
| 4 |
| |
| 1 |
| Tchuente, M. (ed.) |
| |
| 1 |
| |
| 2 |
| Theobalt, Christian |
| |
| 1 |
| |
| 1 |
| Thiebaux, Sylvie |
| |
| 1 |
| |
| 1 |
| Thomas, Wolfgang (ed.) |
| |
| 1 |
| |
| 1 |
| Timm, Jan-Georg |
| |
| 5 |
| |
| 6 |
| Tishkovsky, Dmitry |
| |
| 1 |
| |
