Andre Scedrov

	2009
77		Iliano Cervesato, Andre Scedrov: Relating state-based and process-based concurrency through linear logic (full-version). Inf. Comput. 207(10): 1044-1077 (2009)
	2008
76		John C. Mitchell, Arnab Roy, Paul Rowe, Andre Scedrov: Analysis of EAP-GPSK Authentication Protocol. ACNS 2008: 309-327
75		Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Computationally sound mechanized proofs for basic and public-key Kerberos. ASIACCS 2008: 87-99
74		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)
73		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)
	2007
72		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
71		Max I. Kanovich, Paul Rowe, Andre Scedrov: Collaborative Planning With Privacy. CSF 2007: 265-278
70		Andre Scedrov: The work of Dean Rosenzweig: a tribute to a scientist and an innovator. ESEC/SIGSOFT FSE 2007: 371-374
69		Michael Backes, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 180(1): 1-2 (2007)
	2006
68		Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. ASIAN 2006: 167-181
67		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
66		Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov: Games and the Impossibility of Realizable Ideal Functionality. TCC 2006: 360-379
65		Iliano Cervesato, Andre Scedrov: Relating State-Based and Process-Based Concurrency through Linear Logic. Electr. Notes Theor. Comput. Sci. 165: 145-176 (2006)
64		Rohit Chadha, Steve Kremer, Andre Scedrov: Formal Analysis of Multiparty Contract Signing. J. Autom. Reasoning 36(1-2): 39-83 (2006)
63		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)
62		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)
	2005
61		Pedro Adão, Gergei Bana, Andre Scedrov: Computational and Information-Theoretic Soundness and Completeness of Formal Encryption. CSFW 2005: 170-184
60		Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov: Soundness of Formal Encryption in the Presence of Key-Cycles. ESORICS 2005: 374-396
59		Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Specifying Kerberos 5 cross-realm authentication. WITS 2005: 12-26
58		Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov: Contract signing, optimism, and advantage. J. Log. Algebr. Program. 64(2): 189-218 (2005)
	2004
57		Rohit Chadha, Steve Kremer, Andre Scedrov: Formal Analysis of Multi-Party Contract Signing. CSFW 2004: 266-265
56		Ajith Ramanathan, John C. Mitchell, Andre Scedrov, Vanessa Teague: Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols. FoSSaCS 2004: 468-483
	2003
55		Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa: Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers Springer 2003
54		Paulo Mateus, John C. Mitchell, Andre Scedrov: Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. CONCUR 2003: 323-345
53		Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov: Contract Signing, Optimism, and Advantage. CONCUR 2003: 361-377
52		Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: Verifying Confidentiality and Authentication in Kerberos 5. ISSS 2003: 1-24
51		Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov: Preface. Theor. Comput. Sci. 294(3): 333 (2003)
50		Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Theor. Comput. Sci. 294(3): 525-549 (2003)
	2002
49		Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175-
48		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
	2001
47		Rohit Chadha, Max I. Kanovich, Andre Scedrov: Inductive methods and contract-signing protocols. ACM Conference on Computer and Communications Security 2001: 176-185
46		Andre Scedrov, Ran Canetti, Joshua D. Guttman, David Wagner, Michael Waidner: Relating Cryptography and Cryptographic Protocols. CSFW 2001: 111-114
45		John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague: Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. LICS 2001: 3-8
44		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: (2001)
	2000
43		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
	1999
42		Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov: A Meta-Notation for Protocol Analysis. CSFW 1999: 55-69
41		Patrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov: Probabilistic Polynomial-Time Equivalence and Security Analysis. World Congress on Formal Methods 1999: 776-793
40		Stephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 20: (1999)
39		Patrick Lincoln, John C. Mitchell, Andre Scedrov: Optimization Complexity of Linear Logic Proof Games. Theor. Comput. Sci. 227(1-2): 299-331 (1999)
	1998
