Andre Scedrov
April 3, 2017
Department of Mathematics, University of Pennsylvania
209 South 33rd Street, Philadelphia, PA 19104–6395, U.S.A.
Web: http://www.cis.upenn.edu/~scedrov
E-mail: [email protected]
Telephone: +1 (215) 898–5983
Personal
• Born August 1, 1955 in Zagreb, Croatia. United States Citizen since 1987.
Married, with one child.
Dissertation
• Ph.D. Mathematics, State University of New York at Buffalo, 1981.
Academic Positions
• 2013 – 2018: Chair, Department of Mathematics, University of Pennsylvania
• 1992 – present: Professor of Mathematics, University of Pennsylvania
• 1988 – 1992: Associate Professor of Mathematics, University of Pennsylvania
• 1988 – present: Secondary Appointment in Computer and Information Science,
University of Pennsylvania
• 1982 – 1988: Assistant Professor of Mathematics, University of Pennsylvania
• 1981 – 1982: T.H. Hildebrandt Research Assistant Professor of Mathematics,
University of Michigan, Ann Arbor
Honors
• 2013: Visiting Scientist, Dynasty Foundation, Moscow, Russia
• 1997 – 1998: Japan Society for the Promotion of Science Senior Fellowship
• 1993 – 1994: American Mathematical Society Centennial Research Fellowship
Selected Visiting Positions
• 2017 – 2019: Leading Research Fellow, International Laboratory for Intelligent Systems and Structural
Analysis, Faculty of Computer Science, National Research University Higher School of Economics,
Moscow, Russia (30 days per year)
• 2014 – 2016: Leading Research Fellow, International Laboratory for Intelligent Systems and Structural
Analysis, Faculty of Computer Science, National Research University Higher School of Economics,
Moscow, Russia (30 days per year)
• 2013 June: Faculty of Mathematics, National Research University
Higher School of Economics, Moscow, Russia
1
Recent Invited Lectures at International Conferences
• 2016 December: Dale Fest!60th , University Paris 7, Paris, France
• 2016 September: 5th Conference on Logic and Applications, Inter-University Center, Dubrovnik, Croatia
• 2016 May: Workshop on Computer Security, Logic, and Programming Languages In Honor of John
Mitchell’s 60th Birthday, Stanford University, California, USA
• 2016 March: 9th Winter School in Economics, Mathematics, and Computer Science “Baikal Readings”,
Irkutsk, Russia
• 2016 January: Opening Lecture. Symposium on Logical Foundations of Computer Science, LFCS 2016,
Deerfield Beach, Florida, USA
• 2015 December: Problems in Theoretical Computer Science, Joint Conference of Computer Science
Faculty of Higher School of Economics and Laboratory of Mathematical Logic of the St. Petersburg
Department of the Steklov Institute of Mathematics, Moscow, Russia
• 2015 October: Opening Lecture. National Institute of Informatics Shonan Meeting on Logic and
Verification Methods in Security and Privacy, Shonan Village Center, Japan
• 2013 June: 2nd Franco-Russian Workshop on Algorithms, Complexity and Applications, Moscow,
Russia
• 2012 May: The Constructive in Logic and Applications: A Conference in Honor of the 60th Birthday
of Sergei Artemov, New York, New York, USA
• 2011 May: Cryptography Minisymposium, 3rd biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), Victoria, Canada.
• 2011 March: Colloquium on Computer Security, École Normale Supérieure Cachan, France.
Graduate Students Supervised
R. Blute (Ph.D. 1991, currently at Univ. of Ottawa), M. Alimohamed (Ph.D. 1994, deceased), P. Selinger
(Ph.D. 1997, currently at Dalhousie Univ.), R. Chadha (Ph.D. 2003, Univ. of Missouri), R. Sharykin (M.A.
2004), G. Bana (Ph.D. 2004, INRIA, France), J. Strong (M.A. 2005), B. Mooney (M.A. 2006), P. Adão
(Ph.D. IST Lisbon 2006), A. Mater (M.A. 2007), J.-K. Tsay (Ph.D. 2008, Deutsche Telekom/T-Systems),
P. Rowe (Ph.D. 2009, MITRE Corp.), T. Ban Kirigin (Ph.D. 2011 Univ. of Zagreb, co-advised with Z. Šikić,
currently at Univ. of Rijeka), A. Wang (CIS Ph.D. 2013, co-advised with B.T. Loo, currently at Temple),
and E. Fagerholm (Ph.D. 2015, Google)
Postdoctoral Researchers Supervised
F. Lamarche (currently at INRIA-Lorraine), J. Lipton (Wesleyan Univ.), M. Bonet (Univ. Politécnica de
Cataluña), B. Howard (Bridgewater), K. St.John (CUNY Lehman), S. Guerrini (Univ. di Roma 1), H. Hu
(Cal State Monterey Bay), E. Haghverdi (Indiana), P. Mateus (IST Lisbon), B. Knutsson (KTH Stockholm),
G. Bana (IST Lisbon), N. Ackerman (UC Berkeley), M. Lieberman (Kalamazoo), V. Nigam (Univ. Federal
da Paraı́ba), M. Alvim (Univ. Federal de Minas Gerais), and Stepan L. Kuznetsov (Steklov Math. Institute)
Undergraduate Research Supervised
C. Walstad, Class of ’06, J. Rao, Class of ’08.
Recent Professional Activities
• Editor: Journal of Computer Security, IOS Press, 2004 – 2015
• Program Co-Chair: Tools and Methods of Program Analysis, TMPA-2017, Moscow, Russia
2
• Conference Chair: 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012,
Dubrovnik, Croatia; 18th Workshop on Logic, Language, Information and Computation, WoLLIC
2011, Philadelphia, Pennsylvania, USA
• Steering Committee Member: Symposium on Logical Foundations of Computer Science (LFCS); Workshop on Foundations of Computer Security (FCS)
• Board of Directors Member: Conference on Logic and Applications (LAP), Inter-University Center,
Dubrovnik, Croatia
• Advisory Board Member: Glasnik Matematički, Croatian Mathematical Society and Department of
Mathematics, University of Zagreb
• Organizing Committee Member: Workshop on Computer Security, Logic, and Programming Languages
In Honor of John Mitchell’s 60th Birthday, Stanford University, California, USA, 2016
• Program Committee Member: The 13th International Conference on Concept Lattices and Their Applications, CLA 2016, Moscow, Russia; Fourth International Workshop on Linearity (Linearity 2016),
Porto, Portugal; Mathematical Foundations of Programming Semantics XXXII, MFPS 2016, Pittsburgh, Pennsylvania, USA; The 10th International Computer Science Symposium in Russia, CSR
2015, Listvyanka, Russia; 26th International Conference on Rewriting Techniques and Applications,
RTA 2015, Warsaw, Poland; 26th IEEE Computer Security Foundations Symposium, CSF 2013, New
Orleans, Louisiana, USA; 31st Annual International Cryptology Conference, CRYPTO 2011, Santa
Barbara, California, USA
Andre Scedrov’s Publications
1. (with M.I. Kanovich, T. Ban Kirigin, V. Nigam, C.L. Talcott, and R. Perovic), A Rewriting Framework
and Logic for Activities Subject to Regulations. Mathematical Structures in Computer Science 27(3)
(2017) 332-375. Extended abstract under the title “A Rewriting Framework for Activities Subject to
Regulations” in: A. Tiwari, ed., 23-rd International Conference on Rewriting Techniques and Applications (RTA 2012). Nagoya, Japan, May 28 -June 2, 2012. Leibniz International Proceedings in
Informatics Volume 15, Schloss Dagstuhl - Leibniz Center for Informatics, 2012, pp. 305 - 322.
2. (with G. Barthe, E. Fagerholm, D. Fiore, B. Schmidt, and M. Tibouchi), Strongly-Optimal Structure
Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. IET Information Security
10(6) (2016) 358-371. Extended abstract in: J. Katz, ed., IACR International Conference on Practice
and Theory of Public-Key Cryptography (PKC 2015), Gaithersburg, Maryland, USA, March 30 - April
1, 2015, Springer Lecture Notes in Computer Science, Volume 9020, 2015, pp. 355 - 376.
3. (with M. Kanovich, T. Ban Kirigin, V. Nigam, and C. Talcott), Timed Multiset Rewriting and the
Verification of Time-Sensitive Distributed Systems. In: M. Fränzle and N. Markey, eds., Formal
Modeling and Analysis of Timed Systems, 14th International Conference, FORMATS 2016, Quebec,
QC, Canada, August 24-26, 2016, Springer Lecture Notes in Computer Science, Volume 9884, 2016,
pp. 228 - 244. Technical report on arXiv:1606.07886.
4. (with Max Kanovich and Stepan Kuznetsov), Undecidability of the Lambek calculus with a relevant
modality. In: A. Foret et al., eds., Formal Grammar, 20th and 21st International Conferences, FG
2015, Barcelona, Spain, August 2015, Revised Selected Papers. FG 2016, Bozen, Italy, August 2016,
Proceedings, Springer Lecture Notes in Computer Science, Volume 9804, 2016, pp. 240 - 256. Preliminary version on arXiv:1601.06303.
5. (with Max Kanovich and Stepan Kuznetsov), On Lambek’s Restriction in the Presence of Exponential
Modalities. In: S. Artemov and A. Nerode, eds., Logical Foundations of Computer Science (LFCS
2016), Deerfield Beach, Florida, U.S.A., January 2016, Springer Lecture Notes in Computer Science,
Volume 9537, 2015, pp. 146-158.
3
6. (with M. Kanovich, T. Ban Kirigin, V. Nigam, and C. Talcott), Discrete vs. Dense Times in the
Verification of Cyber-Physical Security Protocols. In: R. Focardi and A. Myers, eds., 4th Conference
on Principles of Security and Trust (POST 2015), London, UK, April 2015, Springer Lecture Notes
in Computer Science, Volume 9036, 2015, pp. 259 - 279.
7. (with G. Barthe, E. Fagerholm, D. Fiore, J.C. Mitchell and B. Schmidt), Automated Analysis of
Cryptographic Assumptions in Generic Group Models. In: J. Garay and R. Gennaro, eds., 34th
International Cryptology Conference (CRYPTO 2014), Santa Barbara, California, USA, August 2014,
Springer Lecture Notes in Computer Science, Volume 8616, 2014, pp. 95 - 112.
8. (with M. Kanovich, T. Ban Kirigin, and V. Nigam), Bounded Memory Protocols. Computer Languages,
Systems and Structures 40(3-4) (2014) 137 - 154. Revised version of the extended abstract under the
title “Bounded Memory Protocols and Progressing Collaborative Systems” in: J. Crampton and S.
Jajodia, eds., The 18-th European Symposium on Research in Computer Security (ESORICS 2013),
Egham, UK, September 2013, Springer Lecture Notes in Computer Science, Volume 8134, 2013, pp.
309 - 326.
9. (with M. Kanovich, T. Ban Kirigin, and V. Nigam), Bounded Memory Dolev-Yao Adversaries in Collaborative Systems. Information and Computation 238 (2014) 233 - 261. Extended abstract in: P. Degano
et al., eds., The 7-th International Workshop on Formal Aspects of Security & Trust (FAST2010), Pisa,
Italy, September 2010, Springer Lecture Notes in Computer Science, Volume 6561, 2011, pp. 18-33.
10. (with A. Wang, A.J.T. Gurney, X. Han, J. Cao, B. Thau Loo, and C. Talcott), A Reduction-based Approach Towards Scaling Up Formal Analysis of Internet Configurations. In: G. Bianchi, Y. Fang, and
X. Shen, eds., 33rd Annual IEEE International Conference on Computer Communications (INFOCOM
2014), Toronto, Canada, April 27 - May 2, 2014, IEEE, 2014, pp. 637 - 645.
11. (with M.S. Alvim and F.B. Schneider), When Not All Bits Are Equal: Worth-Based Information Flow.
In: M. Abadi and S. Kremer, eds., 3rd Conference on Principles of Security and Trust (POST 2014),
Grenoble, France, April 2014, Springer Lecture Notes in Computer Science, Volume 8414, 2014, pp.
120 - 139.
12. (with A. Wang, S. Moarref, B. Thau Loo, and U. Topcu), Automated Synthesis of Reactive Controllers
for Software-Defined Networks. In: 3rd International Workshop on Rigorous Protocol Engineering
(WRiPE 2013), 21st IEEE International Conference on Network Protocols (ICNP 2013), Göttingen,
Germany, October 2013, IEEE Xplore Digital Library 2013. DOI: 10.1109/ICNP.2013.6733666.
13. (with A. Wang, L. Jia, W. Zhou, Y. Ren, B. Thau Loo, J. Rexford, V. Nigam, and C. Talcott), FSR:
Formal Analysis and Implementation Toolkit for Safe Inter-domain Routing. IEEE/ACM Transactions
on Networking 20(6) (2012) 1814-1827.
14. (with V. Nigam, L. Jia, and B. Thau Loo), Maintaining Distributed Logic Programs Incrementally.
Computer Languages, Systems and Structures 38 (2012) 158-180. Extended abstract in: M. Hanus,
ed., 13-th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2011). Odense, Denmark, July 2011. ACM Press, 2011, pp. 125-136.
15. (with A. Wang, A.J.T. Gurney, X. Han, J. Cao, C.L. Talcott, and B. Thau Loo), Reduction-based
analysis of BGP systems with BGPVerif. Demo in: L. Eggert, J. Ott, V.N. Padmanabhan, G. Varghese,
eds., ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols
for Computer Communication. Helsinki, Finland, August 2012. ACM Press, 2012, pp. 89-90.
16. (with A. Wang, C.L. Talcott, A.J.T. Gurney, and B. Thau Loo), Brief Announcement: A Calculus
of Policy-Based Routing Systems. In: A. Panconesi, ed., 31-st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2012). Madeira, Portugal, July 2012. ACM
Press, 2012, pp. 343 - 344.
17. (with A. Wang, C.L. Talcott, A.J.T. Gurney, and B. Thau Loo), Reduction-based Formal Analysis
BGP Instances. In: C. Flanagan and B. Koenig, eds., 18-th International Conference on Tools and
4
Algorithms for the Construction and Analysis of Systems (TACAS 2012). Tallinn, Estonia, March
2012. Springer Lecture Notes in Computer Science, Volume 7214, 2012, pp. 283 - 298.
18. (with P.E. Lam, J.C. Mitchell, S. Sundaram, and F. Wang), Declarative privacy policy: Finite models
and attribute-based encryption. In: C.C. Yang, ed., 2-nd ACM SIGHIT International Health Informatics Symposium (IHI 2012). Miami, Florida, USA, January 2012. ACM Digital Library, 2012, pp.
323-332.
19. (with V. Nigam, T. Ban Kirigin, C. Talcott, M. Kanovich, and R. Perovic), Towards an Automated
Assistant for Clinical Investigations. In: C.C. Yang, ed., 2-nd ACM SIGHIT International Health
Informatics Symposium (IHI 2012). Miami, Florida, USA, January 2012. ACM Digital Library, 2012,
pp. 773-778.
20. (with A. Wang, C.L. Talcott, L. Jia, and B. Thau Loo), Analyzing BGP Instances in Maude. In: R.
Bruni and J. Dingel, eds., Formal Techniques for Distributed Systems. Joint 13-th IFIP International
Conference on Formal Methods for Open Object-based Distributed Systems and 31-st IFIP International
Conference on FORmal TEchniques for Networked and Distributed Systems (FMOODS & FORTE
2011), Reykjavik, Iceland, June 2011, Proceedings. Springer Lecture Notes in Computer Science,
Volume 6722, 2011, pp. 334 - 348.
21. (with M. Backes, I. Cervesato, A. Jaggard, and J.-K. Tsay), Cryptographically Sound Security Proofs
for Basic and Public-Key Kerberos. International Journal of Information Security 10(2) (2011) 107133. Extended abstract in: D. Gollmann, J. Meier, and A. Sabelfeld, eds., Computer Security ESORICS 2006, 11-th European Symposium On Research In Computer Security, Hamburg, Germany,
September 2006, Springer Lecture Notes in Computer Science, Volume 4189, 2006, pp. 362 - 383.
22. (with M. Kanovich and P. Rowe), Collaborative Planning with Confidentiality. Journal of Automated
Reasoning 46(3-4) (2011) 389-421. Extended abstract under the title “Collaborative Planning with
Privacy” in: A. Sabelfeld, ed., 20-th IEEE Computer Security Foundations Symposium (CSF), Venice,
Italy, July 2007, IEEE Computer Society Press, 2007, pp. 265-278.
23. (with M. Kanovich and P. Rowe), Policy Compliance in Collaborative Systems. In: J. Mitchell, ed.,
22-nd IEEE Computer Security Foundations Symposium (CSF), Port Jefferson, New York, USA, July
2009, IEEE Computer Society Press, 2009, pp. 218-233.
24. (with I. Cervesato), Relating State-Based and Process-Based Concurrency through Linear Logic. Information and Computation 207(10) (2009) 1044-1077. Extended abstract in: R. de Queiroz and G.
Mints, eds., 13-th Workshop on Logic, Language, Information and Computation, Stanford, California,
July 2006, Electronic Notes in Theoretical Computer Science, Volume 165, Elsevier, 2006, pp. 145 176.
25. (with P. Adão, G. Bana, and J. Herzog), Soundness and completeness of formal encryption: The
cases of key-cycles and partial information leakage. Journal of Computer Security 17(5) (2009) 737797. Extended abstract under the title “Soundness of formal encryption in the presence of key-cycles”
in: S. De Capitani di Vimercati, P. Syverson, and D. Gollmann, eds., 10-th European Symposium
on Research in Computer Security (ESORICS 2005), Milan, Italy, September 2005, Springer Lecture
Notes in Computer Science, Volume 3679, 2005, pp. 374-396.
26. (with J.C. Mitchell, P. Rowe, and A. Roy), Analysis of EAP-GPSK Authentication Protocol. In: S.
Bellovin and R. Gennaro, eds., 6-th International Conference on Applied Cryptography and Network
Security (ACNS’08), New York, June 2008, Springer Lecture Notes in Computer Science, Volume 5037,
2008, pp. 309-327.
27. (with B. Blanchet, A.D. Jaggard, and J.-K. Tsay), Computationally Sound Mechanized Proofs for
Basic and Public-Key Kerberos. In: V. Gligor and M. Abe, eds., ACM Symposium on Information,
Computer and Communications Security (ASIACCS ’08), Tokyo, Japan, March 2008, ACM Press,
2008, pp. 87-99.
5
28. (with M. Backes and B. Pfitzmann), Key-dependent Message Security under Active Attacks - BRSIM/UCSoundness of Dolev-Yao-style Encryption with Key Cycles. Journal of Computer Security 16(5) (2008)
497-530. Extended abstract under the title “Key-dependent Message Security under Active Attacks
– BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles” in: A. Sabelfeld, ed., 20-th IEEE
Computer Security Foundations Symposium (CSF), Venice, Italy, July 2007, IEEE Computer Society
Press, 2007, pp. 112-124.
29. (with I. Cervesato, A. Jaggard, J.-K. Tsay, and C. Walstad), Breaking and Fixing Public-Key Kerberos.
Information and Computation 206(2-4) (2008) 402-424. Extended abstract in: M. Okada, I. Satoh,
eds., Advances in Computer Science - ASIAN 2006, Tokyo, Japan, December 2006, Springer Lecture
Notes in Computer Science, Volume 4435, 2008.
30. The work of Dean Rosenzweig: A Tribute to a Scientist and an Innovator. In: Foundations of Software
Engineering. Proc. 6-th Joint Meeting of the European Software Engineering Conference and the 14-th
ACM SIGSOFT Symposium on Foundations of Software Engineering (ESEC/FSE 2007), Dubrovnik,
Croatia, September 2007, ACM Press, 2007, pp. 371-374.
31. (with F. Butler, I. Cervesato, A. Jaggard, and C. Walstad), Formal Analysis of Kerberos 5. Theoretical
Computer Science 367(1-2) (2006) 57-87.
32. (with A. Datta, A. Derek, J.C. Mitchell, and A. Ramanathan), Games and the Impossibility of Realizable Ideal Functionality. In: S. Halevi and T. Rabin, eds., 3-rd Theory of Cryptography Conference
(TCC 2006), New York, NY, March 2006, Springer Lecture Notes in Computer Science, Volume 3876,
2006, pp. 360-379.
33. (with J.C. Mitchell, A. Ramanathan, and V. Teague), A probabilistic polynomial-time process calculus
for the analysis of cryptographic protocols. Theoretical Computer Science 353 (2006) 118-164.
34. (with P. Adão and G. Bana), Computational and Information-Theoretic Soundness and Completeness
of Formal Encryption. in: J. Guttman, ed., 18-th IEEE Computer Security Foundations Workshop,
CSFW, Aix-en-Provence, France, June, 2005, IEEE Computer Society Press, 2005, pp. 170-184.
35. (with I. Cervesato, A. Jaggard, and C. Walstad), Specifying Kerberos 5 Cross-Realm Authentication.
In: C. Meadows, ed., Proceedings of the 2005 workshop on Issues in the theory of security (WITS’05),
Long Beach, California, January 2005. ACM Digital Library, ACM Press, New York, 2005, pp. 12-26.
36. (with F. Butler, I. Cervesato, and A. Jaggard), Verifying Confidentiality and Authentication in Kerberos 5. In: K. Futatsugi, F. Mizoguchi, N. Yonezaki, eds., Software Security - Theories and Systems
Second Mext-NSF-JSPS International Symposium, ISSS 2003, Tokyo, Japan, November 4-6, 2003.
Springer Lecture Notes in Computer Science, Vol. 3233, 2004, pp. 1-24.
37. (with R. Chadha and S. Kremer), Formal analysis of multi-party contract signing. Journal of Automated Reasoning 36(1-2), 2006, pp. 39-83. Preliminary report in: R. Focardi, ed., 17-th IEEE Computer Security Foundations Workshop, CSFW, Pacific Grove, California, June, 2004, IEEE Computer
Society Press, 2004, pp. 266-279.
38. (with A. Ramanathan, J. Mitchell, and V. Teague), Probabilistic bisimulation and equivalence for
security analysis of network protocols. In: I. Walukiewicz, ed., Foundations of Software Science and
Computation Structures, 7-th International Conference, FOSSACS 2004, Barcelona, Spain, March,
2004. Springer Lecture Notes in Computer Science, Vol. 2987, 2004, pp. 468-483.
39. (with P. Mateus and J.C. Mitchell), Composition of cryptographic protocols in a probabilistic polynomialtime process calculus. In: R. Amadio and D. Lugiez, eds., CONCUR 2003 – Concurrency Theory, 14-th
International Conference, Marseille, France, September, 2003. Springer Lecture Notes in Computer
Science, Vol. 2761, 2003, pp. 327-349.
40. (with R. Chadha, J.C. Mitchell, and V. Shmatikov), Contract signing, optimism, and advantage.
Journal of Logic and Algebraic Programming, Special issue on Modelling and Verification of Cryptographic Protocols, R.M. Amadio, ed., 64(2), 2005, pp. 189-218. Extended abstract in: R. Amadio and
6
D. Lugiez, eds., CONCUR 2003 – Concurrency Theory, 14-th International Conference, Marseille,
France, September, 2003. Springer Lecture Notes in Computer Science, Vol. 2761, 2003, pp. 366-382.
41. (with I. Cervesato, N.A. Durgin, P.D. Lincoln, and J.C. Mitchell), A revised comparison between
strand spaces and multiset rewriting for security protocol analysis. Journal of Computer Security
13(2), 2005, pp. 265-316. Extended abstract in: M. Okada, B. Pierce, A. Scedrov, H. Tokuda, and A.
Yonezawa, eds., Software Security - Theories and Systems. Mext-NSF-JSPS International Symposium,
ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers, Springer Lecture Notes in Computer
Science, Vol. 2609, 2003, pp. 356-383.
42. (with N. Durgin, P. Lincoln, and J. Mitchell), Multiset rewriting and the complexity of bounded
security protocols. Journal of Computer Security 12, 2004, pp. 247-311.
43. (with F. Butler, I. Cervesato, and A. Jaggard), A formal analysis of some properties of Kerberos 5
using MSR. In: S. Schneider, ed., 15-th IEEE Computer Security Foundations Workshop, Cape Breton,
Nova Scotia, Canada, June, 2002, IEEE Computer Society Press, 2002, pp. 175-190.
44. (with R. Chadha and M.I. Kanovich), Inductive methods and contract-signing protocols. In: P.
Samarati, ed., 8-th ACM Conference on Computer and Communications Security, Philadelphia, Pennsylvania, November, 2001, ACM Press, 2001, pp. 176-185.
45. (with J. Mitchell, A. Ramanathan, and V. Teague), A probabilistic polynomial-time calculus for analysis of cryptographic protocols (Preliminary report). In: S. Brookes, M. Mislove, eds., 17-th Annual
Conference on the Mathematical Foundations of Programming Semantics, Arhus, Denmark, May, 2001,
Electronic Notes in Theoretical Computer Science, Vol. 45, 2001. [31 pp.]
46. (with P.D. Lincoln, J.C. Mitchell, and M. Mitchell), Probabilistic polynomial-time equivalence and
security protocols. In: J.M. Wing, J. Woodcock, J. Davies (Eds.), FM’99 - Formal Methods World
Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September
1999. Proceedings, Volume I, Springer Lecture Notes in Computer Science, vol. 1708, 1999, pp.
776-793.
47. (with I. Cervesato, N.A. Durgin, P.D. Lincoln, and J.C. Mitchell), A meta-notation for protocol analysis. In: P. Syverson, ed., 12-th IEEE Computer Security Foundations Workshop, Mordano, Italy,
June, 1999, IEEE Computer Society Press, 1999, pp. 55-69.
48. (with P.D. Lincoln, J.C. Mitchell, and M. Mitchell), A probabilistic poly-time framework for protocol
analysis. In: M. Reiter, ed., 5-th ACM Conference on Computer and Communications Security, San
Francisco, California, November, 1998, ACM Press, 1998, pp. 112-121.
49. (with J.C. Mitchell and M. Mitchell), A linguistic characterization of bounded oracle computation
and probabilistic polynomial time. In: 39-th Annual IEEE Symposium on Foundations of Computer
Science (FOCS), Palo Alto, California, November, 1998. IEEE Computer Society Press, 1998, pp.
725-733.
50. (with M.I. Kanovich and M. Okada), Specifying real-time finite-state systems in linear logic. In: 2-nd
International Workshop on Constraint Programming for Time-Critical Applications and Multi-Agent
Systems (COTIC), Nice, France, September, 1998. Electronic Notes in Theoretical Computer Science,
Vol. 16 Issue 1, 1998. [15 pp.]
51. (with M.I. Kanovich and M. Okada), Phase semantics for light linear logic. Theoretical Computer
Science 294(3), 2003, pp. 525-549. Extended abstract in: “Proc. 13-th Annual Conference on the
Mathematical Foundations of Programming Semantics, Pittsburgh, Pennsylvania, March, 1997”, Electronic Notes in Theoretical Computer Science, Volume 6, 1997.
52. (with P.D. Lincoln and J.C. Mitchell), Optimization Complexity of Linear Logic Proof Games. Theoretical Computer Science 227 (1999) pp. 299 – 331. Extended abstract under the title “The complexity of
local proof search in linear logic” in: “Proceedings Linear Logic ’96, Tokyo Meeting”, Electronic Notes
in Theoretical Computer Science, Volume 3, 1996. [10 pp.]
7
53. (with P.D. Lincoln and J.C. Mitchell), Linear Logic Proof Games and Optimization. Bulletin of
Symbolic Logic 2 (1996) pp. 322–338.
54. (with Y. Lafont), The Undecidability of Second Order Multiplicative Linear Logic. Information and
Computation 125 (1996) pp. 46–51.
55. (with P.D. Lincoln and N. Shankar), Decision Problems for Second Order Linear Logic. In: “Logic and
Scientific Methods”, ed. by M.L. Dalla Chiara et al., Kluwer Academic Publishers, 1997, pp. 127–143.
Extended abstract in: Proc. 10th Annual IEEE Symposium on Logic in Computer Science, San Diego,
California, June, 1995, IEEE Computer Society Press, 1995, pp. 476–485.
56. (with P.D. Lincoln and J.C. Mitchell), Stochastic Interaction and Linear Logic. In: “Advances in
Linear Logic”, ed. by J.-Y. Girard, Y. Lafont, and L. Regnier, London Mathematical Society Lecture
Notes Series, Volume 222, Cambridge University Press, 1995, pp. 147–166.
57. Linear Logic and Computation: A Survey. In: “Proof and Computation”, ed. by H. Schwichtenberg,
NATO Advanced Science Institutes, Series F, Volume 139, Springer-Verlag, Berlin, 1995, pp. 379–395.
58. (with P.D. Lincoln), First Order Linear Logic Without Modalities is NEXPTIME-Hard. Theoretical
Computer Science 135 (1994) pp. 139–154.
59. (with L. Cardelli, J.C. Mitchell, and S. Martini), An Extension of System F with Subtyping. Information and Computation 109 (1994) pp. 4–56. Extended abstract in: Theoretical Aspects of Computer
Software, ed. by T. Ito and A.R. Meyer, Springer LNCS 526, 1991, pp. 750–770.
60. (with J.C. Mitchell), Notes on Sconing and Relators. In: Computer Science Logic ’92, Selected Papers,
ed. by E. Börger et al., Springer LNCS 702, 1993, pp. 352-378.
61. A Brief Guide to Linear Logic. In: “Current Trends in Theoretical Computer Science”, ed. by G.
Rozenberg and A. Salomaa, World Scientific Publishing Co., 1993, pp. 377-394.
62. (with P.D. Lincoln and N. Shankar), Linearizing Intuitionistic Implication. Annals Pure Appl. Logic 60
(1993) pp. 151–177. Extended abstract in: Proc. 6th Annual IEEE Symposium on Logic in Computer
Science, Amsterdam, July, 1991, IEEE Computer Society Press, 1991, pp. 51–62.
63. (with A. Blass), Grothendieck Topoi Representing Models of Set Theory. Annals Pure Appl. Logic 57
(1992) pp. 1–26.
64. (with P.D. Lincoln, J.C. Mitchell, and N. Shankar), Decision Problems for Propositional Linear Logic.
Annals Pure Appl. Logic 56 (1992) pp. 239–311, Special Volume dedicated to the memory of John
Myhill. Extended abstract in: Proc. 31st Annual IEEE Symposium on Foundations of Computer
Science, Volume 2, St. Louis, Missouri, October, 1990, IEEE Computer Society Press, 1990, pp.
662–671.
65. (with J.-Y. Girard and P.J. Scott), Bounded Linear Logic: A Modular Approach to Polynomial Time
Computability. Theoretical Computer Science 97 (1992) pp. 1–66. Extended abstract in: “Feasible
Mathematics, Proc. Math. Sciences Institute Workshop, Cornell Univ., June, 1989”, ed. by S.R. Buss
and P.J. Scott, Birkhäuser, Boston, 1990, pp. 195–209.
66. (with J.-Y. Girard and P.J. Scott), Normal Forms and Cut-Free Proofs as Natural Transformations.
In: “Logic From Computer Science, Mathematical Sciences Research Institute Workshop, Berkeley,
November, 1989”, ed. by Y.N. Moschovakis, MSRI Publications, Vol. 21, Springer-Verlag, 1992, pp.
217–241.
67. (with V. Breazu-Tannen, T. Coquand, and C.A. Gunter), Inheritance as Implicit Coercion. Information
and Computation 93 (1991) pp. 172–221. Extended abstract in: Proc. 4th Annual IEEE Symposium
on Logic in Computer Science, Pacific Grove, California, June, 1989, IEEE Computer Society Press,
1989, pp. 112–129.
8
68. (with D. Miller, G. Nadathur, and F. Pfenning), Uniform Proofs as a Foundation for Logic Programming. Annals Pure Appl. Logic 51 (1991) pp. 125–157. Extended abstract in: Proc. 2nd Annual IEEE
Symposium on Logic in Computer Science, Ithaca, NY, June, 1987, IEEE Computer Society Press,
1987, pp. 98–105.
69. (with P.J. Freyd), “Categories, Allegories”. North-Holland Mathematical Library, North-Holland,
Amsterdam, 1990, xviii + 296 pp.
70. (with E.S. Bainbridge, P.J. Freyd, P.J. Scott), Functorial Polymorphism. Theoretical Computer Science
70 (1990) pp. 35–64. Extended abstract in: “Logical Foundations of Functional Programming, Proc.
Year of Programming, Univ. of Texas, Austin, June, 1987”, ed. by G. Huet. Addison-Wesley, 1990,
pp. 315–327.
71. (with V. Breazu-Tannen and C.A. Gunter), Computing with Coercions. Extended abstract in: Proc.
ACM Symposium on Lisp and Functional Programming, Nice, France, June, 1990, ACM Press, 1990,
pp. 44–60.
72. A Guide to Polymorphic Types. In: “Logic and Computer Science”, ed. by P. Odifreddi, Academic
Press, 1990, pp. 387–420. Preliminary versions in: “Logical Foundations of Functional Programming,
Proc. Year of Programming, Univ. of Texas, Austin, June, 1987”, ed. by G. Huet. Addison-Wesley,
1990, pp. 419–430; see also: “Logic and Computer Science”, ed. by P. Odifreddi, Lecture Notes in
Mathematics, Vol. 1429, Springer-Verlag, Berlin, 1990, pp. 111–150.
73. (with A. Nerode and J.B. Remmel), Polynomially Graded Logic I: A Graded Version of System T.
Extended abstract in: Proc. 4th IEEE Annual Symposium on Logic in Computer Science, Pacific
Grove, California, June, 1989, IEEE Computer Society Press, 1989, pp. 375–385.
74. (with A. Blass), “Freyd’s Models for the Independence of the Axiom of Choice”. Memoirs Amer. Math.
Soc., vol. 404, Providence, RI, 1989, viii + 134 pp.
75. Normalization Revisited. In: “Categories in Computer Science and Logic, Proc. Research Conference,
Boulder, Colorado, June, 1987”, ed. by J.W. Gray and A. Scedrov. Contemporary Math., vol. 92,
Amer. Math. Soc., Providence, RI, 1989, pp. 357–369.
76. (with P.J. Freyd, J.-Y. Girard, P.J. Scott), Semantic Parametricity in Polymorphic Lambda Calculus.
Extended abstract in: Proc. 3rd Annual IEEE Symposium on Logic in Computer Science, Edinburgh,
Scotland, July, 1988, IEEE Computer Society Press, 1988, pp. 274–279.
77. The Rule of Computable Choice for Constructively Provable Functionals of Finite Type. Rendiconti
Seminario Matem. Univ. Politec. Torino, Special issue, 1987, dedicated to the conference “Logic and
Computer Science: New Trends and Applications, Torino, Italy, October, 1986”, pp. 35–39.
78. (with P.J. Freyd), Some Semantic Aspects of Polymorphic Lambda Calculus. Extended abstract in:
Proc. 2nd Annual IEEE Symposium on Logic in Computer Science, Ithaca, NY, June, 1987, IEEE
Computer Society Press, 1987, pp. 315–319.
79. (with A. Carboni and P.J. Freyd), A Categorical Approach to Realizability and Polymorphic Types.
In: “3rd ACM Workshop on Mathematical Foundations of Programming Language Semantics, New
Orleans, April, 1987”, ed. by M. Main et al. . Lecture Notes in Computer Science, vol. 298, SpringerVerlag, Berlin, 1988, pp. 23–42.
80. Kleene Computable Functionals and The Higher-Order Existence Property. J. Pure Appl. Algebra 52
(1988) pp. 313–320.
81. (with P. Scowcroft), Decompositions of Finitely Generated Modules over C(X): Sheaf Semantics and
a Decision Procedure. Math. Proc. Cambridge Philos. Soc. 103 (1988) pp. 257–268.
82. Some Aspects of Categorical Semantics: Sheaves and Glueing. In: “Logic Colloquium ’85”, ed. by The
Paris Logic Group. Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam,
1987, pp. 281–301.
9
83. (with P.J. Freyd and H. Friedman), Lindenbaum Algebras of Intuitionistic Theories and Free Categories. Annals Pure Appl. Logic 35 (1987) pp. 167–172.
84. (with H. Friedman), On the Quantificational Logic of Intuitionistic Set Theory. Math. Proc. Cambridge
Philos. Soc. 99 (1986) pp. 5–10.
85. Some Properties of Epistemic Set Theory with Collection. J. Symbolic Logic 51 (1986) pp. 748–754.
86. (with A. Blass), Small Decidable Sheaves. ibid. pp. 726–731.
87. On the Impossibility of Explicit Upper Bounds on Lengths of Some Provably Finite Algorithms of
Computable Analysis. Annals Pure Appl. Logic 32 (1986) pp. 291–297.
88. Embedding Sheaf Models for Set Theory into Boolean-Valued Permutation Models with an Interior
Operator. ibid. pp. 103–109.
89. Diagonalization of Continuous Matrices as a Representation of Intuitionistic Reals. ibid. 30 (1986) pp.
201–206.
90. (with H. Friedman), Intuitionistically Provable Recursive Well-Orderings. ibid. pp. 165–172.
91. (with H. Friedman), The Lack of Definable Witnesses and Provably Recursive Functions in Intuitionistic
Set Theories. Advances in Mathematics 57 (1985) pp. 1–13.
92. (with H. Friedman), Arithmetic Transfinite Induction and Recursive Well-Orderings. ibid. 56 (1985)
pp. 283–294.
93. Intuitionistic Set Theory. In: “Harvey Friedman’s Research on the Foundations of Mathematics”,
ed. by. L.A. Harrington, M.D. Morley, A. Scedrov, and S.G. Simpson. Studies in Logic and the
Foundations of Mathematics, North-Holland, Amsterdam, 1985, pp. 257–284.
94. Extending Gödel’s Modal Interpretation to Type Theory and Set Theory. In: “Intensional Mathematics”, ed. by S. Shapiro. Studies in Logic and the Foundations of Mathematics, North-Holland,
Amsterdam, 1985, pp. 81–119.
95. (with M. Beeson), Church’s Thesis, Continuity, and Set Theory. J. Symbolic Logic 49 (1984) pp.
630–643.
96. Differential Equations in Constructive Analysis and in Recursive Realizability Topos. J. Pure Appl.
Algebra 33 (1984) pp. 69–80.
97. On Some Non-Classical Extensions of Second-Order Intuitionistic Propositional Calculus. Annals Pure
Appl. Logic 27 (1984) pp. 155–164.
98. (with H. Friedman), Large Sets in Intuitionistic Set Theory. ibid. pp. 1–24.
99. (with H. Friedman), Set Existence Property for Intuitionistic Theories with Dependent Choice. ibid.
25 (1983) pp. 129–140; Corrigendum ibid. 26 (1984) p. 101.
100. (with R.E. Vesley), On a Weakening of Markov’s Principle. Archiv math. Logik 23 (1983) pp. 153–160.
101. (with A. Blass), Classifying Topoi and Finite Forcing. J. Pure Appl. Algebra 28 (1983) pp. 111–140.
102. (with A. Blass), Boolean Classifying Topoi. ibid. pp. 15–30.
103. “Forcing and Classifying Topoi”. Memoirs Amer. Math. Soc., vol. 295, Providence, RI, 1984, x + 93
pp.
104. (with M.P. Fourman), The “World’s Simplest Axiom of Choice” Fails. Manuscripta Math. 38 (1982)
pp. 325–332.
10
105. The Independence of the Fan Theorem in the Presence of Continuity Principles. In: “The L.E.J.
Brouwer Centenary Symposium”, ed. by A.S. Troelstra and D. van Dalen. Studies in Logic and the
Foundations of Mathematics, North-Holland, Amsterdam, 1982, pp. 435–442.
106. (with P.J. Scott), A Note on the Friedman Slash and Freyd Covers. ibid. pp. 443–452.
107. Consistency and Independence Results in Intuitionistic Set Theory. In: “Constructive Mathematics,
Proceedings New Mexico 1980”, ed. by F. Richman. Lecture Notes in Mathematics, vol. 873, SpringerVerlag, Berlin, 1981, pp. 54–86.
11