A Rule-based Algorithm for Rigid E-Unification. - Jean Goubault (Kurt Gödel Colloquium, 1993)

Proving with BDDs and Control of Information. - Jean Goubault (CADE, 1994)

BDDs and Automated Deduction. - Jean Goubault; Joachim Posegga (ISMIS, 1994)

Rigid E-Unifiability is DEXPTIME-Complete - Jean Goubault (LICS, 1994)

Higher-Order Rigid E-Unification. - Jean Goubault (LPAR, 1994)

Generalized Boxings, Congruences and Partial Inlining. - Jean Goubault (SAS, 1994)

The Complexity of Resource-Bounded First-Order Classical Logic. - Jean Goubault (STACS, 1994)

A BDD-Based Simplification and Skolemization Procedure. - Jean Goubault (Log. J. IGPL, 1995)

A Proof of Weak Termination of Typed lambda-sigma-Calculi. - Jean Goubault-Larrecq (TYPES, 1996)

Ramified Higher-Order Unification. - Jean Goubault-Larrecq (LICS, 1997)

A Tableau System for Linear-TIME Temporal Logic. - Peter H. Schmitt; Jean Goubault-Larrecq (TACAS, 1997)

Conjunctive Types and SKInT. - Jean Goubault-Larrecq (TYPES, 1998)

A Simple Sequent System for First-Order Logic with Free Constructors. - Jean Goubault-Larrecq (TABLEAUX, 1999)

Reflecting BDDs in Coq. - Kumar Neeraj Verma; Jean Goubault-Larrecq; Sanjiva Prasad; S. Arun-Kumar (ASIAN, 2000)

A Method for Automatic Cryptographic Protocol Verification. - Jean Goubault-Larrecq (IPDPS Workshops, 2000)

Sequent combinators: a Hilbert system for the lambda calculus. - Healfdene Goguen; Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2000)

Log Auditing through Model-Checking. - Muriel Roger; Jean Goubault-Larrecq (CSFW, 2001)

Well-Founded Recursive Relations. - Jean Goubault-Larrecq (CSL, 2001)

Experiments with Finite Tree Automata in Coq. - Xavier Rival; Jean Goubault-Larrecq (TPHOLs, 2001)

Preface. - Jean Goubault-Larrecq (LACPV@CAV, 2001)

Higher-Order Positive Set Constraints. - Jean Goubault-Larrecq (CSL, 2002)

Logical Relations for Monadic Types. - Jean Goubault-Larrecq; Slawomir Lasota 001; David Nowak (CSL, 2002)

Complete Lax Logical Relations for Cryptographic Lambda-Calculi. - Jean Goubault-Larrecq; Slawomir Lasota 001; David Nowak; Yu Zhang (CSL, 2004)

The Orchids Intrusion Detection Tool. - Julien Olivain; Jean Goubault-Larrecq (CAV, 2005)

Cryptographic Protocol Analysis on Real C Code. - Jean Goubault-Larrecq; Fabrice Parrennes (VMCAI, 2005)

Karp-Miller Trees for a Branching Extension of VASS. - Kumar Neeraj Verma; Jean Goubault-Larrecq (Discret. Math. Theor. Comput. Sci., 2005)

Deciding H1 by resolution. - Jean Goubault-Larrecq (Inf. Process. Lett., 2005)

Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. - Jean Goubault-Larrecq; Muriel Roger; Kumar Neeraj Verma (J. Log. Algebraic Methods Program., 2005)

Extensions of valuations. - Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2005)

A Probabilistic Applied Pi-Calculus. - Jean Goubault-Larrecq; Catuscia Palamidessi; Angelo Troina (APLAS, 2007)

A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. - Elie Bursztein; Jean Goubault-Larrecq (ASIAN, 2007)

Continuous Previsions. - Jean Goubault-Larrecq (CSL, 2007)

Continuous Capacities on Continuous State Spaces. - Jean Goubault-Larrecq (ICALP, 2007)

On Noetherian Spaces. - Jean Goubault-Larrecq (LICS, 2007)

