Andrew D. Gordon

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Andrew D. Gordon is a British computer scientist employed by Microsoft Research. His research interests include programming language design, formal methods, concurrency, cryptography, and access control.

Biography[edit]

Gordon earned a Ph.D. from the University of Cambridge in 1992. Until 1997 Gordon was a Research Fellow at the University of Cambridge Computer Laboratory. He then joined the Microsoft Research laboratory in Cambridge, England, where he is a principal researcher in the Programming Principles and Tools group.[1] He also holds a professorship at the University of Edinburgh.[2]

Research[edit]

Gordon is one of the designers of Concurrent Haskell, a functional programming language with explicit primitives for concurrency. He is the co-designer with Martin Abadi of spi calculus, an extension of the π-calculus for formalized reasoning about cryptographic systems.[3] He and Luca Cardelli invented the ambient calculus for reasoning about mobile code.[4] With Moritz Y. Becker and Cédric Fournet, Gordon also designed SecPAL, a Microsoft specification language for access control policies.

Awards and honours[edit]

Gordon's Ph.D. thesis, Functional Programming and Input/Output, won the 1993 Distinguished Dissertation Award of the British Computer Society.[5] His 2000 paper on the ambient calculus subject with Luca Cardelli, "Anytime, Anywhere: Modal Logics for Mobile Ambients", won the 2010 SIGPLAN Most Influential POPL Paper Award.[6]

References[edit]

  1. ^ Programming, Principles, and Tools group, Microsoft Research, accessed 2012-02-02.
  2. ^ Faculty profile, Univ. of Edinburgh, retrieved 2012-02-02.
  3. ^ Ryan, Peter; Schneider, Steve A. (2001), "9.10 Spi calculus", The modelling and analysis of security protocols: the CSP approach, Addison-Wesley Professional, pp. 234–235, ISBN 978-0-201-67471-2 .
  4. ^ Bergstra, J. A.; Ponse, Alban; Smolka, Scott A. (2001), "4.3.3. The ambient calculus", Handbook of process algebra, Elsevier, pp. 1026–1028, ISBN 978-0-444-82830-9 .
  5. ^ Awards, honours, prizes and competitions won, Cambridge Computer Laboratory, accessed 2012-02-02.
  6. ^ SIGPLAN awards, retrieved 2012-02-01.

External links[edit]