38		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
37		John C. Mitchell, Mark Mitchell, Andre Scedrov: A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time. FOCS 1998: 725-733
36		Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Specifying Real-Time Finite-State Systems in Linear Logic. Electr. Notes Theor. Comput. Sci. 16(1): (1998)
	1997
35		Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Electr. Notes Theor. Comput. Sci. 6: (1997)
	1996
34		Patrick Lincoln, John C. Mitchell, Andre Scedrov: Linear logic proof games and optimization. Bulletin of Symbolic Logic 2(3): 322-338 (1996)
33		Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 3: (1996)
32		Patrick Lincoln, John C. Mitchell, Andre Scedrov: The Complexity of Local Proof Search in Linear Logic. Electr. Notes Theor. Comput. Sci. 3: (1996)
31		Yves Lafont, Andre Scedrov: The Undecidability of Second Order Multiplicative Linear Logic. Inf. Comput. 125(1): 46-51 (1996)
	1995
30		Patrick Lincoln, Andre Scedrov, Natarajan Shankar: Decision Problems for Second-Order Linear Logic LICS 1995: 476-485
29		Andre Scedrov, Dennis DeTurk, Wolfgang Ziller: Moez Alimohamed, 1967-1994. Theor. Comput. Sci. 146(1&2): 1-3 (1995)
	1994
28		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)
27		Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov: An Extension of System F with Subtyping Inf. Comput. 109(1/2): 4-56 (1994)
26		Andre Scedrov: Preface Inf. Comput. 111(1): iii (1994)
25		Patrick Lincoln, Andre Scedrov: First-Order Linear Logic without Modalities is NEXPTIME-Hard. Theor. Comput. Sci. 135(1): 139-153 (1994)
	1993
24		Patrick Lincoln, Andre Scedrov, Natarajan Shankar: Linearizing Intuitionistic Implication. Ann. Pure Appl. Logic 60(2): 151-177 (1993)
	1992
23		John C. Mitchell, Andre Scedrov: Notes on Sconing and Relators. CSL 1992: 352-378
22		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)
21		Andreas Blass, Andre Scedrov: Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Logic 57(1): 1-26 (1992)
20		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)
	1991
19		Patrick Lincoln, Andre Scedrov, Natarajan Shankar: Linearizing Intuitionistic Implication LICS 1991: 51-62
18		Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov: An Extension of System F with Subtyping. TACS 1991: 750-770
17		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)
16		Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov: Inheritance as Implicit Coercion Inf. Comput. 93(1): 172-221 (1991)
	1990
15		Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar: Decision Problems for Propositional Linear Logic FOCS 1990: 662-671
14		Val Tannen, Carl A. Gunter, Andre Scedrov: Computing with Coercions. LISP and Functional Programming 1990: 44-60
13		Andre Scedrov: A brief guide to linear logic. Bulletin of the EATCS 41: 154-165 (1990)
12		E. S. Bainbridge, Peter J. Freyd, Andre Scedrov, Philip J. Scott: Functorial Polymorphism. Theor. Comput. Sci. 70(1): 35-64 (1990)
	1989
11		Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov: Inheritance and Explicit Coercion (Preliminary Report) LICS 1989: 112-129
10		Anil Nerode, Jeffrey B. Remmel, Andre Scedrov: Polynomially Grade Logic I: A Graded Version of System T LICS 1989: 375-385
	1988
9		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
8		Peter J. Freyd, Jean-Yves Girard, Andre Scedrov, Philip J. Scott: Semantic Parametricity in Polymorphic Lambda Calculus LICS 1988: 274-279
	1987
7		Peter J. Freyd, Andre Scedrov: Some Semantic Aspects of Polymorphic Lambda Calculus LICS 1987: 315-319
6		Dale Miller, Gopalan Nadathur, Andre Scedrov: Hereditary Harrop Formulas and Uniform Proof Systems LICS 1987: 98-105
5		Aurelio Carboni, Peter J. Freyd, Andre Scedrov: A Categorical Approach to Realizability and Polymorphic Types. MFPS 1987: 23-42
	1986
