| Categories, allegories PJ Freyd, A Scedrov Elsevier, 1990 | 923 | 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 | 857 | 1991 |
| Domain theory in logical form S Abramsky Annals of pure and applied logic 51 (1-2), 1-77, 1991 | 653 | 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 | 367 | 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 | 367 | 1992 |
| Undecidability of bounded security protocol NA Durgin The 1999 Federated Logic Conference (FLoC'99), 1999 | 346 | 1999 |
| Theoretical computer science JY Girard Linear logic 50, 1-102, 1987 | 344 | 1987 |
| Inheritance as implicit coercion V Breazu-Tannen, T Coquand, CA Gunter, A Scedrov Information and computation 93 (1), 172-221, 1991 | 332 | 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 | 331 | 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 | 256 | 1998 |
| Elliptic boundary value problems on corner domains, volume 1341 of Lecture Notes in Mathematics M Dauge Springer-Verlag, Berlin, 1988 | 248 | 1988 |
| Functorial polymorphism ES Bainbridge, PJ Freyd, A Scedrov, PJ Scott Theoretical computer science 70 (1), 35-64, 1990 | 222 | 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 | 212 | 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 | 161 | 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 | 128 | 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 | 119 | 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 | 117 | 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 | 104 | 2000 |
| Inductive methods and contract-signing protocols R Chadha, M Kanovich, A Scedrov Proceedings of the 8th ACM Conference on Computer and Communications …, 2001 | 97 | 2001 |
| A categorical approach to realizability and polymorphic types A Carboni, PJ Freyd, A Scedrov International Workshop on Mathematical Foundations of Programming Semantics …, 1987 | 97 | 1987 |
