Jean Goubault-Larrecq

Jean Goubault

École Normale Supérieure de Cachan

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j16		Olivier Bouissou, Eric Goubault, Jean Goubault-Larrecq, Sylvie Putot: A generalization of p-boxes to affine arithmetic. Computing 94(2-4): 189-201 (2012)
j15		Jean Goubault-Larrecq: QRB-Domains and the Probabilistic Powerdomain. Logical Methods in Computer Science 8(1) (2012)
j14		Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part II: Complete WSTS. Logical Methods in Computer Science 8(3) (2012)
c39		Alain Finkel, Jean Goubault-Larrecq: The Theory of WSTS: The Case of Complete WSTS. Petri Nets 2012: 3-31
i3		Assalé Adjé, Jean Goubault-Larrecq: Concrete Semantics of Programs with Non-Deterministic and Random Inputs. CoRR abs/1210.2605 (2012)
	2011
j13		Jean Goubault-Larrecq, Klaus Keimel: Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. Mathematical Structures in Computer Science 21(3): 511-561 (2011)
j12		Jean Goubault-Larrecq: Musings around the geometry of interaction, and coherence. Theor. Comput. Sci. 412(20): 1998-2014 (2011)
c38		Jean Goubault-Larrecq, Daniele Varacca: Continuous Random Variables. LICS 2011: 97-106
	2010
j11		Jean Goubault-Larrecq: Finite models for formal security proofs. Journal of Computer Security 18(6): 1247-1299 (2010)
j10		Jean Goubault-Larrecq: De Groot duality and models of choice: angels, demons and nature. Mathematical Structures in Computer Science 20(2): 169-237 (2010)
c37		Hedi Benzina, Jean Goubault-Larrecq: Some Ideas on Virtualized System Security, and Monitors. DPM/SETOP 2010: 244-258
c36		Jean Goubault-Larrecq: Noetherian Spaces in Verification. ICALP (2) 2010: 2-21
c35		Jean Goubault-Larrecq: omega-QRB-Domains and the Probabilistic Powerdomain. LICS 2010: 352-361
	2009
c34		Jean Goubault-Larrecq: "Logic Wins!". ASIAN 2009: 1-16
c33		Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) 2009: 188-199
c32		Alain Finkel, Jean Goubault-Larrecq: Forward Analysis for WSTS, Part I: Completions. STACS 2009: 433-444
i2		Alain Finkel, Jean Goubault-Larrecq: Forward analysis for WSTS, Part I: Completions. CoRR abs/0902.1587 (2009)
	2008
j9		Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical relations for monadic types. Mathematical Structures in Computer Science 18(6): 1169-1217 (2008)
c31		Jean Goubault-Larrecq: Towards Producing Formally Checkable Security Proofs, Automatically. CSF 2008: 224-238
c30		Jean Goubault-Larrecq: Simulation Hemi-metrics between Infinite-State Stochastic Games. FoSSaCS 2008: 50-65
c29		Jean Goubault-Larrecq: Prevision Domains and Convex Powercones. FoSSaCS 2008: 318-333
c28		Jean Goubault-Larrecq, Julien Olivain: A Smell of Orchids. RV 2008: 1-20
	2007
j8		Kumar Neeraj Verma, Jean Goubault-Larrecq: Alternating two-way AC-tree automata. Inf. Comput. 205(6): 817-869 (2007)
c27		Jean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina: A Probabilistic Applied Pi-Calculus. APLAS 2007: 175-190
c26		Elie Bursztein, Jean Goubault-Larrecq: A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. ASIAN 2007: 212-227
c25		Jean Goubault-Larrecq: Continuous Previsions. CSL 2007: 542-557
c24		Jean Goubault-Larrecq: Continuous Capacities on Continuous State Spaces. ICALP 2007: 764-776
c23		Jean Goubault-Larrecq: On Noetherian Spaces. LICS 2007: 453-462
	2005
j7		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)
j6		Jean Goubault-Larrecq: Deciding H₁ by resolution. Inf. Process. Lett. 95(3): 401-408 (2005)
j5		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)
j4		Jean Goubault-Larrecq: Extensions of valuations. Mathematical Structures in Computer Science 15(2): 271-297 (2005)
c22		Julien Olivain, Jean Goubault-Larrecq: The Orchids Intrusion Detection Tool. CAV 2005: 286-290
c21		Jean Goubault-Larrecq, Fabrice Parrennes: Cryptographic Protocol Analysis on Real C Code. VMCAI 2005: 363-379
i1		Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical Relations for Monadic Types. CoRR abs/cs/0511006 (2005)
	2004