4		Andreas Blass, Andre Scedrov: Small Decidable Sheaves. J. Symb. Log. 51(3): 726-731 (1986)
3		Andre Scedrov: Some Properties of Epistemic Set Theory with Collection. J. Symb. Log. 51(3): 748-754 (1986)
	1985
2		Andre Scedrov: Some aspects of categorial semantics: sheves and glueing. Logic Colloquium 1985: 281-302
	1984
1		Michael Beeson, Andre Scedrov: Church's Thesis, Continuity, and Set Theory. J. Symb. Log. 49(2): 630-643 (1984)

Coauthor Index

1	Pedro Adão	[60] [61]
2	Michael Backes	[67] [69] [72] [73]
3	E. S. Bainbridge	[12]
4	Gergei Bana	[60] [61]
5	Michael Beeson	[1]
6	Bruno Blanchet	[75]
7	Andreas Blass	[4] [21]
8	Stephen D. Brookes	[40]
9	Frederick Butler	[49] [52] [62]
10	Ran Canetti	[46]
11	Aurelio Carboni	[5]
12	Luca Cardelli	[18] [27]
13	Iliano Cervesato	[42] [43] [48] [49] [52] [59] [62] [65] [67] [68] [74] [77]
14	Rohit Chadha	[47] [53] [57] [58] [64]
15	Thierry Coquand	[11] [16]
16	Anupam Datta	[66]
17	Dennis DeTurk	[29]
18	Ante Derek	[66]
19	Nancy A. Durgin	[42] [43] [48]
20	Amy P. Felty	[9]
21	Peter J. Freyd	[5] [7] [8] [12]
22	Jean-Yves Girard	[8] [20] [33] [51]
23	Carl A. Gunter	[11] [14] [16]
24	Elsa L. Gunter	[9]
25	Joshua D. Guttman	[46]
26	John Hannan	[9]
27	Jonathan Herzog	[60]
28	Aaron D. Jaggard	[49] [52] [59] [62] [67] [68] [74] [75]
29	Achim Jung	[40]
30	Max I. Kanovich	[35] [36] [47] [50] [71]
31	Steve Kremer	[57] [64]
32	Yves Lafont	[31]
33	Patrick Lincoln	[15] [19] [22] [24] [25] [30] [32] [34] [38] [39] [41] [42] [43] [48]
34	Simone Martini	[18] [27]
35	Paulo Mateus	[54]
36	Dale Miller	[6] [9] [17]
37	Michael W. Mislove	[40]
38	John C. Mitchell	[15] [18] [22] [23] [27] [32] [34] [37] [38] [39] [41] [42] [43] [44] [45] [48] [53] [54] [56] [58] [63] [66] [76]
39	Mark Mitchell	[37] [38] [41]
40	Gopalan Nadathur	[6] [9] [17]
41	Anil Nerode	[10]
42	Mitsuhiro Okada	[33] [35] [36] [50] [51] [55]
43	Frank Pfenning	[17]
44	Birgit Pfitzmann	[72] [73]
45	Benjamin C. Pierce	[55]
46	Ajith Ramanathan	[44] [45] [56] [63] [66]
47	Jeffrey B. Remmel	[10]
48	Paul Rowe	[71] [76]
49	Arnab Roy	[76]
50	Philip J. Scott	[8] [12] [20]
51	Natarajan Shankar	[15] [19] [22] [24] [30]
52	Vitaly Shmatikov	[53] [58]
53	Val Tannen (Valeriu Breazu, Val Breazu-Tannen)	[11] [14] [16]
54	Vanessa Teague	[44] [45] [56] [63]
55	Hideyuki Tokuda	[55]
56	Joe-Kai Tsay	[67] [68] [74] [75]
57	David Wagner	[46]
58	Michael Waidner	[46]
59	Christopher Walstad	[59] [62] [68] [74]
60	Akinori Yonezawa	[55]
61	Wolfgang Ziller	[29]

Colors in the list of coauthors