The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andre Scedrov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov
    An Extension of System F with Subtyping. [Citation Graph (3, 0)][DBLP]
    TACS, 1991, pp:750-770 [Conf]
  2. Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov
    Inheritance and Explicit Coercion (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    LICS, 1989, pp:112-129 [Conf]
  3. Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov
    Uniform Proofs as a Foundation for Logic Programming. [Citation Graph (1, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:51, n:1-2, pp:125-157 [Journal]
  4. Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov
    Inheritance as Implicit Coercion [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1991, v:93, n:1, pp:172-221 [Journal]
  5. Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov
    Lambda-Prolog: An Extended Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:754-755 [Conf]
  6. Rohit Chadha, Max I. Kanovich, Andre Scedrov
    Inductive methods and contract-signing protocols. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2001, pp:176-185 [Conf]
  7. Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov
    A Probabilistic Poly-Time Framework for Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1998, pp:112-121 [Conf]
  8. Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
    Contract Signing, Optimism, and Advantage. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:361-377 [Conf]
  9. Paulo Mateus, John C. Mitchell, Andre Scedrov
    Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:323-345 [Conf]
  10. Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov
    A Meta-Notation for Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    CSFW, 1999, pp:55-69 [Conf]
  11. Iliano Cervesato, Nancy A. Durgin, John C. Mitchell, Patrick Lincoln, Andre Scedrov
    Relating Strands and Multiset Rewriting for Security Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    CSFW, 2000, pp:35-51 [Conf]
  12. Rohit Chadha, Steve Kremer, Andre Scedrov
    Formal Analysis of Multi-Party Contract Signing. [Citation Graph (0, 0)][DBLP]
    CSFW, 2004, pp:266-265 [Conf]
  13. Pedro Adão, Gergei Bana, Andre Scedrov
    Computational and Information-Theoretic Soundness and Completeness of Formal Encryption. [Citation Graph (0, 0)][DBLP]
    CSFW, 2005, pp:170-184 [Conf]
  14. Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov
    A Formal Analysis of Some Properties of Kerberos 5 Using MSR. [Citation Graph (0, 0)][DBLP]
    CSFW, 2002, pp:175-0 [Conf]
  15. Andre Scedrov, Ran Canetti, Joshua D. Guttman, David Wagner, Michael Waidner
    Relating Cryptography and Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    CSFW, 2001, pp:111-114 [Conf]
  16. John C. Mitchell, Andre Scedrov
    Notes on Sconing and Relators. [Citation Graph (0, 0)][DBLP]
    CSL, 1992, pp:352-378 [Conf]
  17. Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov
    Soundness of Formal Encryption in the Presence of Key-Cycles. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2005, pp:374-396 [Conf]
  18. Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay
    Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2006, pp:362-383 [Conf]
  19. Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov
    Probabilistic Polynomial-Time Equivalence and Security Analysis. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:776-793 [Conf]
  20. Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar
    Decision Problems for Propositional Linear Logic [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:662-671 [Conf]
  21. John C. Mitchell, Mark Mitchell, Andre Scedrov
    A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:725-733 [Conf]
  22. Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague
    Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:468-483 [Conf]
  23. Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov
    Verifying Confidentiality and Authentication in Kerberos 5. [Citation Graph (0, 0)][DBLP]
    ISSS, 2003, pp:1-24 [Conf]
  24. Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov
    A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    ISSS, 2002, pp:356-383 [Conf]
  25. Val Tannen, Carl A. Gunter, Andre Scedrov
    Computing with Coercions. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1990, pp:44-60 [Conf]
  26. Peter J. Freyd, Jean-Yves Girard, Andre Scedrov, Philip J. Scott
    Semantic Parametricity in Polymorphic Lambda Calculus [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:274-279 [Conf]
  27. Peter J. Freyd, Andre Scedrov
    Some Semantic Aspects of Polymorphic Lambda Calculus [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:315-319 [Conf]
  28. Patrick Lincoln, Andre Scedrov, Natarajan Shankar
    Linearizing Intuitionistic Implication [Citation Graph (0, 0)][DBLP]
    LICS, 1991, pp:51-62 [Conf]
  29. Patrick Lincoln, Andre Scedrov, Natarajan Shankar
    Decision Problems for Second-Order Linear Logic [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:476-485 [Conf]
  30. Anil Nerode, Jeffrey B. Remmel, Andre Scedrov
    Polynomially Grade Logic I: A Graded Version of System T [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:375-385 [Conf]
  31. Dale Miller, Gopalan Nadathur, Andre Scedrov
    Hereditary Harrop Formulas and Uniform Proof Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:98-105 [Conf]
  32. John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague
    Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:3-8 [Conf]
  33. Andre Scedrov
    Some aspects of categorial semantics: sheves and glueing. [Citation Graph (0, 0)][DBLP]
    Logic Colloquium, 1985, pp:281-302 [Conf]
  34. Aurelio Carboni, Peter J. Freyd, Andre Scedrov
    A Categorical Approach to Realizability and Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    MFPS, 1987, pp:23-42 [Conf]
  35. Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov
    Games and the Impossibility of Realizable Ideal Functionality. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:360-379 [Conf]
  36. Andreas Blass, Andre Scedrov
    Complete Topoi Representing Models of Set Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:57, n:1, pp:1-26 [Journal]
  37. Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar
    Decision Problems for Propositional Linear Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:239-311 [Journal]
  38. Patrick Lincoln, Andre Scedrov, Natarajan Shankar
    Linearizing Intuitionistic Implication. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:60, n:2, pp:151-177 [Journal]
  39. Andre Scedrov
    Preface - Invited papers presented at the 1992 IEEE Symposium on Logic in Computer Science. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:69, n:2-3, pp:133- [Journal]
  40. Patrick Lincoln, John C. Mitchell, Andre Scedrov
    Linear logic proof games and optimization. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1996, v:2, n:3, pp:322-338 [Journal]
  41. Andre Scedrov
    A brief guide to linear logic. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:41, n:, pp:154-165 [Journal]
  42. Stephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:20, n:, pp:- [Journal]
  43. Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal]
  44. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
    Phase semantics for light linear logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:6, n:, pp:- [Journal]
  45. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
    Specifying Real-Time Finite-State Systems in Linear Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:1, pp:- [Journal]
  46. Patrick Lincoln, John C. Mitchell, Andre Scedrov
    The Complexity of Local Proof Search in Linear Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal]
  47. John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague
    A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:45, n:, pp:- [Journal]
  48. Iliano Cervesato, Andre Scedrov
    Relating State-Based and Process-Based Concurrency through Linear Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:165, n:, pp:145-176 [Journal]
  49. Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov
    An Extension of System F with Subtyping [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:109, n:1/2, pp:4-56 [Journal]
  50. Yves Lafont, Andre Scedrov
    The Undecidability of Second Order Multiplicative Linear Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:46-51 [Journal]
  51. Andre Scedrov
    Preface [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:111, n:1, pp:0- [Journal]
  52. Rohit Chadha, Steve Kremer, Andre Scedrov
    Formal Analysis of Multiparty Contract Signing. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:36, n:1-2, pp:39-83 [Journal]
  53. Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
    Contract signing, optimism, and advantage. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:64, n:2, pp:189-218 [Journal]
  54. Michael Beeson, Andre Scedrov
    Church's Thesis, Continuity, and Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:2, pp:630-643 [Journal]
  55. Andreas Blass, Andre Scedrov
    Small Decidable Sheaves. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:3, pp:726-731 [Journal]
  56. Andre Scedrov
    Some Properties of Epistemic Set Theory with Collection. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:3, pp:748-754 [Journal]
  57. E. S. Bainbridge, Peter J. Freyd, Andre Scedrov, Philip J. Scott
    Functorial Polymorphism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:1, pp:35-64 [Journal]
  58. Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad
    Formal analysis of Kerberos 5. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:367, n:1-2, pp:57-87 [Journal]
  59. Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:3, pp:333- [Journal]
  60. Jean-Yves Girard, Andre Scedrov, Philip J. Scott
    Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:97, n:1, pp:1-66 [Journal]
  61. Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
    Phase semantics for light linear logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:3, pp:525-549 [Journal]
  62. Patrick Lincoln, John C. Mitchell, Andre Scedrov
    Optimization Complexity of Linear Logic Proof Games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:227, n:1-2, pp:299-331 [Journal]
  63. Patrick Lincoln, Andre Scedrov
    First-Order Linear Logic without Modalities is NEXPTIME-Hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:139-153 [Journal]
  64. John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague
    A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:353, n:1-3, pp:118-164 [Journal]
  65. Andre Scedrov, Dennis DeTurk, Wolfgang Ziller
    Moez Alimohamed, 1967-1994. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:146, n:1&2, pp:1-3 [Journal]
  66. Andre Scedrov
    The work of Dean Rosenzweig: a tribute to a scientist and an innovator. [Citation Graph (0, 0)][DBLP]
    ESEC/SIGSOFT FSE, 2007, pp:371-374 [Conf]
  67. Michael Backes, Andre Scedrov
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:180, n:1, pp:1-2 [Journal]

  68. Analysis of EAP-GPSK Authentication Protocol. [Citation Graph (, )][DBLP]


  69. Breaking and Fixing Public-Key Kerberos. [Citation Graph (, )][DBLP]


  70. Computationally sound mechanized proofs for basic and public-key Kerberos. [Citation Graph (, )][DBLP]


  71. Policy Compliance in Collaborative Systems. [Citation Graph (, )][DBLP]


  72. Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. [Citation Graph (, )][DBLP]


  73. Collaborative Planning With Privacy. [Citation Graph (, )][DBLP]


  74. Specifying Kerberos 5 cross-realm authentication. [Citation Graph (, )][DBLP]


Search in 0.068secs, Finished in 0.073secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002