Andre Scedrov
Andre Scedrov
Professor of Mathematics, Professor of Computer and Information Science, University of Pennsylvania
Verified email at - Homepage
Cited by
Cited by
Categories, allegories
PJ Freyd, A Scedrov
Elsevier, 1990
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
Domain theory in logical form
S Abramsky
Annals of pure and applied logic 51 (1-2), 1-77, 1991
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
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
Theoretical computer science
JY Girard
Linear logic 50, 1-102, 1987
Undecidability of bounded security protocol
NA Durgin
The 1999 Federated Logic Conference (FLoC'99), 1999
Inheritance as implicit coercion
V Breazu-Tannen, T Coquand, CA Gunter, A Scedrov
Information and computation 93 (1), 172-221, 1991
Bounded linear logic: a modular approach to polynomial-time computability
JY Girard, A Scedrov, PJ Scott
Theoretical computer science 97 (1), 1-66, 1992
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
Elliptic boundary value problems on corner domains, volume 1341 of Lecture Notes in Mathematics
M Dauge
Springer-Verlag, Berlin, 1988
Functorial polymorphism
ES Bainbridge, PJ Freyd, A Scedrov, PJ Scott
Theoretical computer science 70 (1), 35-64, 1990
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
An extension of system F with subtyping
L Cardelli, S Martini, JC Mitchell, A Scedrov
Information and computation 109 (1-2), 4-56, 1994
An extension of system F with subtyping
L Cardelli, S Martini, JC Mitchell, A Scedrov
International symposium on theoretical aspects of computer software, 750-770, 1991
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
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
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
A categorical approach to realizability and polymorphic types
A Carboni, PJ Freyd, A Scedrov
International Workshop on Mathematical Foundations of Programming Semantics …, 1987
Formal analysis of multiparty contract signing
R Chadha, S Kremer, A Scedrov
Journal of Automated Reasoning 36 (1-2), 39-83, 2006
The system can't perform the operation now. Try again later.
Articles 1–20