Andre Scedrov

Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedrov: Maintaining distributed logic programs incrementally. Computer Languages, Systems & Structures 38(2): 158-180 (2012)

Anduo Wang, Limin Jia, Wenchao Zhou, Yiqing Ren, Boon Thau Loo, Jennifer Rexford, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott: FSR: formal analysis and implementation toolkit for safe interdomain routing. IEEE/ACM Trans. Netw. 20(6): 1814-1827 (2012)

Peifung E. Lam, John C. Mitchell, Andre Scedrov, Sharada Sundaram, Frank Wang: Declarative privacy policy: finite models and attribute-based encryption. IHI 2012: 323-332

Vivek Nigam, Tajana Ban Kirigin, Andre Scedrov, Carolyn L. Talcott, Max I. Kanovich, Ranko Perovic: Towards an automated assistant for clinical investigations. IHI 2012: 773-778

Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov: Brief announcement: a calculus of policy-based routing systems. PODC 2012: 343-344

Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic: A Rewriting Framework for Activities Subject to Regulations. RTA 2012: 305-322

Anduo Wang, Alexander J. T. Gurney, Xianglong Han, Jinyan Cao, Carolyn L. Talcott, Boon Thau Loo, Andre Scedrov: Reduction-based analysis of BGP systems with BGPVerif. SIGCOMM 2012: 89-90

Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gurney, Boon Thau Loo, Andre Scedrov: Reduction-Based Formal Analysis of BGP Instances. TACAS 2012: 283-298

Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically sound security proofs for basic and public-key Kerberos. Int. J. Inf. Sec. 10(2): 107-134 (2011)

Max I. Kanovich, Paul Rowe, Andre Scedrov: Collaborative Planning with Confidentiality. J. Autom. Reasoning 46(3-4): 389-421 (2011)

Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Thau Loo, Andre Scedrov: Analyzing BGP Instances in Maude. FMOODS/FORTE 2011: 334-348

Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedrov: Maintaining distributed logic programs incrementally. PPDP 2011: 125-136

Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov: Bounded Memory Dolev-Yao Adversaries in Collaborative Systems. Formal Aspects in Security and Trust 2010: 18-33

Iliano Cervesato, Andre Scedrov: Relating state-based and process-based concurrency through linear logic (full-version). Inf. Comput. 207(10): 1044-1077 (2009)

Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov: Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage. Journal of Computer Security 17(5): 737-797 (2009)

Max I. Kanovich, Paul Rowe, Andre Scedrov: Policy Compliance in Collaborative Systems. CSF 2009: 218-233

Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and fixing public-key Kerberos. Inf. Comput. 206(2-4): 402-424 (2008)

Michael Backes, Birgit Pfitzmann, Andre Scedrov: Key-dependent message security under active attacks - BRSIM/UC-soundness of Dolev-Yao-style encryption with key cycles. Journal of Computer Security 16(5): 497-530 (2008)

John C. Mitchell, Arnab Roy, Paul Rowe, Andre Scedrov: Analysis of EAP-GPSK Authentication Protocol. ACNS 2008: 309-327

Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Computationally sound mechanized proofs for basic and public-key Kerberos. ASIACCS 2008: 87-99

Michael Backes, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 180(1): 1-2 (2007)

Michael Backes, Birgit Pfitzmann, Andre Scedrov: Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. CSF 2007: 112-124

Max I. Kanovich, Paul Rowe, Andre Scedrov: Collaborative Planning With Privacy. CSF 2007: 265-278

Andre Scedrov: The work of Dean Rosenzweig: a tribute to a scientist and an innovator. ESEC/SIGSOFT FSE 2007: 371-374

Iliano Cervesato, Andre Scedrov: Relating State-Based and Process-Based Concurrency through Linear Logic. Electr. Notes Theor. Comput. Sci. 165: 145-176 (2006)

Rohit Chadha, Steve Kremer, Andre Scedrov: Formal Analysis of Multiparty Contract Signing. J. Autom. Reasoning 36(1-2): 39-83 (2006)

