Jean Goubault-Larrecq

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 32

Top Topics

Programming Language Constructs

Static Analysis

Computer Science

Top Venues

Math. Struct. Comput. Sci.

Log. Methods Comput. Sci.

Publications

Maribel Fernández, Jean Goubault-Larrecq, Delia Kesner
The Ackermann Award 2023. CSL (2024)
Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron
A Domain-theoretic Approach to Statistical Programming Languages. J. ACM 70 (5) (2023)
Jean Goubault-Larrecq, Xiaodong Jia
A cone-theoretic barycenter existence theorem. CoRR (2022)
Jean Goubault-Larrecq, Xiaodong Jia
Continuous R-valuations. CoRR (2022)
Jean Goubault-Larrecq
On Weakly Hausdorff Spaces and Locally Strongly Sober Spaces. CoRR (2022)
Jean Goubault-Larrecq, Xiaodong Jia
Separating minimal valuations, point-continuous valuations, and continuous valuations. Math. Struct. Comput. Sci. 31 (6) (2021)
Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron
A Domain-Theoretic Approach to Statistical Programming Languages. CoRR (2021)
Jean Goubault-Larrecq
Products and projective limits of continuous valuations on T0 spaces. Math. Struct. Comput. Sci. 31 (2) (2021)
Jean Goubault-Larrecq, Xiaodong Jia
Separating minimal valuations, point-continuous valuations and continuous valuations. CoRR (2021)
Jean Goubault-Larrecq
29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Bull. EATCS 131 (2020)
Alain Finkel, Jean Goubault-Larrecq
Forward analysis for WSTS, part I: completions. Math. Struct. Comput. Sci. 30 (7) (2020)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16 (2) (2020)
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. CoRR (2019)
Matthew de Brecht, Jean Goubault-Larrecq, Xiaodong Jia, Zhenchao Lyu
Domain-complete and LCS-complete Spaces. ISDT (2019)
Jean Goubault-Larrecq
Fooling the Parallel or Tester with Probability 8/27. The Art of Modelling Computational Systems (2019)
Jean Goubault-Larrecq, Xiaodong Jia
Algebras of the Extended Probabilistic Powerdomain Monad. ISDT (2019)
Jean Goubault-Larrecq
A semantics for nabla. Math. Struct. Comput. Sci. 29 (8) (2019)
Jean Goubault-Larrecq
Fooling the Parallel Or Tester with Probability $8/27$. CoRR (2019)
Jean Goubault-Larrecq
A Probabilistic and Non-Deterministic Call-by-Push-Value Language. LICS (2019)
Jean Goubault-Larrecq
A Probabilistic and Non-Deterministic Call-by-Push-Value Language. CoRR (2018)
Jean Goubault-Larrecq, Jean-Philippe Lachance
On the complexity of monitoring Orchids signatures, and recurrence equations. Formal Methods Syst. Des. 53 (1) (2018)
Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, Xiaoyong Xi
The Ho-Zhao Problem. Log. Methods Comput. Sci. 14 (1) (2018)
Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq
Directed Homology Theories and Eilenberg-Steenrod Axioms. Appl. Categorical Struct. 25 (5) (2017)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS (2017)
Jean Goubault-Larrecq, Kok Min Ng
A Few Notes on Formal Balls. Log. Methods Comput. Sci. 13 (4) (2017)
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR (2017)
Jean Goubault-Larrecq
Isomorphism theorems between models of mixed choice. Math. Struct. Comput. Sci. 27 (6) (2017)
Jean Goubault-Larrecq, Sylvain Schmitz
Deciding Piecewise Testable Separability for Regular Tree Languages. ICALP (2016)
Jean Goubault-Larrecq, Monika Seisenberger, Victor L. Selivanov, Andreas Weiermann
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports 6 (1) (2016)
Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq
Bisimulations and Unfolding in P-Accessible Categorical Models. CONCUR (2016)
Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq
The Directed Homotopy Hypothesis. CSL (2016)
Jean Goubault-Larrecq, Jean-Philippe Lachance
On the Complexity of Monitoring Orchids Signatures. RV (2016)
Jean Goubault-Larrecq
Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases. J. Log. Algebraic Methods Program. 84 (1) (2015)
Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq
Natural Homology. ICALP (2) (2015)
Jean Goubault-Larrecq
A short proof of the Schröder-Simpson Theorem. Math. Struct. Comput. Sci. 25 (1) (2015)
Jean Goubault-Larrecq, Achim Jung
QRB, QFS, and the Probabilistic Powerdomain. MFPS (2014)
Jean Goubault-Larrecq, Roberto Segala
Random Measurable Selections. Horizons of the Mind (2014)
Jean Goubault-Larrecq
Exponentiable Streams and Prestreams. Appl. Categorical Struct. 22 (3) (2014)
Jean Goubault-Larrecq, Jean-Pierre Jouannaud
The Blossom of Finite Semantic Trees. Programming Logics (2013)
Assalé Adjé, Olivier Bouissou, Jean Goubault-Larrecq, Eric Goubault, Sylvie Putot
Static Analysis of Programs with Imprecise Probabilistic Inputs. VSTTE (2013)
Jean Goubault-Larrecq, Julien Olivain
On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy Case. FPS (2013)
Jean Goubault-Larrecq
A Constructive Proof of the Topological Kruskal Theorem. MFCS (2013)
Olivier Bouissou, Eric Goubault, Jean Goubault-Larrecq, Sylvie Putot
A generalization of p-boxes to affine arithmetic. Computing 94 (2-4) (2012)
Assalé Adjé, Jean Goubault-Larrecq
Concrete Semantics of Programs with Non-Deterministic and Random Inputs CoRR (2012)
Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part II: Complete WSTS Log. Methods Comput. Sci. 8 (3) (2012)
Alain Finkel, Jean Goubault-Larrecq
The Theory of WSTS: The Case of Complete WSTS. Petri Nets (2012)
Jean Goubault-Larrecq
QRB-Domains and the Probabilistic Powerdomain Log. Methods Comput. Sci. 8 (1) (2012)
Jean Goubault-Larrecq
Musings around the geometry of interaction, and coherence. Theor. Comput. Sci. 412 (20) (2011)
Jean Goubault-Larrecq, Daniele Varacca
Continuous Random Variables. LICS (2011)
Jean Goubault-Larrecq, Klaus Keimel
Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. Math. Struct. Comput. Sci. 21 (3) (2011)
Jean Goubault-Larrecq
De Groot duality and models of choice: angels, demons and nature. Math. Struct. Comput. Sci. 20 (2) (2010)
Hedi Benzina, Jean Goubault-Larrecq
Some Ideas on Virtualized System Security, and Monitors. DPM/SETOP (2010)
Jean Goubault-Larrecq
omega-QRB-Domains and the Probabilistic Powerdomain. LICS (2010)
Jean Goubault-Larrecq
Noetherian Spaces in Verification. ICALP (2) (2010)
Jean Goubault-Larrecq
Finite models for formal security proofs. J. Comput. Secur. 18 (6) (2010)
Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) (2009)
Alain Finkel, Jean Goubault-Larrecq
Forward Analysis for WSTS, Part I: Completions. STACS (2009)
Jean Goubault-Larrecq
"Logic Wins!". ASIAN (2009)
Alain Finkel, Jean Goubault-Larrecq
Forward analysis for WSTS, Part I: Completions CoRR (2009)
Jean Goubault-Larrecq, Julien Olivain
A Smell of Orchids. RV (2008)
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
Logical relations for monadic types. Math. Struct. Comput. Sci. 18 (6) (2008)
Jean Goubault-Larrecq
Prevision Domains and Convex Powercones. FoSSaCS (2008)
Jean Goubault-Larrecq
Towards Producing Formally Checkable Security Proofs, Automatically. CSF (2008)
Jean Goubault-Larrecq
Simulation Hemi-metrics between Infinite-State Stochastic Games. FoSSaCS (2008)
Jean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina
A Probabilistic Applied Pi-Calculus. APLAS (2007)
Kumar Neeraj Verma, Jean Goubault-Larrecq
Alternating two-way AC-tree automata. Inf. Comput. 205 (6) (2007)
Jean Goubault-Larrecq
On Noetherian Spaces. LICS (2007)
Jean Goubault-Larrecq
Continuous Capacities on Continuous State Spaces. ICALP (2007)
Elie Bursztein, Jean Goubault-Larrecq
A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. ASIAN (2007)
Jean Goubault-Larrecq
Continuous Previsions. CSL (2007)
Jean Goubault-Larrecq
Extensions of valuations. Math. Struct. Comput. Sci. 15 (2) (2005)
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
Logical Relations for Monadic Types CoRR (2005)
Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma
Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. J. Log. Algebraic Methods Program. 64 (2) (2005)
Julien Olivain, Jean Goubault-Larrecq
The Orchids Intrusion Detection Tool. CAV (2005)
Jean Goubault-Larrecq, Fabrice Parrennes
Cryptographic Protocol Analysis on Real C Code. VMCAI (2005)
Kumar Neeraj Verma, Jean Goubault-Larrecq
Karp-Miller Trees for a Branching Extension of VASS. Discret. Math. Theor. Comput. Sci. 7 (1) (2005)
Jean Goubault-Larrecq
by resolution. Inf. Process. Lett. 95 (3) (2005)
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang
Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL (2004)
Jean Goubault-Larrecq
Higher-Order Positive Set Constraints. CSL (2002)
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
Logical Relations for Monadic Types. CSL (2002)
Jean Goubault-Larrecq
Preface. Electron. Notes Theor. Comput. Sci. 55 (1) (2001)
Jean Goubault-Larrecq
Well-Founded Recursive Relations. CSL (2001)
Muriel Roger, Jean Goubault-Larrecq
Log Auditing through Model-Checking. CSFW (2001)
Xavier Rival, Jean Goubault-Larrecq
Experiments with Finite Tree Automata in Coq. TPHOLs (2001)
Healfdene Goguen, Jean Goubault-Larrecq
Sequent combinators: a Hilbert system for the lambda calculus. Math. Struct. Comput. Sci. 10 (1) (2000)
Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar
Reflecting BDDs in Coq. ASIAN (2000)
Jean Goubault-Larrecq
A Method for Automatic Cryptographic Protocol Verification. IPDPS Workshops (2000)
Jean Goubault-Larrecq
A Simple Sequent System for First-Order Logic with Free Constructors. TABLEAUX (1999)
Jean Goubault-Larrecq
Conjunctive Types and SKInT. TYPES (1998)
Jean Goubault-Larrecq
Ramified Higher-Order Unification. LICS (1997)
Peter H. Schmitt, Jean Goubault-Larrecq
A Tableau System for Linear-TIME Temporal Logic. TACAS (1997)
Jean Goubault-Larrecq
A Proof of Weak Termination of Typed lambda-sigma-Calculi. TYPES (1996)