Alternating two-way AC-tree automata. - Kumar Neeraj Verma; Jean Goubault-Larrecq (Inf. Comput., 2007)

Towards Producing Formally Checkable Security Proofs, Automatically. - Jean Goubault-Larrecq (CSF, 2008)

Simulation Hemi-metrics between Infinite-State Stochastic Games. - Jean Goubault-Larrecq (FoSSaCS, 2008)

Prevision Domains and Convex Powercones. - Jean Goubault-Larrecq (FoSSaCS, 2008)

A Smell of Orchids. - Jean Goubault-Larrecq; Julien Olivain (RV, 2008)

"Logic Wins!". - Jean Goubault-Larrecq (ASIAN, 2009)

Forward Analysis for WSTS, Part II: Complete WSTS. - Alain Finkel; Jean Goubault-Larrecq (ICALP (2), 2009)

Forward Analysis for WSTS, Part I: Completions. - Alain Finkel; Jean Goubault-Larrecq (STACS, 2009)

Some Ideas on Virtualized System Security, and Monitors. - Hedi Benzina; Jean Goubault-Larrecq (DPM/SETOP, 2010)

Noetherian Spaces in Verification. - Jean Goubault-Larrecq (ICALP (2), 2010)

omega-QRB-Domains and the Probabilistic Powerdomain. - Jean Goubault-Larrecq (LICS, 2010)

Finite models for formal security proofs. - Jean Goubault-Larrecq (J. Comput. Secur., 2010)

De Groot duality and models of choice: angels, demons and nature. - Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2010)

Continuous Random Variables. - Jean Goubault-Larrecq; Daniele Varacca (LICS, 2011)

Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. - Jean Goubault-Larrecq; Klaus Keimel (Math. Struct. Comput. Sci., 2011)

Musings around the geometry of interaction, and coherence. - Jean Goubault-Larrecq (Theor. Comput. Sci., 2011)

The Theory of WSTS: The Case of Complete WSTS. - Alain Finkel; Jean Goubault-Larrecq (Petri Nets, 2012)

A generalization of p-boxes to affine arithmetic. - Olivier Bouissou; Eric Goubault; Jean Goubault-Larrecq; Sylvie Putot (Computing, 2012)

QRB-Domains and the Probabilistic Powerdomain - Jean Goubault-Larrecq (Log. Methods Comput. Sci., 2012)

Concrete Semantics of Programs with Non-Deterministic and Random Inputs - Assalé Adjé; Jean Goubault-Larrecq (CoRR, 2012)

Non-Hausdorff Topology and Domain Theory - Selected Topics in Point-Set Topology. - Jean Goubault-Larrecq (Cambridge University Press, 2013)

The Blossom of Finite Semantic Trees. - Jean Goubault-Larrecq; Jean-Pierre Jouannaud (Programming Logics, 2013)

On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy Case. - Jean Goubault-Larrecq; Julien Olivain (FPS, 2013)

A Constructive Proof of the Topological Kruskal Theorem. - Jean Goubault-Larrecq (MFCS, 2013)

Static Analysis of Programs with Imprecise Probabilistic Inputs. - Assalé Adjé; Olivier Bouissou; Jean Goubault-Larrecq; Eric Goubault; Sylvie Putot (VSTTE, 2013)

Random Measurable Selections. - Jean Goubault-Larrecq; Roberto Segala (Horizons of the Mind, 2014)

Exponentiable Streams and Prestreams. - Jean Goubault-Larrecq (Appl. Categorical Struct., 2014)

QRB, QFS, and the Probabilistic Powerdomain. - Jean Goubault-Larrecq; Achim Jung (MFPS, 2014)

Natural Homology. - Jérémy Dubut; Eric Goubault; Jean Goubault-Larrecq (ICALP (2), 2015)

Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases. - Jean Goubault-Larrecq (J. Log. Algebraic Methods Program., 2015)

A short proof of the Schröder-Simpson Theorem. - Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2015)

Bisimulations and Unfolding in P-Accessible Categorical Models. - Jérémy Dubut; Eric Goubault; Jean Goubault-Larrecq (CONCUR, 2016)