John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theor. Comput. Sci. 353(1-3): 118-164 (2006)

Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Formal analysis of Kerberos 5. Theor. Comput. Sci. 367(1-2): 57-87 (2006)

Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. ASIAN 2006: 167-181

Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. ESORICS 2006: 362-383

Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov: Games and the Impossibility of Realizable Ideal Functionality. TCC 2006: 360-379

Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. IACR Cryptology ePrint Archive 2006: 9 (2006)

Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. IACR Cryptology ePrint Archive 2006: 219 (2006)

Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov: Contract signing, optimism, and advantage. J. Log. Algebr. Program. 64(2): 189-218 (2005)

Pedro Adão, Gergei Bana, Andre Scedrov: Computational and Information-Theoretic Soundness and Completeness of Formal Encryption. CSFW 2005: 170-184

Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov: Soundness of Formal Encryption in the Presence of Key-Cycles. ESORICS 2005: 374-396

Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Specifying Kerberos 5 cross-realm authentication. WITS 2005: 12-26

Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov: Games and the Impossibility of Realizable Ideal Functionality. IACR Cryptology ePrint Archive 2005: 211 (2005)

Michael Backes, Birgit Pfitzmann, Andre Scedrov: Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. IACR Cryptology ePrint Archive 2005: 421 (2005)

Rohit Chadha, Steve Kremer, Andre Scedrov: Formal Analysis of Multi-Party Contract Signing. CSFW 2004: 266-265

Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague: Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. FoSSaCS 2004: 468-483

Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov: Preface. Theor. Comput. Sci. 294(3): 333 (2003)

Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Theor. Comput. Sci. 294(3): 525-549 (2003)

Paulo Mateus, John C. Mitchell, Andre Scedrov: Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. CONCUR 2003: 323-345

Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov: Contract Signing, Optimism, and Advantage. CONCUR 2003: 361-377

Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: Verifying Confidentiality and Authentication in Kerberos 5. ISSS 2003: 1-24

Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa (Eds.): Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers. Lecture Notes in Computer Science 2609, Springer 2003, isbn 3-540-00708-3

Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175-

Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov: A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis. ISSS 2002: 356-383

John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague: A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Preliminary Report). Electr. Notes Theor. Comput. Sci. 45: 280-310 (2001)

Rohit Chadha, Max I. Kanovich, Andre Scedrov: Inductive methods and contract-signing protocols. ACM Conference on Computer and Communications Security 2001: 176-185

Andre Scedrov, Ran Canetti, Joshua D. Guttman, David Wagner, Michael Waidner: Relating Cryptography and Cryptographic Protocols. CSFW 2001: 111-114

John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague: Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. LICS 2001: 3-5

Andre Scedrov: A language-based security analysis. ACM SIGSOFT Software Engineering Notes 25(1): 80-81 (2000)

Iliano Cervesato, Nancy A. Durgin, John C. Mitchell, Patrick Lincoln, Andre Scedrov: Relating Strands and Multiset Rewriting for Security Protocol Analysis. CSFW 2000: 35-51

Stephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 20: 512-513 (1999)

Patrick Lincoln, John C. Mitchell, Andre Scedrov: Optimization Complexity of Linear Logic Proof Games. Theor. Comput. Sci. 227(1-2): 299-331 (1999)

Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov: A Meta-Notation for Protocol Analysis. CSFW 1999: 55-69

Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov: Probabilistic Polynomial-Time Equivalence and Security Analysis. World Congress on Formal Methods 1999: 776-793

Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Specifying Real-Time Finite-State Systems in Linear Logic. Electr. Notes Theor. Comput. Sci. 16(1): 42-59 (1998)

Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov: A Probabilistic Poly-Time Framework for Protocol Analysis. ACM Conference on Computer and Communications Security 1998: 112-121

John C. Mitchell, Mark Mitchell, Andre Scedrov: A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time. FOCS 1998: 725-733

Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Electr. Notes Theor. Comput. Sci. 6: 221-234 (1997)

Patrick Lincoln, John C. Mitchell, Andre Scedrov: Linear logic proof games and optimization. Bulletin of Symbolic Logic 2(3): 322-338 (1996)

Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 3: 1 (1996)

Patrick Lincoln, John C. Mitchell, Andre Scedrov: The Complexity of Local Proof Search in Linear Logic. Electr. Notes Theor. Comput. Sci. 3: 120-129 (1996)