c20		Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang: Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004: 400-414
	2002
c19		Jean Goubault-Larrecq: Higher-Order Positive Set Constraints. CSL 2002: 473-489
c18		Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical Relations for Monadic Types. CSL 2002: 553-568
	2001
j3		Jean Goubault-Larrecq: Preface. Electr. Notes Theor. Comput. Sci. 55(1): 101-102 (2001)
c17		Muriel Roger, Jean Goubault-Larrecq: Log Auditing through Model-Checking. CSFW 2001: 220-
c16		Jean Goubault-Larrecq: Well-Founded Recursive Relations. CSL 2001: 484-497
c15		Xavier Rival, Jean Goubault-Larrecq: Experiments with Finite Tree Automata in Coq. TPHOLs 2001: 362-377
	2000
j2		Healfdene Goguen, Jean Goubault-Larrecq: Sequent combinators: a Hilbert system for the lambda calculus. Mathematical Structures in Computer Science 10(1): 1-79 (2000)
c14		Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar: Reflecting BDDs in Coq. ASIAN 2000: 162-181
c13		Jean Goubault-Larrecq: A Method for Automatic Cryptographic Protocol Verification. IPDPS Workshops 2000: 977-984
	1999
c12		Jean Goubault-Larrecq: A Simple Sequent System for First-Order Logic with Free Constructors. TABLEAUX 1999: 202-216
	1998
c11		Jean Goubault-Larrecq: Conjunctive Types and SKInT. TYPES 1998: 106-120
	1997
c10		Jean Goubault-Larrecq: Ramified Higher-Order Unification. LICS 1997: 410-421
c9		Peter H. Schmitt, Jean Goubault-Larrecq: A Tableau System for Linear-TIME Temporal Logic. TACAS 1997: 130-144
	1996
c8		Jean Goubault-Larrecq: A Proof of Weak Termination of Typed lambda-sigma-Calculi. TYPES 1996: 134-153
	1995
j1		Jean Goubault: A BDD-Based Simplification and Skolemization Procedure. Logic Journal of the IGPL 3(6): 827-855 (1995)
	1994
c7		Jean Goubault: Proving with BDDs and Control of Information. CADE 1994: 499-513
c6		Jean Goubault, Joachim Posegga: BDDs and Automated Deduction. ISMIS 1994: 541-550
c5		Jean Goubault: Rigid E-Unifiability is DEXPTIME-Complete. LICS 1994: 498-506
c4		Jean Goubault: Higher-Order Rigid E-Unification. LPAR 1994: 129-143
c3		Jean Goubault: Generalized Boxings, Congruences and Partial Inlining. SAS 1994: 147-161
c2		Jean Goubault: The Complexity of Resource-Bounded First-Order Classical Logic. STACS 1994: 59-70
	1993
c1		Jean Goubault: A Rule-based Algorithm for Rigid E-Unification. Kurt Gödel Colloquium 1993: 202-210

Coauthor Index

1	Assalé Adjé	[i3]
2	S. Arun-Kumar	[c14]
3	Hedi Benzina	[c37]
4	Olivier Bouissou	[j16]
5	Elie Bursztein	[c26]
6	Alain Finkel	[j14] [c39] [c33] [c32] [i2]
7	Healfdene Goguen	[j2]
8	Eric Goubault	[j16]
9	Klaus Keimel	[j13]
10	Slawomir Lasota	[j9] [i1] [c20] [c18]
11	David Nowak	[j9] [i1] [c20] [c18]
12	Julien Olivain	[c28] [c22]
13	Catuscia Palamidessi	[c27]
14	Fabrice Parrennes	[c21]
15	Joachim Posegga	[c6]
16	Sanjiva Prasad	[c14]
17	Sylvie Putot	[j16]
18	Xavier Rival	[c15]
19	Muriel Roger	[j5] [c17]
20	Peter H. Schmitt	[c9]
21	Angelo Troina	[c27]
22	Daniele Varacca	[c38]
23	Kumar Neeraj Verma	[j8] [j7] [j5] [c14]
24	Yu Zhang	[c20]

Colors in the list of coauthors

Last update Sun May 26 00:57:45 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page