The Directed Homotopy Hypothesis. - Jérémy Dubut; Eric Goubault; Jean Goubault-Larrecq (CSL, 2016)

Deciding Piecewise Testable Separability for Regular Tree Languages. - Jean Goubault-Larrecq; Sylvain Schmitz (ICALP, 2016)

On the Complexity of Monitoring Orchids Signatures. - Jean Goubault-Larrecq; Jean-Philippe Lachance (RV, 2016)

Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). - Jean Goubault-Larrecq; Monika Seisenberger; Victor L. Selivanov; Andreas Weiermann (Dagstuhl Reports, 2016)

Forward Analysis for WSTS, Part III: Karp-Miller Trees. - Michael Blondin; Alain Finkel; Jean Goubault-Larrecq (FSTTCS, 2017)

Directed Homology Theories and Eilenberg-Steenrod Axioms. - Jérémy Dubut; Eric Goubault; Jean Goubault-Larrecq (Appl. Categorical Struct., 2017)

A Few Notes on Formal Balls. - Jean Goubault-Larrecq; Kok Min Ng (Log. Methods Comput. Sci., 2017)

Isomorphism theorems between models of mixed choice. - Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2017)

On the complexity of monitoring Orchids signatures, and recurrence equations. - Jean Goubault-Larrecq; Jean-Philippe Lachance (Formal Methods Syst. Des., 2018)

The Ho-Zhao Problem. - Weng Kin Ho; Jean Goubault-Larrecq; Achim Jung; Xiaoyong Xi (Log. Methods Comput. Sci., 2018)

Fooling the Parallel or Tester with Probability 8/27. - Jean Goubault-Larrecq (The Art of Modelling Computational Systems, 2019)

A Probabilistic and Non-Deterministic Call-by-Push-Value Language. - Jean Goubault-Larrecq (LICS, 2019)

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. - Jean Goubault-Larrecq; Simon Halfon; Prateek Karandikar; K. Narayan Kumar; Philippe Schnoebelen (CoRR, 2019)

Domain-complete and LCS-complete Spaces. - Matthew de Brecht; Jean Goubault-Larrecq; Xiaodong Jia 002; Zhenchao Lyu (ISDT, 2019)

Algebras of the Extended Probabilistic Powerdomain Monad. - Jean Goubault-Larrecq; Xiaodong Jia 002 (ISDT, 2019)

A semantics for nabla. - Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2019)

29th EACSL Annual Conference on Computer Science Logic (CSL 2021). - Jean Goubault-Larrecq (Bull. EATCS, 2020)

Products and projective limits of continuous valuations on T0 spaces. - Jean Goubault-Larrecq (Math. Struct. Comput. Sci., 2021)

Separating minimal valuations, point-continuous valuations, and continuous valuations. - Jean Goubault-Larrecq; Xiaodong Jia 002 (Math. Struct. Comput. Sci., 2021)

On Weakly Hausdorff Spaces and Locally Strongly Sober Spaces. - Jean Goubault-Larrecq (CoRR, 2022)

Continuous R-valuations. - Jean Goubault-Larrecq; Xiaodong Jia 002 (ISDT, 2022)

A Domain-theoretic Approach to Statistical Programming Languages. - Jean Goubault-Larrecq; Xiaodong Jia 002; Clément Théron (J. ACM, 2023)

The Ackermann Award 2023. - Maribel Fernández; Jean Goubault-Larrecq; Delia Kesner (CSL, 2024)

Weak Distributive Laws between Monads of Continuous Valuations and of Non-Deterministic Choice. - Jean Goubault-Larrecq (CoRR, 2024)

Isomorphism Theorems between Models of Mixed Choice (Revised). - Jean Goubault-Larrecq (CoRR, 2024)

A cone-theoretic barycenter existence theorem. - Jean Goubault-Larrecq; Xiaodong Jia 002 (Log. Methods Comput. Sci., 2024)

Distributing Retractions, Weak Distributive Laws and Applications to Monads of Hyperspaces, Continuous Valuations and Measures. - Jean Goubault-Larrecq (CoRR, 2025)