Segui
Andre Scedrov
Andre Scedrov
Professor of Mathematics, Professor of Computer and Information Science, University of Pennsylvania
Email verificata su math.upenn.edu - Home page
Titolo
Citata da
Citata da
Anno
Categories, allegories
PJ Freyd, A Scedrov
Elsevier, 1990
10321990
Uniform proofs as a foundation for logic programming
D Miller, G Nadathur, F Pfenning, A Scedrov
Annals of Pure and Applied logic 51 (1-2), 125-157, 1991
9001991
Decision problems for propositional linear logic
P Lincoln, J Mitchell, A Scedrov, N Shankar
Annals of pure and applied logic 56 (1-3), 239-311, 1992
4061992
Bounded linear logic: a modular approach to polynomial-time computability
JY Girard, A Scedrov, PJ Scott
Theoretical computer science 97 (1), 1-66, 1992
3891992
Undecidability of bounded security protocols
J Mitchell, A Scedrov, N Durgin, P Lincoln
Workshop on formal methods and security protocols, 1999
3811999
A meta-notation for protocol analysis
I Cervesato, NA Durgin, PD Lincoln, JC Mitchell, A Scedrov
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 55-69, 1999
3741999
Inheritance as implicit coercion
V Breazu-Tannen, T Coquand, CA Gunter, A Scedrov
Information and computation 93 (1), 172-221, 1991
3451991
A probabilistic poly-time framework for protocol analysis
P Lincoln, J Mitchell, M Mitchell, A Scedrov
Proceedings of the 5th ACM Conference on Computer and Communications …, 1998
2651998
Functorial polymorphism
ES Bainbridge, PJ Freyd, A Scedrov, PJ Scott
Theoretical computer science 70 (1), 35-64, 1990
2431990
Multiset rewriting and the complexity of bounded security protocols
N Durgin, P Lincoln, J Mitchell, A Scedrov
Journal of Computer Security 12 (2), 247-311, 2004
2382004
An extension of system F with subtyping
L Cardelli, S Martini, JC Mitchell, A Scedrov
Information and computation 109 (1-2), 4-56, 1994
1801994
An extension of system F with subtyping
L Cardelli, S Martini, JC Mitchell, A Scedrov
Theoretical Aspects of Computer Software: International Conference TACS'91 …, 1991
1381991
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
JC Mitchell, A Ramanathan, A Scedrov, V Teague
Theoretical Computer Science 353 (1-3), 118-164, 2006
1282006
Breaking and fixing public-key Kerberos
I Cervesato, AD Jaggard, A Scedrov, JK Tsay, C Walstad
Information and Computation 206 (2-4), 402-424, 2008
1272008
Relating strands and multiset rewriting for security protocol analysis
I Cervesato, N Durgin, J Mitchell, P Lincoln, A Scedrov
Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13, 35-51, 2000
1142000
Inductive methods and contract-signing protocols
R Chadha, M Kanovich, A Scedrov
Proceedings of the 8th ACM Conference on Computer and Communications …, 2001
1002001
A categorical approach to realizability and polymorphic types
A Carboni, PJ Freyd, A Scedrov
Mathematical Foundations of Programming Language Semantics: 3rd Workshop …, 1988
1001988
Key-dependent message security under active attacks–BRSIM/UC-soundness of Dolev–Yao-style encryption with key cycles
M Backes, B Pfitzmann, A Scedrov
Journal of Computer Security 16 (5), 497-530, 2008
962008
Formal analysis of multiparty contract signing
R Chadha, S Kremer, A Scedrov
Journal of Automated Reasoning 36 (1-2), 39-83, 2006
942006
A formal analysis of some properties of Kerberos 5 using MSR
F Butler, I Cervesato, AD Jaggard, A Scedrov
942004
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20