Jean Goubault-Larrecq
Publications
Publications
|
|
Continuous R-valuations9th International Symposium on Domain Theory, Jul 2022, Singapore, Singapore. ⟨10.48550/arXiv.2211.12392⟩ |
|
|
A Probabilistic and Non-Deterministic Call-by-Push-Value Language2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2019, Vancouver, France. pp.1-13, ⟨10.1109/LICS.2019.8785809⟩ |
|
|
Forward Analysis for WSTS, Part III: Karp-Miller Trees37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.16⟩ |
|
|
Deciding Piecewise Testable Separability for Regular Tree LanguagesICALP 2016, Jul 2016, Rome, Italy. pp.97:1--97:15, ⟨10.4230/LIPIcs.ICALP.2016.97⟩ |
|
|
The Directed Homotopy HypothesisProceedings of the 25th Annual EACSL Conference on Computer Science Logic (CSL'16), volume 62 of Leibniz International Proceedings in Informatics, pages 9:1--9:16. Leibniz-Zentrum für Informatik., Sep 2016, Marseille, France |
Bisimulations and unfolding in P-accessible categorical modelsProceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 25:1--25:14. Leibniz-Zentrum für Informatik., Aug 2016, Québec City, Canada |
|
|
|
Static Analysis of Programs with Imprecise Probabilistic InputsVSTTE, May 2013, Snowbird, Utah, United States. pp.22-47, ⟨10.1007/978-3-642-54108-7⟩ |
Continuous Random Variables2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), Jun 2011, Toronto, Canada. pp.97-106, ⟨10.1109/LICS.2011.23⟩ |
|
Continuous Random VariablesIEEE symposium of Logic In Computer Science, Jun 2011, Toronto, Canada. pp.97-106 |
|
|
|
omega-QRB-Domains and the Probabilistic Powerdomain2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), Jul 2010, Edinburgh, United Kingdom. pp.352-361, ⟨10.1109/LICS.2010.50⟩ |
|
|
Forward analysis for WSTS, Part I: Completions26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.433-444 |
|
|
Towards Producing Formally Checkable Security Proofs, Automatically2008 21st IEEE Computer Security Foundations Symposium, Jun 2008, Pittsburgh, United States. pp.224-238, ⟨10.1109/CSF.2008.21⟩ |
On Noetherian Spaces22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), Jul 2007, Wroclaw, France. pp.453-462, ⟨10.1109/LICS.2007.34⟩ |
|
|
|
A Probabilistic Applied Pi-Calculus5th Asian Symposium on Programming Languages and Systems (APLAS'07), Nov 2007, Singapore, Singapore. pp.175-190, ⟨10.1007/978-3-540-76637-7_12⟩ |
|
|
Cryptographic Protocol Analysis on Real C CodeProceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), Jan 2005, Paris, France. pp.363--379, ⟨10.1007/b105073⟩ |
Complete Lax Logical Relations for Cryptographic Lambda-Calculi18th International Workshop on Computer Science Logic (CSL'04), Sep 2004, Karpacz, Poland. pp.400-414 |
|
|
|
Une fois qu'on n'a pas trouvé de preuve, comment le faire comprendre à un assistant de preuve?15èmes Journées Francophones sur les Langages Applicatifs (JFLA'04), Jan 2004, Sainte-Marie-de-Ré, France. pp.1--40 |
Logical Relations for Monadic Types16th International Workshop on Computer Science Logic (CSL'02), Sep 2002, Edinburgh, United Kingdom. pp.553-568 |
|
Higher-Order Positive Set Constraints16th International Workshop on Computer Science Logic (CSL'02), Sep 2002, Edinburgh, United Kingdom. pp.473-489 |
|
Vérification de protocoles cryptographiques: la logique à la rescousse!1er Workshop International sur la Sécurité des Communications sur Internet (SECI'02), Sep 2002, Tunis, Tunisie. pp.119--152 |
|
Log Auditing through Model Checking14th IEEE Computer Security Foundations Workshop (CSFW'01), Jun 2001, Cape Breton, Canada. pp.220-236 |
|
Experiments with Finite Tree Automata in Coq14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'01), Sep 2001, Edinburgh, United Kingdom. pp.362-377 |
|
Well-Founded Recursive Relations15th International Workshop on Computer Science Logic (CSL'01), Sep 2001, Paris, France. pp.484-497 |
|
A Method for Automatic Cryptographic Protocol VerificationWorkshop on Formal Methods for Parallel Programming, May 2000, Cancun, Mexico. pp.977-984 |
|
Reflecting BDDs in Coq6th Asian Computing Science Conference (ASIAN 2000), Nov 2000, Penang, Malaysia. pp.162-181 |
|
|
|
Order-theoretic, geometric and combinatorial models of intuitionistic S4 proofsIMLA 1999 - 1st Workshop on Intuitionistic Modal Logics and Applications, Jul 1999, Trento, Italy |
A proof of weak termination of typed λσ-calculiInternational Workshop on Types for Proofs and Programs (TYPES'96), 1998, Aussois, France. pp.134-153, ⟨10.1007/BFb0097790⟩ |
Special Issue on Models and Methods for Cryptographic Protocol VerificationJournal of Telecommunications and Information Technology, 4/2002, 2002 |
|
Proceedings of the 1st Workshop on Logical Aspects of Cryptographic Protocol Verification (LACPV'01)1st Workshop on Logical Aspects of Cryptographic Protocol Verification (LACPV'01), Jul 2001, Paris, France. Electronic Notes in Theoretical Computer Science, 55 (1), 2001 |
29th EACSL Annual Conference on Computer Science Logic, CSL 2021183, 2021, LIPIcs, 978-3-95977-175-7 |
|
Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020Springer, 12077, 2020, Lecture Notes in Computer Science, 978-3-030-45230-8 |
|
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031)2016 |
|
Non-Hausdorff Topology and Domain Theory---Selected Topics in Point-Set Topology2013 |
|
Proof Theory and Automated DeductionKluwer Academic Publishers, Applied Logic Series (6), 1997, 978-0792345930 |
|
|
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderingsWell Quasi-Orders in Computation, Logic, Language and Reasoning, 53, Springer, pp.55-105, 2020, Trends in Logic, 978-3-030-30228-3. ⟨10.1007/978-3-030-30229-0_3⟩ |
|
|
Fooling the Parallel or Tester with Probability 8/27The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, pp.313-328, 2019, ⟨10.1007/978-3-030-31175-9_18⟩ |
On the Complexity of Monitoring Orchids SignaturesProceedings of the 16th Conference on Runtime Verification (RV'16), volume 10012 of Lecture Notes in Computer Science, Springer Verlag, pp.169-184, 2016, ⟨10.1007/978-3-319-46982-9_11⟩ |
|
Natural HomologyProceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, Kyoto, Japan. Springer., pp.171-183, 2015, ⟨10.1007/978-3-662-47666-6_14⟩ |
|
|
|
Random Measurable SelectionsHorizons of the Mind. A Tribute to Prakash Panangaden, volume 8464 of Lecture Notes in Computer Science, pages 343--362. Springer., pp.343-362, 2014, ⟨10.1007/978-3-319-06880-0_18⟩ |
On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy CaseRevised Selected Papers of the 6th International Symposium on Foundations and Practice of Security (FPS'13), volume 8352 of Lecture Notes in Computer Science, pages 3--16, La Rochelle, France, October 2013. Springer., pp.3-16, 2014, ⟨10.1007/978-3-319-05302-8_1⟩ |
|
|
|
A Constructive Proof of the Topological Kruskal TheoremProceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), volume 8087 of Lecture Notes in Computer Science, pages 22--41, Klosterneuburg, Austria, August 2013. Springer., pp.22-41, 2013, ⟨10.1007/978-3-642-40313-2_3⟩ |
The Blossom of Finite Semantic TreesProgramming Logics -- Essays in Memory of Harald Ganzinger, volume 7797 of Lecture Notes in Computer Science, pages 90--122. Springer., 2013 |
|
|
|
The Theory of WSTS: The Case of Complete WSTSProceedings of the 33rd International Conference on Applications and Theory of Petri Nets (PETRI NETS'12), volume 7347 of Lecture Notes in Computer Science, Hamburg, Germany. Springer, pp.3-31, 2012, ⟨10.1007/978-3-642-31131-4_2⟩ |
Some Ideas on Virtualized System Security, and MonitorsRevised Selected Papers of the 5th International Workshop on Data Privacy Management and Autonomous Spontaneous Security (DPM'10) and 3rd International Workshop on Autonomous and Spontaneous Security (SETOP'10), volume 6514 of Lecture Notes in Computer Science, Athens, Greece, September 2010. Springer, pp.244-258, 2011, ⟨10.1007/978-3-642-19348-4_18⟩ |
|
|
|
Noetherian Spaces in VerificationProceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, Bordeaux, France, July 2010. Springer, pp.2-21, 2010, ⟨10.1007/978-3-642-14162-1_2⟩ |
“Logic Wins!”Proceedings of the 13th Asian Computing Science Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science, Seoul, Korea, December 2009. Springer., pp.1-16, 2009, ⟨10.1007/978-3-642-10622-4_1⟩ |
|
|
|
Forward Analysis for WSTS, Part II: Complete WSTSProceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5556 of Lecture Notes in Computer Science, Rhodes, Greece, July 2009. Springer., pp.188-199, 2009, ⟨10.1007/978-3-642-02930-1_16⟩ |
Forward Analysis for WSTS, Part I: CompletionsLeibniz-Zentrum für Informatik. Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS'09), volume 3 of Leibniz International Proceedings in Informatics, Freiburg, Germany., pp.433-444, 2009 |
|
A Smell of OrchidsProceedings of the 8th Workshop on Runtime Verification (RV'08), volume 5289 of Lecture Notes in Computer Science, Budapest, Hungary, Springer., pp.1-20, 2008, ⟨10.1007/978-3-540-89247-2_1⟩ |
|
|
|
Prevision Domains and Convex PowerconesFoundations of Software Science and Computational Structures, 4962, Springer Berlin Heidelberg, pp.318-333, 2008, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-78499-9_23⟩ |
|
|
Simulation Hemi-metrics between Infinite-State Stochastic GamesFoundations of Software Science and Computational Structures, 4962, Springer Berlin Heidelberg, pp.50-65, 2008, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-78499-9_5⟩ |
|
|
A Logical Framework for Evaluating Network Resilience Against Faults and AttacksAdvances in Computer Science – ASIAN 2007. Computer and Network Security, 4846, Springer Berlin Heidelberg, pp.212-227, 2007, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-76929-3_20⟩ |
|
|
Continuous Capacities on Continuous State SpacesAutomata, Languages and Programming, 4596, Springer Berlin Heidelberg, pp.764-776, 2007, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-73420-8_66⟩ |
|
|
Continuous PrevisionsComputer Science Logic, 4646, Springer Berlin Heidelberg, pp.542-557, 2007, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-74915-8_40⟩ |
Preuve et vérification pour la sécurité et la sûretéEncyclopédie de l'informatique et des systèmes d'information, chapitre I.6, pages 683--703. Vuibert, 2006 |
|
|
|
The Orchids Intrusion Detection ToolProceedings of the 17th International Conference on Computer Aided Verification (CAV'05), volume 3576 of Lecture Notes in Computer Science, Edinburgh, Scotland, UK. Springer, pp.286-290, 2005, ⟨10.1007/11513988_28⟩ |
Conjunctive Types and SKInTSelected Papers from the International Workshop on Types for Proofs and Programs (TYPES'98), 1657, Springer, pp.106-120, 1999, Lecture Notes in Computer Science, ⟨10.1007/3-540-48167-2_8⟩ |
|
A Simple Sequent System for First-Order Logic with Free ConstructorsProceedings of the 8th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'99), 1617, Springer, pp.202-216, 1999, Lecture Notes in Artificial Intelligence, ⟨10.1007/3-540-48754-9_19⟩ |
|
|
|
A tableau system for linear-TIME temporal logicProceedings of the 3rd International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'97), Enschede, The Netherlands, April 1997, 1217, Springer, pp.130-144, 1997, Lecture Notes in Computer Science, ⟨10.1007/BFb0035385⟩ |
Les méthodes formelles: l'autre arme de la cybersécurité2016 |
|
Gérard Berry : un informaticien médaille d'or du CNRS 20142014 |
|
Sécurité, modélisation et analyse de protocoles cryptographiques2002 |
|
|
On a Generalization of a Result by Valk and Jantzen2021 |
|
|
A few notes on formal balls2016 |
|
|
A Cone-Theoretic Krein-Milman Theorem2008 |
|
|
Believe It Or Not, GOI is a Model of Classical Linear Logic2007 |
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).[Research Report] Schloss Dagstuhl - Leibniz Center for Informatics. 2016 |
|
|
|
Concrete Semantics of Programs with Non-Deterministic and Random Inputs[Research Report] LSV, ENS Cachan. 2012 |
|
|
Detecting Subverted Cryptographic Protocols by Entropy Checking[Research Report] LSV-06-13, LSV, ENS Cachan. 2006 |
|
|
Un algorithme pour l'analyse de logs[Rapport de recherche] LSV-02-18, LSV, ENS Cachan. 2002 |
|
|
A Note on the Completeness of Certain Refinements of Resolution[Research Report] LSV-02-8, LSV, ENS Cachan. 2002, pp.16 |
|
|
Alternating Two-Way AC-Tree Automata[Research Report] LSV-02-11, LSV, ENS Cachan. 2002, pp.21 |
|
|
SKInT Labels[Research Report] LSV-02-7, LSV, ENS Cachan. 2002 |
|
|
Higher-Order Automata, Pushdown Systems, and Set Constraints[Research Report] LSV-01-9, LSV, ENS Cachan. 2001, pp.15 |
|
|
Reflecting BDDs in Coq[Research Report] RR-3859, INRIA. 2000 |
|
|
A Simple Deduction System for First-Order Logic with Equality, Free Constructors and Induction[Research Report] RR-3653, INRIA. 1999 |
|
|
A Few Remarks on SKInT[Research Report] RR-3475, INRIA. 1998 |
|
|
On Computational Interpretations of the Modal Logic S4 IIIb. Confluence, Termination of the $\lambda\mbox{ev}Q_H$-Calculus[Research Report] RR-3164, INRIA. 1997 |
|
|
A Proof of Weak Termination of the Simply-Typed {$\lambda\sigma$}-Calculus[Research Report] RR-3090, INRIA. 1997 |