Yves Lafont, Andre Scedrov: The Undecidability of Second Order Multiplicative Linear Logic. Inf. Comput. 125(1): 46-51 (1996)

Andre Scedrov, Dennis DeTurk, Wolfgang Ziller: Moez Alimohamed, 1967-1994. Theor. Comput. Sci. 146(1&2): 1-3 (1995)

Patrick Lincoln, Andre Scedrov, Natarajan Shankar: Decision Problems for Second-Order Linear Logic. LICS 1995: 476-485

Andre Scedrov: Preface - Invited papers presented at the 1992 IEEE Symposium on Logic in Computer Science. Ann. Pure Appl. Logic 69(2-3): 133 (1994)

Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov: An Extension of System F with Subtyping. Inf. Comput. 109(1/2): 4-56 (1994)

Andre Scedrov: Preface. Inf. Comput. 111(1): iii (1994)

Patrick Lincoln, Andre Scedrov: First-Order Linear Logic without Modalities is NEXPTIME-Hard. Theor. Comput. Sci. 135(1): 139-153 (1994)

Patrick Lincoln, Andre Scedrov, Natarajan Shankar: Linearizing Intuitionistic Implication. Ann. Pure Appl. Logic 60(2): 151-177 (1993)

Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar: Decision Problems for Propositional Linear Logic. Ann. Pure Appl. Logic 56(1-3): 239-311 (1992)

Andreas Blass, Andre Scedrov: Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Logic 57(1): 1-26 (1992)

Jean-Yves Girard, Andre Scedrov, Philip J. Scott: Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability. Theor. Comput. Sci. 97(1): 1-66 (1992)

John C. Mitchell, Andre Scedrov: Notes on Sconing and Relators. CSL 1992: 352-378

Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov: Uniform Proofs as a Foundation for Logic Programming. Ann. Pure Appl. Logic 51(1-2): 125-157 (1991)

Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov: Inheritance as Implicit Coercion. Inf. Comput. 93(1): 172-221 (1991)

Patrick Lincoln, Andre Scedrov, Natarajan Shankar: Linearizing Intuitionistic Implication. LICS 1991: 51-62

Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov: An Extension of System F with Subtyping. TACS 1991: 750-770

Andre Scedrov: A brief guide to linear logic. Bulletin of the EATCS 41: 154-165 (1990)

E. S. Bainbridge, Peter J. Freyd, Andre Scedrov, Philip J. Scott: Functorial Polymorphism. Theor. Comput. Sci. 70(1): 35-64 (1990)

Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar: Decision Problems for Propositional Linear Logic. FOCS 1990: 662-671

Val Tannen, Carl A. Gunter, Andre Scedrov: Computing with Coercions. LISP and Functional Programming 1990: 44-60

Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov: Inheritance and Explicit Coercion (Preliminary Report). LICS 1989: 112-129

Anil Nerode, Jeffrey B. Remmel, Andre Scedrov: Polynomially Grade Logic I: A Graded Version of System T. LICS 1989: 375-385

Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov: Lambda-Prolog: An Extended Logic Programming Language. CADE 1988: 754-755

Peter J. Freyd, Jean-Yves Girard, Andre Scedrov, Philip J. Scott: Semantic Parametricity in Polymorphic Lambda Calculus. LICS 1988: 274-279

Dale Miller, Gopalan Nadathur, Andre Scedrov: Hereditary Harrop Formulas and Uniform Proof Systems. LICS 1987: 98-105

Peter J. Freyd, Andre Scedrov: Some Semantic Aspects of Polymorphic Lambda Calculus. LICS 1987: 315-319

Aurelio Carboni, Peter J. Freyd, Andre Scedrov: A Categorical Approach to Realizability and Polymorphic Types. MFPS 1987: 23-42

Andreas Blass, Andre Scedrov: Small Decidable Sheaves. J. Symb. Log. 51(3): 726-731 (1986)

Andre Scedrov: Some Properties of Epistemic Set Theory with Collection. J. Symb. Log. 51(3): 748-754 (1986)

Andre Scedrov: Some aspects of categorial semantics: sheves and glueing. Logic Colloquium 1985: 281-302

Michael Beeson, Andre Scedrov: Church's Thesis, Continuity, and Set Theory. J. Symb. Log. 49(2): 630-643 (1984)