dblp.uni-trier.dewww.uni-trier.de

Andre Scedrov Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
77EEIliano Cervesato, Andre Scedrov: Relating state-based and process-based concurrency through linear logic (full-version). Inf. Comput. 207(10): 1044-1077 (2009)
2008
76EEJohn C. Mitchell, Arnab Roy, Paul Rowe, Andre Scedrov: Analysis of EAP-GPSK Authentication Protocol. ACNS 2008: 309-327
75EEBruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Computationally sound mechanized proofs for basic and public-key Kerberos. ASIACCS 2008: 87-99
74EEIliano 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)
73EEMichael 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
72EEMichael 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
71EEMax I. Kanovich, Paul Rowe, Andre Scedrov: Collaborative Planning With Privacy. CSF 2007: 265-278
70EEAndre Scedrov: The work of Dean Rosenzweig: a tribute to a scientist and an innovator. ESEC/SIGSOFT FSE 2007: 371-374
69EEMichael Backes, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 180(1): 1-2 (2007)
2006
68EEIliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. ASIAN 2006: 167-181
67EEMichael 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
66EEAnupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov: Games and the Impossibility of Realizable Ideal Functionality. TCC 2006: 360-379
65EEIliano Cervesato, Andre Scedrov: Relating State-Based and Process-Based Concurrency through Linear Logic. Electr. Notes Theor. Comput. Sci. 165: 145-176 (2006)
64EERohit Chadha, Steve Kremer, Andre Scedrov: Formal Analysis of Multiparty Contract Signing. J. Autom. Reasoning 36(1-2): 39-83 (2006)
63EEJohn 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)
62EEFrederick 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
61EEPedro Adão, Gergei Bana, Andre Scedrov: Computational and Information-Theoretic Soundness and Completeness of Formal Encryption. CSFW 2005: 170-184
60EEPedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov: Soundness of Formal Encryption in the Presence of Key-Cycles. ESORICS 2005: 374-396
59EEIliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Specifying Kerberos 5 cross-realm authentication. WITS 2005: 12-26
58EERohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov: Contract signing, optimism, and advantage. J. Log. Algebr. Program. 64(2): 189-218 (2005)
2004
57EERohit Chadha, Steve Kremer, Andre Scedrov: Formal Analysis of Multi-Party Contract Signing. CSFW 2004: 266-265
56EEAjith 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
54EEPaulo Mateus, John C. Mitchell, Andre Scedrov: Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus. CONCUR 2003: 323-345
53EERohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov: Contract Signing, Optimism, and Advantage. CONCUR 2003: 361-377
52EEFrederick 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
49EEFrederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175-
48EEIliano 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
47EERohit Chadha, Max I. Kanovich, Andre Scedrov: Inductive methods and contract-signing protocols. ACM Conference on Computer and Communications Security 2001: 176-185
46EEAndre 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
44EEJohn 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
43EEIliano 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
42EEIliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov: A Meta-Notation for Protocol Analysis. CSFW 1999: 55-69
41EEPatrick Lincoln, John C. Mitchell, Mark Mitchell, Andre Scedrov: Probabilistic Polynomial-Time Equivalence and Security Analysis. World Congress on Formal Methods 1999: 776-793
40EEStephen D. Brookes, Achim Jung, Michael W. Mislove, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 20: (1999)
39EEPatrick Lincoln, John C. Mitchell, Andre Scedrov: Optimization Complexity of Linear Logic Proof Games. Theor. Comput. Sci. 227(1-2): 299-331 (1999)
1998
38EEPatrick 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
37EEJohn C. Mitchell, Mark Mitchell, Andre Scedrov: A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time. FOCS 1998: 725-733
36EEMax I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Specifying Real-Time Finite-State Systems in Linear Logic. Electr. Notes Theor. Comput. Sci. 16(1): (1998)
1997
35EEMax I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Electr. Notes Theor. Comput. Sci. 6: (1997)
1996
34EEPatrick Lincoln, John C. Mitchell, Andre Scedrov: Linear logic proof games and optimization. Bulletin of Symbolic Logic 2(3): 322-338 (1996)
33EEJean-Yves Girard, Mitsuhiro Okada, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 3: (1996)
32EEPatrick 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
23EEJohn 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
14EEVal 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
9EEAmy 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
5EEAurelio 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)