The SCEAS System
Navigation Menu

Search the dblp DataBase


Jean Goubault-Larrecq: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar
    Reflecting BDDs in Coq. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2000, pp:162-181 [Conf]
  2. Julien Olivain, Jean Goubault-Larrecq
    The Orchids Intrusion Detection Tool. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:286-290 [Conf]
  3. Muriel Roger, Jean Goubault-Larrecq
    Log Auditing through Model-Checking. [Citation Graph (0, 0)][DBLP]
    CSFW, 2001, pp:220-0 [Conf]
  4. Jean Goubault-Larrecq
    Well-Founded Recursive Relations. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:484-497 [Conf]
  5. Jean Goubault-Larrecq
    Higher-Order Positive Set Constraints. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:473-489 [Conf]
  6. Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
    Logical Relations for Monadic Types. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:553-568 [Conf]
  7. Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang
    Complete Lax Logical Relations for Cryptographic Lambda-Calculi. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:400-414 [Conf]
  8. Jean Goubault-Larrecq
    A Method for Automatic Cryptographic Protocol Verification. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:977-984 [Conf]
  9. Jean Goubault-Larrecq
    Ramified Higher-Order Unification. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:410-421 [Conf]
  10. Jean Goubault-Larrecq
    A Simple Sequent System for First-Order Logic with Free Constructors. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1999, pp:202-216 [Conf]
  11. Peter H. Schmitt, Jean Goubault-Larrecq
    A Tableau System for Linear-TIME Temporal Logic. [Citation Graph (0, 0)][DBLP]
    TACAS, 1997, pp:130-144 [Conf]
  12. Xavier Rival, Jean Goubault-Larrecq
    Experiments with Finite Tree Automata in Coq. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2001, pp:362-377 [Conf]
  13. Jean Goubault-Larrecq
    A Proof of Weak Termination of Typed lambda-sigma-Calculi. [Citation Graph (0, 0)][DBLP]
    TYPES, 1996, pp:134-153 [Conf]
  14. Jean Goubault-Larrecq
    Conjunctive Types and SKInT. [Citation Graph (0, 0)][DBLP]
    TYPES, 1998, pp:106-120 [Conf]
  15. Jean Goubault-Larrecq, Fabrice Parrennes
    Cryptographic Protocol Analysis on Real C Code. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:363-379 [Conf]
  16. Jean Goubault-Larrecq
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:55, n:1, pp:- [Journal]
  17. Jean Goubault-Larrecq
    Deciding H1 by resolution. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:3, pp:401-408 [Journal]
  18. Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma
    Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:64, n:2, pp:219-251 [Journal]
  19. Jean Goubault-Larrecq
    Extensions of valuations. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:2, pp:271-297 [Journal]
  20. Healfdene Goguen, Jean Goubault-Larrecq
    Sequent combinators: a Hilbert system for the lambda calculus. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2000, v:10, n:1, pp:1-79 [Journal]
  21. Elie Bursztein, Jean Goubault-Larrecq
    A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2007, pp:212-227 [Conf]
  22. Jean Goubault-Larrecq
    Continuous Previsions. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:542-557 [Conf]
  23. Jean Goubault-Larrecq
    Continuous Capacities on Continuous State Spaces. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:764-776 [Conf]
  24. Jean Goubault-Larrecq
    On Noetherian Spaces. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:453-462 [Conf]
  25. Kumar Neeraj Verma, Jean Goubault-Larrecq
    Karp-Miller Trees for a Branching Extension of VASS. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:217-230 [Journal]
  26. Kumar Neeraj Verma, Jean Goubault-Larrecq
    Alternating two-way AC-tree automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:6, pp:817-869 [Journal]

  27. A Probabilistic Applied Pi-Calculus. [Citation Graph (, )][DBLP]

  28. "Logic Wins!". [Citation Graph (, )][DBLP]

  29. Towards Producing Formally Checkable Security Proofs, Automatically. [Citation Graph (, )][DBLP]

  30. Simulation Hemi-metrics between Infinite-State Stochastic Games. [Citation Graph (, )][DBLP]

  31. Prevision Domains and Convex Powercones. [Citation Graph (, )][DBLP]

  32. Forward Analysis for WSTS, Part II: Complete WSTS. [Citation Graph (, )][DBLP]

  33. Noetherian Spaces in Verification. [Citation Graph (, )][DBLP]

  34. omega-QRB-Domains and the Probabilistic Powerdomain. [Citation Graph (, )][DBLP]

  35. Forward Analysis for WSTS, Part I: Completions. [Citation Graph (, )][DBLP]

  36. A Smell of Orchids. [Citation Graph (, )][DBLP]

  37. Logical Relations for Monadic Types [Citation Graph (, )][DBLP]

  38. Forward analysis for WSTS, Part I: Completions [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002