Publications : Jean GOUBAULT

[Gou19b]
J. Goubault-Larrecq. A Probabilistic and Non-Deterministic Call-by-Push-Value Language. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), Vancouver, Canada, June 2019. IEEE Press. To appear.
BibTex ]
[GL19]
J. Goubault-Larrecq. Spaces with no Infinite Discrete Subspace. Topology Proceedings, 53:27--36, 2019. http://topology.auburn.edu/tp/reprints/v53/tp53003p1.pdf.
BibTex ]
[Gou19a]
J. Goubault-Larrecq. Formal Ball Monads. Topology and its Applications, 2019. To appear.
doi: 10.1016/j.topol.2019.06.044.
BibTex | DOI | Web page ]
[GL18]
J. Goubault-Larrecq and J.-P. Lachance. On the Complexity of Monitoring Orchids Signatures, and Recurrence Equations. Formal Methods in System Design, 53(1):6--32, August 2018. Special issue of RV'16, to appear.
doi: 10.1007/s10703-017-0303-x.
BibTex | DOI | Web page ]
[Gou18]
J. Goubault-Larrecq. A semantics for nabla. Mathematical Structures in Computer Science, pages 1--25, 2018. To appear.
doi: 10.1017/S0960129518000063.
BibTex | DOI | Web page ]
[HGLJX18]
W. K. Ho, J. Goubault-Larrecq, A. Jung, and X. Xi. The Ho-Zhao Problem. Logical Methods in Computer Science, 14(1):1--19, January 2018.
doi: 10.23638/LMCS-14(1:7)2018.
BibTex | DOI | Web page | PDF ]
[BFG17]
M. Blondin, A. Finkel, and J. Goubault-Larrecq. Forward Analysis for WSTS, Part III: Karp-Miller Trees. In Proceedings of the 37th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17), volume 93 of Leibniz International Proceedings in Informatics, pages 16:1--16:15, Kanpur, India, December 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2017.16.
BibTex | DOI | Web page | PDF ]
[GN17]
J. Goubault-Larrecq and K. M. Ng. A Few Notes on Formal Balls. Logical Methods in Computer Science, 13(4):1--34, November 2017. Special Issue of the Domains XII Workshop.
doi: 10.23638/LMCS-13(4:18)2017.
BibTex | DOI | Web page | PDF ]
[DGG17]
J. Dubut, É. Goubault, and J. Goubault-Larrecq. Directed homology theories and Eilenberg-Steenrod axioms. Applied Categorical Structures, 25(5):775--807, October 2017.
doi: doi:10.1007/s10485-016-9438-y.
BibTex | DOI | Web page | PDF ]
[Gou17a]
J. Goubault-Larrecq. Isomorphism theorems between models of mixed choice. Mathematical Structures in Computer Science, 27(6):1032--1067, September 2017.
doi: 10.1017/S0960129515000547.
BibTex | DOI | Web page | PDF ]
[Gou17b]
J. Goubault-Larrecq. A Non-Hausdorff Minimax Theorem. Minimax Theory and its Applications, 3(1):73--80, 2017.
BibTex ]
[Gou16d]
J. Goubault-Larrecq. A semantics for . Invited talk, Dale Miller Festschrift, Paris Diderot University, Paris, December 2016.
BibTex ]
[GL16]
J. Goubault-Larrecq and J. Lachance. On the Complexity of Monitoring Orchids Signatures. In Proceedings of the 16th Conference on Runtime Verification (RV'16), volume 10012 of Lecture Notes in Computer Science, pages 169--164, Madrid, Spain, September 2016. Springer.
doi: 10.1007/978-3-319-46982-9_11.
BibTex | DOI ]
[DGG16b]
J. Dubut, É. Goubault, and J. Goubault-Larrecq. The Directed Homotopy Hypothesis. In Proceedings 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, Marseille, France, September 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2016.9.
BibTex | DOI | Web page | PDF ]
[DGG16a]
J. Dubut, É. Goubault, and J. Goubault-Larrecq. Bisimulations and unfolding in P-accessible categorical models. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 25:1--25:14, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.25.
BibTex | DOI | Web page | PDF ]
[Gou16a]
J. Goubault-Larrecq. A few things on Noetherian spaces. Invited talk (plenary speaker), Summer Topology Conference, Leicester, UK, August 2016.
BibTex ]
[Gou16b]
J. Goubault-Larrecq. An introduction to asymmetric topology and domain theory: why, what, and how. Invited talk, Galway Symposium, Leicester, UK, August 2016.
BibTex ]
[GS16]
J. Goubault-Larrecq and S. Schmitz. Deciding Piecewise Testable Separability for Regular Tree Languages. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 97:1--97:15, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.97.
BibTex | DOI | Web page ]
[GLSHHM16]
J. Goubault-Larrecq, P.-A. Sentucq, F. Hulin-Hubard, and F. Majorczyk. Etat final des travaux engagés sur Orchids. Rapport final et fourniture 4 du contrat DGA-INRIA Orchids, May 2016.
BibTex ]
[GLM16]
J. Goubault-Larrecq and F. Majorczyk. Génération de signatures pour le suivi de flux d'informations. Fourniture 3 du contrat DGA-INRIA Orchids, May 2016.
BibTex ]
[GSSW16]
J. Goubault-Larrecq, M. Seisenberger, V. Selivanov, and A. Weiermann. Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports, 6(1):69--98, January 2016.
doi: 10.4230/DagRep.6.1.69.
BibTex | DOI | Web page | PDF ]
[Gou16c]
J. Goubault-Larrecq. Les méthodes formelles: l'autre arme de la cybersécurité. Encart dans l'article ”S'adapter à la cyberguerre”, de Karen Elazari, Pour La Science 459, January 2016.
BibTex ]
[Gou15b]
J. Goubault-Larrecq. Formal balls. Invited talk, Domains XII workshop, Cork, Ireland, August 2015.
BibTex ]
[DGG15]
J. Dubut, É. Goubault, and J. Goubault-Larrecq. Natural Homology. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, pages 171--183, Kyoto, Japan, July 2015. Springer.
doi: 10.1007/978-3-662-47666-6_14.
BibTex | DOI | Web page | PDF ]
[GLSM15]
J. Goubault-Larrecq, P.-A. Sentucq, and F. Majorczyk. Etat d'avancement intermédiaire des travaux engagés sur OrchIDS. Rapport intermédiaire du contrat DGA-INRIA Orchids, May 2015.
BibTex ]
[Gou15c]
J. Goubault-Larrecq. Full Abstraction for Non-Deterministic and Probabilistic Extensions of PCF I: the Angelic Cases. Journal of Logic and Algebraic Methods in Programming, 84(1):155--184, January 2015.
doi: 10.1016/j.jlamp.2014.09.003.
BibTex | DOI | Web page | PDF ]
[Gou15a]
J. Goubault-Larrecq. A short proof of the Schröder-Simpson theorem. Mathematical Structures in Computer Science, 25(1):1--5, January 2015.
doi: 10.1017/S0960129513000467.
BibTex | DOI | Web page | PDF ]
[Gou14a]
J. Goubault-Larrecq. Détection d'intrusions avec OrchIDS. Matinale de l'innovation Logiciels Libres et Sécurité, Paris, France, December 2014.
BibTex ]
[AFG14]
S. Abiteboul, L. Fribourg, and J. Goubault-Larrecq. Gérard Berry : un informaticien médaille d'or du CNRS 2014. 1024 -- Bulletin de la société informatique de France, 4:139--142, October 2014.
BibTex | Web page | PDF ]
[Gou14c]
J. Goubault-Larrecq. Noetherian spaces. Invited talk, Continuity, Computability, Constructivity workshop (CCC), Ljubljana, Slovenia, September 2014.
BibTex ]
[Gou14d]
J. Goubault-Larrecq. OrchIDS: on the value of rigor in intrusion detection. CPS Summer School, Grenoble, France, July 2014.
BibTex ]
[GJ14]
J. Goubault-Larrecq and A. Jung. QRB, QFS, and the Probabilistic Powerdomain. In Proceedings of the 30th Conference on Mathematical Foundations of Programming Semantics (MFPS'14), volume 308 of Electronic Notes in Theoretical Computer Science, pages 167--182, Ithaca, New York, USA, June 2014. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2014.10.010.
BibTex | DOI | Web page | PDF ]
[Gou14b]
J. Goubault-Larrecq. Exponentiable streams and prestreams. Applied Categorical Structures, 22(3):515--549, June 2014.
doi: 10.1007/s10485-013-9315-x.
BibTex | DOI | Web page | PDF ]
[GLSM14b]
J. Goubault-Larrecq, P.-A. Sentucq, and F. Majorczyk. Techniques et méthodes de génération de signatures pour la détection d'intrusions. Fourniture 2 du contrat DGA-INRIA Orchids, May 2014.
BibTex ]
[GLSM14a]
J. Goubault-Larrecq, P.-A. Sentucq, and F. Majorczyk. Politiques de sécurité système. Fourniture 1 du contrat DGA-INRIA Orchids, May 2014.
BibTex ]
[ABG+14]
A. Adjé, O. Bouissou, J. Goubault-Larrecq, É. Goubault, and S. Putot. Static Analysis of Programs with Imprecise Probabilistic Inputs. In Revised Selected Papers of the 5th IFIP TC2/WG2.3 Conference Verified Software---Theories, Tools, and Experiments (VSTTE'13), volume 8164 of Lecture Notes in Computer Science, pages 22--47, Atherton, California, USA, 2014. Springer.
doi: 10.1007/978-3-642-54108-7.
BibTex | DOI | Web page | PDF ]
[GS14]
J. Goubault-Larrecq and R. Segala. Random Measurable Selections. In Horizons of the Mind. A Tribute to Prakash Panangaden, volume 8464 of Lecture Notes in Computer Science, pages 343--362. Springer, 2014.
doi: 10.1007/978-3-319-06880-0_18.
BibTex | DOI | Web page | PDF ]
[GO13]
J. Goubault-Larrecq and J. Olivain. On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy Case. In Revised 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.
doi: 10.1007/978-3-319-05302-8_1.
BibTex | DOI | Web page | PDF ]
[Gou13a]
J. Goubault-Larrecq. A Constructive Proof of the Topological Kruskal Theorem. In Proceedings 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.
doi: 10.1007/978-3-642-40313-2_3.
BibTex | DOI | Web page | PDF ]
[Gou13b]
J. Goubault-Larrecq. A few pearls in the theory of quasi-metric spaces. Invited talk (semi-plenary speaker), Summer Topology Conference, North Bay, Ontario, CA, July 2013.
BibTex ]
[Gou13e]
J. Goubault-Larrecq. A short proof of the Schröder-Simpson theorem. Invited talk, Workshop on Asymmetric Topology, Summer Topology Conference, North Bay, Ontario, CA, July 2013.
BibTex ]
[Gou13d]
J. Goubault-Larrecq. OrchIDS, ou : de l'importance de la sémantique. Séminaire DGA Innosciences. DGA, Bagneux, June 2013.
BibTex ]
[Gou13c]
J. Goubault-Larrecq. Non-Hausdorff Topology and Domain Theory---Selected Topics in Point-Set Topology, volume 22 of New Mathematical Monographs. Cambridge University Press, March 2013.
BibTex | Web page ]
[GJ13]
J. Goubault-Larrecq and J.-P. Jouannaud. The Blossom of Finite Semantic Trees. In Programming Logics -- Essays in Memory of Harald Ganzinger, volume 7797 of Lecture Notes in Computer Science, pages 90--122. Springer, January 2013.
BibTex | Web page | PDF ]
[AG12]
A. Adjé and J. Goubault-Larrecq. Concrete Semantics of Programs with Non-Deterministic and Random Inputs. Research Report cs.LO/1210.2605, Computing Research Repository, October 2012. 19 pages.
BibTex | Web page | PDF ]
[AGL12]
A. Adjé and J. Goubault-Larrecq. Concrete semantics of programs with non-deterministic and random inputs. Fourniture du projet ANR CPP (Confidence, Proofs, and Probabilities), WP 2, version 1, October 2012.
BibTex | Web page ]
[FG12a]
A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part II: Complete WSTS. Logical Methods in Computer Science, 8(3:28), September 2012.
doi: 10.2168/LMCS-8(3:28)2012.
BibTex | DOI | Web page | PDF ]
[FG12b]
A. Finkel and J. Goubault-Larrecq. The Theory of WSTS: The Case of Complete WSTS. In Proceedings of the 33rd International Conference on Applications and Theory of Petri Nets (PETRI NETS'12), volume 7347 of Lecture Notes in Computer Science, pages 3--31, Hamburg, Germany, June 2012. Springer.
doi: 10.1007/978-3-642-31131-4_2.
BibTex | DOI | Web page | PDF ]
[BGGP12]
O. Bouissou, É. Goubault, J. Goubault-Larrecq, and S. Putot. A Generalization of P-boxes to Affine Arithmetic, and Applications to Static Analysis of Programs. Computing, 94(2-4):189--201, March 2012.
doi: 10.1007/s00607-011-0182-8.
BibTex | DOI | Web page | PDF ]
[Gou12]
J. Goubault-Larrecq. QRB-Domains and the Probabilistic Powerdomain. Logical Methods in Computer Science, 8(1:14), 2012.
doi: 10.2168/LMCS-8(1:14)2012.
BibTex | DOI | Web page | PDF ]
[Gou11a]
J. Goubault-Larrecq. A Few Pearls in the Theory of Quasi-Metric Spaces. Invited talk, Fifth International Conference on Topology, Algebra, and Categories in Logic (TACL'11), Marseilles, France, July 2011, July 2011.
BibTex ]
[GK11]
J. Goubault-Larrecq and K. Keimel. Choquet-Kendall-Matheron Theorems for Non-Hausdorff Spaces. Mathematical Structures in Computer Science, 21(3):511--561, June 2011.
doi: 10.1017/S0960129510000617.
BibTex | DOI | Web page | PDF ]
[GV11]
J. Goubault-Larrecq and D. Varacca. Continuous Random Variables. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS'11), pages 97--106, Toronto, Canada, June 2011. IEEE Computer Society Press.
doi: 10.1109/LICS.2011.23.
BibTex | DOI | Web page | PDF ]
[Gou11b]
J. Goubault-Larrecq. Musings Around the Geometry of Interaction, and Coherence. Theoretical Computer Science, 412(20):1998--2014, April 2011.
doi: 10.1016/j.tcs.2010.12.023.
BibTex | DOI | Web page | PDF ]
[OGB+11]
J. Olivain, J. Goubault-Larrecq, H. Benzina, B. Gourdin, and R. Ben Younès. ORCHIDS, 2011.
BibTex | Web page ]
[Gou10b]
J. Goubault-Larrecq. Finite Models for Formal Security Proofs. Journal of Computer Security, 18(6):1247--1299, November 2010.
doi: 10.3233/JCS-2009-0395.
BibTex | DOI | Web page | PDF ]
[BGGP10]
O. Bouissou, É. Goubault, J. Goubault-Larrecq, and S. Putot. A Generalization of P-boxes to Affine Arithmetic, and Applications to Static Analysis of Programs. In Proceedings of the 14th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN'10), Lyon, France, September 2010.
BibTex ]
[BG10]
H. Benzina and J. Goubault-Larrecq. Some Ideas on Virtualized Systems Security, and Monitors. In Revised 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, pages 244--258, Athens, Greece, September 2010. Springer.
doi: 10.1007/978-3-642-19348-4_18.
BibTex | DOI | Web page | PDF ]
[Gou10c]
J. Goubault-Larrecq. Noetherian Spaces in Verification. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) -- Part II, volume 6199 of Lecture Notes in Computer Science, pages 2--21, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_2.
BibTex | DOI | Web page | PDF ]
[Gou10d]
J. Goubault-Larrecq. ωQRB-Domains and the Probabilistic Powerdomain. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS'10), pages 352--361, Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press.
doi: 10.1109/LICS.2010.50.
BibTex | DOI | Web page | PDF ]
[Gou10a]
J. Goubault-Larrecq. De Groot Duality and Models of Choice: Angels, Demons, and Nature. Mathematical Structures in Computer Science, 20(2):169--237, April 2010.
doi: 10.1017/S0960129509990363.
BibTex | DOI | Web page | PDF ]
[Gou09a]
J. Goubault-Larrecq. Logic Wins!. In Proceedings of the 13th Asian Computing Science Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science, pages 1--16, Seoul, Korea, December 2009. Springer.
doi: 10.1007/978-3-642-10622-4_1.
BibTex | DOI | Web page | PDF ]
[FG09b]
A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part II: Complete WSTS. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), volume 5556 of Lecture Notes in Computer Science, pages 188--199, Rhodes, Greece, July 2009. Springer.
doi: 10.1007/978-3-642-02930-1_16.
BibTex | DOI | Web page | PDF ]
[Gou09b]
J. Goubault-Larrecq. On a Generalization of a Result by Valk and Jantzen. Research Report LSV-09-09, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2009. 18 pages.
BibTex | Web page | PDF ]
[FG09a]
A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part I: Completions. In Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS'09), volume 3 of Leibniz International Proceedings in Informatics, pages 433--444, Freiburg, Germany, February 2009. Leibniz-Zentrum für Informatik.
BibTex | Web page | PDF ]
[Gou08c]
J. Goubault-Larrecq. HimML: HimML is a map-oriented ML, December 2008.
BibTex | Web page ]
[GLN08]
J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical Relations for Monadic Types. Mathematical Structures in Computer Science, 18(6):1169--1217, December 2008. 81 pages.
doi: 10.1017/S0960129508007172.
BibTex | DOI | Web page | PDF ]
[Gou08a]
J. Goubault-Larrecq. A Cone-Theoretic Krein-Milman Theorem. Research Report LSV-08-18, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2008. 8 pages.
BibTex | Web page | PDF ]
[Gou08f]
J. Goubault-Larrecq. Towards Producing Formally Checkable Security Proofs, Automatically. In Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF'08), pages 224--238, Pittsburgh, Pennsylvania, USA, June 2008. IEEE Computer Society Press.
doi: 10.1109/CSF.2008.21.
BibTex | DOI | Web page | PDF ]
[Gou08e]
J. Goubault-Larrecq. Simulation Hemi-Metrics Between Infinite-State Stochastic Games. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 50--65, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_5.
BibTex | DOI | Web page ]
[Gou08d]
J. Goubault-Larrecq. Prevision Domains and Convex Powercones. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), volume 4962 of Lecture Notes in Computer Science, pages 318--333, Budapest, Hungary, March-April 2008. Springer.
doi: 10.1007/978-3-540-78499-9_23.
BibTex | DOI | Web page ]
[GO08]
J. Goubault-Larrecq and J. Olivain. A Smell of Orchids. In Proceedings of the 8th Workshop on Runtime Verification (RV'08), volume 5289 of Lecture Notes in Computer Science, pages 1--20, Budapest, Hungary, March 2008. Springer.
doi: 10.1007/978-3-540-89247-2_1.
BibTex | DOI | Web page | PDF ]
[Gou08b]
J. Goubault-Larrecq. The h1 Tool Suite, January 2008.
BibTex | Web page ]
[BG07]
E. Bursztein and J. Goubault-Larrecq. A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. In Proceedings of the 12th Asian Computing Science Conference (ASIAN'07), volume 4846 of Lecture Notes in Computer Science, pages 212--227, Doha, Qatar, December 2007. Springer.
doi: 10.1007/978-3-540-76929-3_20.
BibTex | DOI | Web page | PDF ]
[GPT07]
J. Goubault-Larrecq, C. Palamidessi, and A. Troina. A Probabilistic Applied Pi-Calculus. In Proceedings of the 5th Asian Symposium on Programming Languages and Systems (APLAS'07), volume 4807 of Lecture Notes in Computer Science, pages 175--290, Singapore, November-December 2007. Springer.
doi: 10.1007/978-3-540-76637-7_12.
BibTex | DOI | Web page | PDF ]
[GL07]
J. Goubault-Larrecq. Pronobis: Probability and nondeterminism, bisimulations and security. Rapport final ARC ProNoBis, October 2007.
BibTex ]
[Gou07c]
J. Goubault-Larrecq. Continuous Previsions. In Proceedings of the 16th Annual EACSL Conference on Computer Science Logic (CSL'07), volume 4646 of Lecture Notes in Computer Science, pages 542--557, Lausanne, Switzerland, September 2007. Springer.
doi: 10.1007/978-3-540-74915-8_40.
BibTex | DOI | Web page | PDF ]
[Gou07b]
J. Goubault-Larrecq. Continuous Capacities on Continuous State Spaces. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), volume 4596 of Lecture Notes in Computer Science, pages 764--776, Wroclaw, Poland, July 2007. Springer.
doi: 10.1007/978-3-540-73420-8_66.
BibTex | DOI | Web page | PDF ]
[Gou07d]
J. Goubault-Larrecq. On Noetherian Spaces. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07), pages 453--462, Wroclaw, Poland, July 2007. IEEE Computer Society Press.
doi: 10.1109/LICS.2007.34.
BibTex | DOI | Web page | PDF ]
[VG07]
K. N. Verma and J. Goubault-Larrecq. Alternating Two-Way AC-Tree Automata. Information and Computation, 205(6):817--869, June 2007.
doi: 10.1016/j.ic.2006.12.006.
BibTex | DOI | Web page | PS | PDF ]
[Gou07a]
J. Goubault-Larrecq. Believe It Or Not, GOI is a Model of Classical Linear Logic. Research Report LSV-07-03, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007. 18 pages.
BibTex | Web page | PDF ]
[Gou06b]
J. Goubault-Larrecq. Preuve et vérification pour la sécurité et la sûreté. In Encyclopédie de l'informatique et des systèmes d'information, chapter I.6, pages 683--703. Vuibert, December 2006.
BibTex | Web page ]
[Gou06a]
J. Goubault-Larrecq. The ORCHIDS Intrusion Prevention System. Invited talk, Annual Adaptive and Resilient Computing Systems Workshop (AARCS'06), Santa Fe, New Mexico, USA, November 2006.
BibTex | Web page ]
[OG06]
J. Olivain and J. Goubault-Larrecq. Detecting Subverted Cryptographic Protocols by Entropy Checking. Research Report LSV-06-13, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2006. 19 pages.
BibTex | Web page | PDF ]
[Gou05a]
J. Goubault-Larrecq. A Biased Survey of Models and Methods for Verifying Cryptographic Protocols. Invited talk, Workshop on Classical and Quantum Information Security, Pasadena, California, USA, December 2005.
BibTex | Web page ]
[VG05]
K. N. Verma and J. Goubault-Larrecq. Karp-Miller Trees for a Branching Extension of VASS. Discrete Mathematics & Theoretical Computer Science, 7(1):217--230, November 2005.
BibTex | Web page | PS | PDF ]
[GRV05]
J. Goubault-Larrecq, M. Roger, and K. N. Verma. Abstraction and Resolution Modulo AC: How to Verify Diffie-Hellman-like Protocols Automatically. Journal of Logic and Algebraic Programming, 64(2):219--251, August 2005.
doi: 10.1016/j.jlap.2004.09.004.
BibTex | DOI | Web page | PS ]
[Gou05b]
J. Goubault-Larrecq. Deciding H_1 by Resolution. Information Processing Letters, 95(3):401--408, August 2005.
doi: 10.1016/j.ipl.2005.04.007.
BibTex | DOI | Web page | PDF ]
[OG05]
J. Olivain and J. Goubault-Larrecq. The Orchids Intrusion Detection Tool. In Proceedings of the 17th International Conference on Computer Aided Verification (CAV'05), volume 3576 of Lecture Notes in Computer Science, pages 286--290, Edinburgh, Scotland, UK, July 2005. Springer.
doi: 10.1007/11513988_28.
BibTex | DOI | Web page | PDF ]
[Gou05c]
J. Goubault-Larrecq. Extensions of Valuations. Mathematical Structures in Computer Science, 15(2):271--297, April 2005.
doi: 10.1017/S096012950400461X.
BibTex | DOI | Web page | PS ]
[GP05]
J. Goubault-Larrecq and F. Parrennes. Cryptographic Protocol Analysis on Real C Code. In Proceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), volume 3385 of Lecture Notes in Computer Science, pages 363--379, Paris, France, January 2005. Springer.
doi: 10.1007/b105073.
BibTex | DOI | Web page | PDF ]
[GLNZ04]
J. Goubault-Larrecq, S. Lasota, D. Nowak, and Y. Zhang. Complete Lax Logical Relations for Cryptographic Lambda-Calculi. In Proceedings the 18th International Workshop on Computer Science Logic (CSL'04), volume 3210 of Lecture Notes in Computer Science, pages 400--414, Karpacz, Poland, September 2004. Springer.
BibTex | Web page | PS ]
[Gou04a]
J. Goubault-Larrecq. On Computational Interpretations of the Modal Logic S4. Invited talk, 2nd Workshop on the Logic for Pragmatics (WoLP'04), Créteil, France, July 2004.
BibTex ]
[Gou04b]
J. Goubault-Larrecq. On Cryptographic Protocols, Regular Tree Languages, and Automated Deduction. Invited talk, Workshop on Security of Systems: Formalism and Tools (SASYFT'04), Orleans, France, June 2004.
BibTex | Web page ]
[GP04]
J. Goubault-Larrecq and F. Parrennes. Csur: Static Analysis of C Code, 2004.
BibTex | Web page ]
[Gou04c]
J. Goubault-Larrecq. Une fois qu'on n'a pas trouvé de preuve, comment le faire comprendre à un assistant de preuve ? In Actes des 15èmes Journées Francophones sur les Langages Applicatifs (JFLA'04), pages 1--40, Sainte-Marie-de-Ré, France, January 2004. INRIA. Invited paper.
BibTex | Web page | PS ]
[DDG+03]
S. Demri, M. Ducassé, J. Goubault-Larrecq, L. Mé, J. Olivain, C. Picaronny, J.-Ph. Pouzol, É. Totel, and B. Vivinis. Algorithmes de détection et langages de signatures. Contract Report (Sous-projet 3, livrable 3), projet RNTL DICO, October 2003. 72 pages.
BibTex ]
[GG03]
J. Goubault-Larrecq and É. Goubault. On the Geometry of Intuitionistic S4 Proofs. Homology, Homotopy and Applications, 5(2):137--209, 2003.
BibTex | Web page | PS ]
[Gou02h]
J. Goubault-Larrecq. Un algorithme pour l'analyse de logs. Research Report LSV-02-18, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2002. 33 pages.
BibTex | Web page | PS ]
[GLN02]
J. Goubault-Larrecq, S. Lasota, and D. Nowak. Logical Relations for Monadic Types. In Proceedings of the 16th International Workshop on Computer Science Logic (CSL'02), volume 2471 of Lecture Notes in Computer Science, pages 553--568, Edinburgh, Scotland, UK, September 2002. Springer.
BibTex | Web page | PS ]
[Gou02b]
J. Goubault-Larrecq. Higher-Order Positive Set Constraints. In Proceedings of the 16th International Workshop on Computer Science Logic (CSL'02), volume 2471 of Lecture Notes in Computer Science, pages 473--489, Edinburgh, Scotland, UK, September 2002. Springer.
BibTex | Web page | PS ]
[Gou02i]
J. Goubault-Larrecq. Vérification de protocoles cryptographiques: la logique à la rescousse! In Actes du 1er Workshop International sur la Sécurité des Communications sur Internet (SECI'02), pages 119--152, Tunis, Tunisia, September 2002. INRIA. Invited paper.
BibTex | Web page | PS ]
[GV02]
J. Goubault-Larrecq and K. N. Verma. Alternating Two-Way AC-Tree Automata. Research Report LSV-02-11, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2002. 21 pages.
BibTex | Web page | PS ]
[Gou02f]
J. Goubault-Larrecq. SKInT Labels. Research Report LSV-02-7, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2002. 15 pages.
BibTex | Web page | PS ]
[Gou02c]
J. Goubault-Larrecq. A Note on the Completeness of Certain Refinements of Resolution. Research Report LSV-02-8, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2002. 16 pages.
BibTex | Web page | PS ]
[GPD+02]
J. Goubault-Larrecq, J.-Ph. Pouzol, S. Demri, L. Mé, and P. Carle. Langages de détection d'attaques par signatures. Contract Report (Sous-projet 3, livrable 1), Projet RNTL DICO, June 2002. 30 pages.
BibTex ]
[Gou02d]
J. Goubault-Larrecq. Outils CPV et CPV2. Contract Report 8, Projet RNTL EVA, May 2002. 7 pages.
BibTex | Web page | PDF ]
[Gou02a]
J. Goubault-Larrecq. The EVA Parser and Translator. Available at http://www.lsv.ens-cachan.fr/~goubault/EVA.html, 2002. Started 2001. Written in C (1327 lines), OCaml (361 lines), HimML (see [Gou08c]) (3454 lines).
BibTex | Web page ]
[Gou02g]
J. Goubault-Larrecq. Special Issue on Models and Methods for Cryptographic Protocol Verification. Journal of Telecommunications and Information Technology, 4/2002, 2002.
BibTex | Web page ]
[Gou02e]
J. Goubault-Larrecq. Sécurité, modélisation et analyse de protocoles cryptographiques. Phœbus, la revue de la sûreté de fonctionnement, 20, 2002.
BibTex | Web page ]
[Gou01b]
J. Goubault-Larrecq. Les syntaxes et la sémantique du langage de spécification EVA. Contract Report 3, projet RNTL EVA, November 2001. 32 pages.
BibTex | Web page | PS | PDF ]
[Gou01a]
J. Goubault-Larrecq. Higher-Order Automata, Pushdown Systems, and Set Constraints. Research Report LSV-01-9, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2001. 15 pages.
BibTex | Web page | PS ]
[Gou01d]
J. Goubault-Larrecq. Well-Founded Recursive Relations. In Proceedings of the 15th International Workshop on Computer Science Logic (CSL'01), volume 2142 of Lecture Notes in Computer Science, pages 484--497, Paris, France, September 2001. Springer.
BibTex | Web page | PS ]
[RG01a]
X. Rival and J. Goubault-Larrecq. Experiments with Finite Tree Automata in Coq. In Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'01), volume 2152 of Lecture Notes in Computer Science, pages 362--377, Edinburgh, Scotland, UK, September 2001. Springer.
BibTex | Web page | PS ]
[Gou01c]
J. Goubault-Larrecq. Une proposition de langage de description de protocoles cryptographiques. Contract Report 2, projet RNTL EVA, July 2001. 12 pages.
BibTex ]
[RG01b]
M. Roger and J. Goubault-Larrecq. Log Auditing through Model Checking. In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW'01), pages 220--236, Cape Breton, Nova Scotia, Canada, June 2001. IEEE Computer Society Press.
BibTex | Web page | PS ]
[VGPA00]
K. N. Verma, J. Goubault-Larrecq, S. Prasad, and S. Arun-Kumar. Reflecting BDDs in Coq. In Proceedings of the 6th Asian Computing Science Conference (ASIAN 2000), volume 1961 of Lecture Notes in Computer Science, pages 162--181, Penang, Malaysia, November 2000. Springer.
BibTex | Web page | PS ]
[Gou00a]
J. Goubault-Larrecq. Analyse de protocoles cryptographiques. Invited lecture, Journées ASPROM, Paris, France, October 2000.
BibTex ]
[Gou00b]
J. Goubault-Larrecq. A Method for Automatic Cryptographic Protocol Verification (Extended Abstract). In Proceedings of the Workshops of the 15th International Parallel and Distributed Processing Symposium, volume 1800 of Lecture Notes in Computer Science, pages 977--984, Cancun, Mexico, May 2000. Springer.
BibTex | Web page | PS ]
[GG00]
H. Goguen and J. Goubault-Larrecq. Sequent Combinators: A Hilbert System for the Lambda Calculus. Mathematical Structures in Computer Science, 10(1):1--79, February 2000.
BibTex | Web page | PS ]
[GG99]
J. Goubault-Larrecq and É. Goubault. Order-Theoretic, Geometric and Combinatorial Models of Intuitionistic S4 Proofs. In Proceedings of the 1st Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
BibTex | Web page | PS ]
[Gou99c]
J. Goubault-Larrecq. A Simple Sequent System for First-Order Logic with Free Constructors. In Proceedings of the 8th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'99), volume 1617 of Lecture Notes in Artificial Intelligence, pages 202--216, Saratoga Springs, New York, USA, June 1999. Springer.
BibTex ]
[Gou99b]
J. Goubault-Larrecq. A Simple Deduction System for First-Order Logic with Equality, Free Constructors and Induction. Research Report RR-3653, INRIA Rocquencourt, France, March 1999.
BibTex | Web page | PS ]
[Gou99a]
J. Goubault-Larrecq. Conjunctive Types and SKInT. In Selected Papers from the International Workshop on Types for Proofs and Programs (TYPES'98), volume 1657 of Lecture Notes in Computer Science, pages 106--120, Kloster Irsee, Germany, 1999. Springer.
BibTex | Web page | PS ]
[Gou98a]
J. Goubault-Larrecq. A Few Remarks on SKInT. Research Report RR-3475, INRIA Rocquencourt, France, August 1998.
BibTex | Web page | PS ]
[Gou98b]
J. Goubault-Larrecq. A Proof of Weak Termination of Typed λ-σ-Calculi. In Selected Papers from the International Workshop on Types for Proofs and Programs (TYPES'96), volume 1512 of Lecture Notes in Computer Science, pages 134--151, Aussois, France, 1998. Springer.
BibTex | Web page | PS ]
[Gou97a]
J. Goubault-Larrecq. Logique, complexité, démonstration automatique et thèmes connexes. Mémoire d'habilitation, Université Paris 9 (Dauphine), Paris, France, September 1997.
BibTex | Web page | PS | PDF ]
[Gou97c]
J. Goubault-Larrecq. Ramified Higher-Order Unification. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), pages 410--421, Warsaw, Poland, July 1997. IEEE Computer Society Press.
BibTex | Web page | PS | PDF ]
[GM97]
J. Goubault-Larrecq and I. Mackie. Proof Theory and Automated Deduction, volume 6 of Applied Logic Series. Kluwer Academic Publishers, May 1997.
BibTex ]
[Gou97b]
J. Goubault-Larrecq. On Computational Interpretations of the Modal Logic S4 --- IIIb. Confluence, Termination of the λevQ_H-Calculus. Research Report RR-3164, INRIA Rocquencourt, France, May 1997.
BibTex | Web page | PS | PDF ]
[SG97]
P. H. Schmitt and J. Goubault-Larrecq. A Tableau System for Linear-TIME Temporal Logic. In Proceedings of the 3rd International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'97), volume 1217 of Lecture Notes in Computer Science, pages 130--144, Enschede, The Netherlands, April 1997. Springer.
BibTex | Web page | PS | PDF ]

This file was generated by bibtex2html 1.98.

About LSV