default search action
Jean Goubault-Larrecq
Person information
- affiliation: École Normale Supérieure de Cachan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Jean Goubault-Larrecq, Xiaodong Jia:
A cone-theoretic barycenter existence theorem. Log. Methods Comput. Sci. 20(4) (2024) - [c58]Maribel Fernández, Jean Goubault-Larrecq, Delia Kesner:
The Ackermann Award 2023. CSL 2024: 1:1-1:4 - [i13]Jean Goubault-Larrecq:
Weak Distributive Laws between Monads of Continuous Valuations and of Non-Deterministic Choice. CoRR abs/2408.15977 (2024) - 2023
- [j30]Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron:
A Domain-theoretic Approach to Statistical Programming Languages. J. ACM 70(5): 35:1-35:63 (2023) - 2022
- [c57]Jean Goubault-Larrecq, Xiaodong Jia:
Continuous R-valuations. ISDT 2022 - [i12]Jean Goubault-Larrecq, Xiaodong Jia:
A cone-theoretic barycenter existence theorem. CoRR abs/2209.14005 (2022) - [i11]Jean Goubault-Larrecq:
On Weakly Hausdorff Spaces and Locally Strongly Sober Spaces. CoRR abs/2211.10400 (2022) - 2021
- [j29]Jean Goubault-Larrecq:
Products and projective limits of continuous valuations on T0 spaces. Math. Struct. Comput. Sci. 31(2): 234-254 (2021) - [j28]Jean Goubault-Larrecq, Xiaodong Jia:
Separating minimal valuations, point-continuous valuations, and continuous valuations. Math. Struct. Comput. Sci. 31(6): 614-632 (2021) - [e3]Christel Baier, Jean Goubault-Larrecq:
29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (Virtual Conference). LIPIcs 183, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-175-7 [contents] - [i10]Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron:
A Domain-Theoretic Approach to Statistical Programming Languages. CoRR abs/2106.16190 (2021) - [i9]Jean Goubault-Larrecq, Xiaodong Jia:
Separating minimal valuations, point-continuous valuations and continuous valuations. CoRR abs/2109.00426 (2021) - 2020
- [j27]Jean Goubault-Larrecq:
29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Bull. EATCS 131 (2020) - [j26]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16(2) (2020) - [j25]Alain Finkel, Jean Goubault-Larrecq:
Forward analysis for WSTS, part I: completions. Math. Struct. Comput. Sci. 30(7): 752-832 (2020) - [e2]Jean Goubault-Larrecq, Barbara König:
Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Lecture Notes in Computer Science 12077, Springer 2020, ISBN 978-3-030-45230-8 [contents]
2010 – 2019
- 2019
- [j24]Jean Goubault-Larrecq:
A semantics for nabla. Math. Struct. Comput. Sci. 29(8): 1250-1274 (2019) - [c56]Jean Goubault-Larrecq:
Fooling the Parallel or Tester with Probability 8/27. The Art of Modelling Computational Systems 2019: 313-328 - [c55]Jean Goubault-Larrecq:
A Probabilistic and Non-Deterministic Call-by-Push-Value Language. LICS 2019: 1-13 - [c54]Matthew de Brecht, Jean Goubault-Larrecq, Xiaodong Jia, Zhenchao Lyu:
Domain-complete and LCS-complete Spaces. ISDT 2019: 3-35 - [c53]Jean Goubault-Larrecq, Xiaodong Jia:
Algebras of the Extended Probabilistic Powerdomain Monad. ISDT 2019: 37-61 - [i8]Jean Goubault-Larrecq:
Fooling the Parallel Or Tester with Probability $8/27$. CoRR abs/1903.12653 (2019) - [i7]Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen:
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. CoRR abs/1904.10703 (2019) - 2018
- [j23]Jean Goubault-Larrecq, Jean-Philippe Lachance:
On the complexity of monitoring Orchids signatures, and recurrence equations. Formal Methods Syst. Des. 53(1): 6-32 (2018) - [j22]Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, Xiaoyong Xi:
The Ho-Zhao Problem. Log. Methods Comput. Sci. 14(1) (2018) - [i6]Jean Goubault-Larrecq:
A Probabilistic and Non-Deterministic Call-by-Push-Value Language. CoRR abs/1812.11573 (2018) - 2017
- [j21]Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
Directed Homology Theories and Eilenberg-Steenrod Axioms. Appl. Categorical Struct. 25(5): 775-807 (2017) - [j20]Jean Goubault-Larrecq, Kok Min Ng:
A Few Notes on Formal Balls. Log. Methods Comput. Sci. 13(4) (2017) - [j19]Jean Goubault-Larrecq:
Isomorphism theorems between models of mixed choice. Math. Struct. Comput. Sci. 27(6): 1032-1067 (2017) - [c52]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS 2017: 16:1-16:15 - [i5]Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. CoRR abs/1710.07258 (2017) - 2016
- [c51]Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
Bisimulations and Unfolding in P-Accessible Categorical Models. CONCUR 2016: 25:1-25:14 - [c50]Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
The Directed Homotopy Hypothesis. CSL 2016: 9:1-9:16 - [c49]Jean Goubault-Larrecq, Sylvain Schmitz:
Deciding Piecewise Testable Separability for Regular Tree Languages. ICALP 2016: 97:1-97:15 - [c48]Jean Goubault-Larrecq, Jean-Philippe Lachance:
On the Complexity of Monitoring Orchids Signatures. RV 2016: 169-184 - [i4]Jean Goubault-Larrecq, Monika Seisenberger, Victor L. Selivanov, Andreas Weiermann:
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports 6(1): 69-98 (2016) - 2015
- [j18]Jean Goubault-Larrecq:
Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases. J. Log. Algebraic Methods Program. 84(1): 155-184 (2015) - [j17]Jean Goubault-Larrecq:
A short proof of the Schröder-Simpson Theorem. Math. Struct. Comput. Sci. 25(1): 1-5 (2015) - [c47]Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
Natural Homology. ICALP (2) 2015: 171-183 - 2014
- [j16]Jean Goubault-Larrecq:
Exponentiable Streams and Prestreams. Appl. Categorical Struct. 22(3): 515-549 (2014) - [c46]Jean Goubault-Larrecq, Roberto Segala:
Random Measurable Selections. Horizons of the Mind 2014: 343-362 - [c45]Jean Goubault-Larrecq, Achim Jung:
QRB, QFS, and the Probabilistic Powerdomain. MFPS 2014: 167-182 - 2013
- [b1]Jean Goubault-Larrecq:
Non-Hausdorff Topology and Domain Theory - Selected Topics in Point-Set Topology. New Mathematical Monographs 22, Cambridge University Press 2013, ISBN 978-1-107-03413-6, pp. I-VI, 1-491 - [c44]Jean Goubault-Larrecq, Jean-Pierre Jouannaud:
The Blossom of Finite Semantic Trees. Programming Logics 2013: 90-122 - [c43]Jean Goubault-Larrecq, Julien Olivain:
On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy Case. FPS 2013: 3-16 - [c42]Jean Goubault-Larrecq:
A Constructive Proof of the Topological Kruskal Theorem. MFCS 2013: 22-41 - [c41]Assalé Adjé, Olivier Bouissou, Jean Goubault-Larrecq, Eric Goubault, Sylvie Putot:
Static Analysis of Programs with Imprecise Probabilistic Inputs. VSTTE 2013: 22-47 - 2012
- [j15]Olivier Bouissou, Eric Goubault, Jean Goubault-Larrecq, Sylvie Putot:
A generalization of p-boxes to affine arithmetic. Computing 94(2-4): 189-201 (2012) - [j14]Jean Goubault-Larrecq:
QRB-Domains and the Probabilistic Powerdomain. Log. Methods Comput. Sci. 8(1) (2012) - [j13]Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part II: Complete WSTS. Log. Methods Comput. Sci. 8(3) (2012) - [c40]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
- [j12]Jean Goubault-Larrecq, Klaus Keimel:
Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. Math. Struct. Comput. Sci. 21(3): 511-561 (2011) - [j11]Jean Goubault-Larrecq:
Musings around the geometry of interaction, and coherence. Theor. Comput. Sci. 412(20): 1998-2014 (2011) - [c39]Jean Goubault-Larrecq, Daniele Varacca:
Continuous Random Variables. LICS 2011: 97-106 - 2010
- [j10]Jean Goubault-Larrecq:
Finite models for formal security proofs. J. Comput. Secur. 18(6): 1247-1299 (2010) - [j9]Jean Goubault-Larrecq:
De Groot duality and models of choice: angels, demons and nature. Math. Struct. Comput. Sci. 20(2): 169-237 (2010) - [c38]Hedi Benzina, Jean Goubault-Larrecq:
Some Ideas on Virtualized System Security, and Monitors. DPM/SETOP 2010: 244-258 - [c37]Jean Goubault-Larrecq:
Noetherian Spaces in Verification. ICALP (2) 2010: 2-21 - [c36]Jean Goubault-Larrecq:
omega-QRB-Domains and the Probabilistic Powerdomain. LICS 2010: 352-361
2000 – 2009
- 2009
- [c35]Jean Goubault-Larrecq:
"Logic Wins!". ASIAN 2009: 1-16 - [c34]Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part II: Complete WSTS. ICALP (2) 2009: 188-199 - [c33]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
- [j8]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical relations for monadic types. Math. Struct. Comput. Sci. 18(6): 1169-1217 (2008) - [c32]Jean Goubault-Larrecq:
Towards Producing Formally Checkable Security Proofs, Automatically. CSF 2008: 224-238 - [c31]Jean Goubault-Larrecq:
Simulation Hemi-metrics between Infinite-State Stochastic Games. FoSSaCS 2008: 50-65 - [c30]Jean Goubault-Larrecq:
Prevision Domains and Convex Powercones. FoSSaCS 2008: 318-333 - [c29]Jean Goubault-Larrecq, Julien Olivain:
A Smell of Orchids. RV 2008: 1-20 - 2007
- [j7]Kumar Neeraj Verma, Jean Goubault-Larrecq:
Alternating two-way AC-tree automata. Inf. Comput. 205(6): 817-869 (2007) - [c28]Jean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina:
A Probabilistic Applied Pi-Calculus. APLAS 2007: 175-190 - [c27]Elie Bursztein, Jean Goubault-Larrecq:
A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. ASIAN 2007: 212-227 - [c26]Jean Goubault-Larrecq:
Continuous Previsions. CSL 2007: 542-557 - [c25]Jean Goubault-Larrecq:
Continuous Capacities on Continuous State Spaces. ICALP 2007: 764-776 - [c24]Jean Goubault-Larrecq:
On Noetherian Spaces. LICS 2007: 453-462 - 2005
- [j6]Kumar Neeraj Verma, Jean Goubault-Larrecq:
Karp-Miller Trees for a Branching Extension of VASS. Discret. Math. Theor. Comput. Sci. 7(1): 217-230 (2005) - [j5]Jean Goubault-Larrecq:
Deciding H1 by resolution. Inf. Process. Lett. 95(3): 401-408 (2005) - [j4]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): 219-251 (2005) - [j3]Jean Goubault-Larrecq:
Extensions of valuations. Math. Struct. Comput. Sci. 15(2): 271-297 (2005) - [c23]Julien Olivain, Jean Goubault-Larrecq:
The Orchids Intrusion Detection Tool. CAV 2005: 286-290 - [c22]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
- [c21]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang:
Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004: 400-414 - 2003
- [e1]Jean Goubault-Larrecq:
Logical Aspects of Cryptographic Protocol Verification, LACPV 2001, in connection with CAV 2001, Paris, France, July 23, 2001. Electronic Notes in Theoretical Computer Science 55(1), Elsevier 2003 [contents] - 2002
- [c20]Jean Goubault-Larrecq:
Higher-Order Positive Set Constraints. CSL 2002: 473-489 - [c19]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical Relations for Monadic Types. CSL 2002: 553-568 - 2001
- [c18]Muriel Roger, Jean Goubault-Larrecq:
Log Auditing through Model-Checking. CSFW 2001: 220-234 - [c17]Jean Goubault-Larrecq:
Well-Founded Recursive Relations. CSL 2001: 484-497 - [c16]Xavier Rival, Jean Goubault-Larrecq:
Experiments with Finite Tree Automata in Coq. TPHOLs 2001: 362-377 - [c15]Jean Goubault-Larrecq:
Preface. LACPV@CAV 2001: 101-102 - 2000
- [j2]Healfdene Goguen, Jean Goubault-Larrecq:
Sequent combinators: a Hilbert system for the lambda calculus. Math. Struct. Comput. Sci. 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
1990 – 1999
- 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. Log. J. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint