| | |
Jean Goubault
École Normale Supérieure de Cachan
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 55 |      | Olivier Bouissou, Eric Goubault, Jean Goubault-Larrecq, Sylvie Putot: A generalization of p-boxes to affine arithmetic. Computing 94(2-4): 189-201 (2012) |
| 54 | | Jean Goubault-Larrecq: QRB-Domains and the Probabilistic Powerdomain Logical Methods in Computer Science 8(1): (2012) |
| 2011 | ||
| 53 | | Jean Goubault-Larrecq, Daniele Varacca: Continuous Random Variables. LICS 2011: 97-106 |
| 52 | | Jean Goubault-Larrecq, Klaus Keimel: Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. Mathematical Structures in Computer Science 21(3): 511-561 (2011) |
| 51 | | Jean Goubault-Larrecq: Musings around the geometry of interaction, and coherence. Theor. Comput. Sci. 412(20): 1998-2014 (2011) |
| 2010 | ||
| 50 | | Hedi Benzina, Jean Goubault-Larrecq: Some Ideas on Virtualized System Security, and Monitors. DPM/SETOP 2010: 244-258 |
| 49 | | Jean Goubault-Larrecq: Noetherian Spaces in Verification. ICALP (2) 2010: 2-21 |
| 48 | | Jean Goubault-Larrecq: omega-QRB-Domains and the Probabilistic Powerdomain. LICS 2010: 352-361 |
| 47 | | Jean Goubault-Larrecq: Finite models for formal security proofs. Journal of Computer Security 18(6): 1247-1299 (2010) |
| 46 | | Jean Goubault-Larrecq: De Groot duality and models of choice: angels, demons and nature. Mathematical Structures in Computer Science 20(2): 169-237 (2010) |
| 2009 | ||
| 45 | | Jean Goubault-Larrecq: "Logic Wins!". ASIAN 2009: 1-16 |
| 44 | | Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) 2009: 188-199 |
| 43 | | Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part I: Completions. STACS 2009: 433-444 |
| 42 | | Alain Finkel, Jean Goubault-Larrecq: Forward analysis for WSTS, Part I: Completions CoRR abs/0902.1587: (2009) |
| 2008 | ||
| 41 | | Jean Goubault-Larrecq: Towards Producing Formally Checkable Security Proofs, Automatically. CSF 2008: 224-238 |
| 40 | | Jean Goubault-Larrecq: Prevision Domains and Convex Powercones. FoSSaCS 2008: 318-333 |
| 39 | | Jean Goubault-Larrecq: Simulation Hemi-metrics between Infinite-State Stochastic Games. FoSSaCS 2008: 50-65 |
| 38 | | Jean Goubault-Larrecq, Julien Olivain: A Smell of Orchids. RV 2008: 1-20 |
| 37 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical relations for monadic types. Mathematical Structures in Computer Science 18(6): 1169-1217 (2008) |
| 2007 | ||
| 36 | | Jean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina: A Probabilistic Applied Pi-Calculus. APLAS 2007: 175-190 |
| 35 | | Elie Bursztein, Jean Goubault-Larrecq: A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. ASIAN 2007: 212-227 |
| 34 | | Jean Goubault-Larrecq: Continuous Previsions. CSL 2007: 542-557 |
| 33 | | Jean Goubault-Larrecq: Continuous Capacities on Continuous State Spaces. ICALP 2007: 764-776 |
| 32 | | Jean Goubault-Larrecq: On Noetherian Spaces. LICS 2007: 453-462 |
| 31 | | Kumar Neeraj Verma, Jean Goubault-Larrecq: Alternating two-way AC-tree automata. Inf. Comput. 205(6): 817-869 (2007) |
| 2005 | ||
| 30 | | Julien Olivain, Jean Goubault-Larrecq: The Orchids Intrusion Detection Tool. CAV 2005: 286-290 |
| 29 | | Jean Goubault-Larrecq, Fabrice Parrennes: Cryptographic Protocol Analysis on Real C Code. VMCAI 2005: 363-379 |
| 28 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical Relations for Monadic Types CoRR abs/cs/0511006: (2005) |
| 27 | | Kumar Neeraj Verma, Jean Goubault-Larrecq: Karp-Miller Trees for a Branching Extension of VASS. Discrete Mathematics & Theoretical Computer Science 7(1): 217-230 (2005) |
| 26 | | Jean Goubault-Larrecq: Deciding H1 by resolution. Inf. Process. Lett. 95(3): 401-408 (2005) |
| 25 | | Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma: Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. J. Log. Algebr. Program. 64(2): 219-251 (2005) |
| 24 | | Jean Goubault-Larrecq: Extensions of valuations. Mathematical Structures in Computer Science 15(2): 271-297 (2005) |
| 2004 | ||
| 23 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang: Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004: 400-414 |
| 2002 | ||
| 22 | | Jean Goubault-Larrecq: Higher-Order Positive Set Constraints. CSL 2002: 473-489 |
| 21 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical Relations for Monadic Types. CSL 2002: 553-568 |
| 2001 | ||
| 20 | | Muriel Roger, Jean Goubault-Larrecq: Log Auditing through Model-Checking. CSFW 2001: 220- |
| 19 | | Jean Goubault-Larrecq: Well-Founded Recursive Relations. CSL 2001: 484-497 |
| 18 | | Xavier Rival, Jean Goubault-Larrecq: Experiments with Finite Tree Automata in Coq. TPHOLs 2001: 362-377 |
| 17 | | Jean Goubault-Larrecq: Preface. Electr. Notes Theor. Comput. Sci. 55(1): 101-102 (2001) |
| 2000 | ||
| 16 | | Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar: Reflecting BDDs in Coq. ASIAN 2000: 162-181 |
| 15 | | Jean Goubault-Larrecq: A Method for Automatic Cryptographic Protocol Verification. IPDPS Workshops 2000: 977-984 |
| 14 | | Healfdene Goguen, Jean Goubault-Larrecq: Sequent combinators: a Hilbert system for the lambda calculus. Mathematical Structures in Computer Science 10(1): 1-79 (2000) |
| 1999 | ||
| 13 | | Jean Goubault-Larrecq: A Simple Sequent System for First-Order Logic with Free Constructors. TABLEAUX 1999: 202-216 |
| 1998 | ||
| 12 | | Jean Goubault-Larrecq: Conjunctive Types and SKInT. TYPES 1998: 106-120 |
| 1997 | ||
| 11 | | Jean Goubault-Larrecq: Ramified Higher-Order Unification. LICS 1997: 410-421 |
| 10 | | Peter H. Schmitt, Jean Goubault-Larrecq: A Tableau System for Linear-TIME Temporal Logic. TACAS 1997: 130-144 |
| 1996 | ||
| 9 | | Jean Goubault-Larrecq: A Proof of Weak Termination of Typed lambda-sigma-Calculi. TYPES 1996: 134-153 |
| 1995 | ||
| 8 | | Jean Goubault: A BDD-Based Simplification and Skolemization Procedure. Logic Journal of the IGPL 3(6): 827-855 (1995) |
| 1994 | ||
| 7 | | Jean Goubault: Proving with BDDs and Control of Information. CADE 1994: 499-513 |
| 6 | | Jean Goubault, Joachim Posegga: BDDs and Automated Deduction. ISMIS 1994: 541-550 |
| 5 | | Jean Goubault: Rigid E-Unifiability is DEXPTIME-Complete LICS 1994: 498-506 |
| 4 | | Jean Goubault: Higher-Order Rigid E-Unification. LPAR 1994: 129-143 |
| 3 | | Jean Goubault: Generalized Boxings, Congruences and Partial Inlining. SAS 1994: 147-161 |
| 2 | | Jean Goubault: The Complexity of Resource-Bounded First-Order Classical Logic. STACS 1994: 59-70 |
| 1993 | ||
| 1 | | Jean Goubault: A Rule-based Algorithm for Rigid E-Unification. Kurt Gödel Colloquium 1993: 202-210 |
| 1 | S. Arun-Kumar | [16] |
| 2 | Hedi Benzina | [50] |
| 3 | Olivier Bouissou | [55] |
| 4 | Elie Bursztein | [35] |
| 5 | Alain Finkel | [42] [43] [44] |
| 6 | Healfdene Goguen | [14] |
| 7 | Eric Goubault | [55] |
| 8 | Klaus Keimel | [52] |
| 9 | Slawomir Lasota | [21] [23] [28] [37] |
| 10 | David Nowak | [21] [23] [28] [37] |
| 11 | Julien Olivain | [30] [38] |
| 12 | Catuscia Palamidessi | [36] |
| 13 | Fabrice Parrennes | [29] |
| 14 | Joachim Posegga | [6] |
| 15 | Sanjiva Prasad | [16] |
| 16 | Sylvie Putot | [55] |
| 17 | Xavier Rival | [18] |
| 18 | Muriel Roger | [20] [25] |
| 19 | Peter H. Schmitt | [10] |
| 20 | Angelo Troina | [36] |
| 21 | Daniele Varacca | [53] |
| 22 | Kumar Neeraj Verma | [16] [25] [27] [31] |
| 23 | Yu Zhang | [23] |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page