Curriculum Vitae

Curriculum Vitae

Curriculum Vitae Glynn Winskel Full name: Glynn Winskel Awards, honours: Work addresses: • Member of Academia Europaea; University of Cambridge, • Turing Fellow, Alan Turing Institute. 2018{20; Department of Computer Science and Technology, • Visiting Research Fellow, Collegium de Lyon, The Computer Laboratory, 2017{18; William Gates Building, • Test of Time Award 2013, Logic in Computer 15 JJ Thomson Avenue, Science; Cambridge CB3 0FD • Awarded Advanced Grant of the European Email: [email protected] Research Council, 2011{17; Tel. no.: 01223 334613 • Royal Society Leverhulme Trust Senior Research Fellowship, 2010{11; Qualifications: • British Computer Society Brendan Murphy Memo- • B.A. in Mathematics, M.A., Cambridge (1975). rial Award in Distributed Computation, 2002; • M.Sc. in Mathematics, Oxford (1976). • Danmarks Grundforskningsfond research leader • Ph.D. in Computer Science, Edinburgh (1980). 1994-2000, to establish and direct research centre • Sc.D., Cambridge (1995). BRICS (funding, 1M euro a year). Foreign languages: Danish (fluent), French. Consultancy: TopExpress (1986{87). Microsoft Research, around 2 months a year (1998{2000). Positions: • Research Associate, Edinburgh (Sep 1979{Aug Administration: Sundry university and college com- 1980). mittees at Aarhus and Cambridge. • Visiting Lecturer, Aarhus, Denmark (Sep{Dec 1980). Miscellaneous activities: • Royal Society Postdoctoral Research Fellow (Jan Editorial board of \Mathematical Structures in Com- 1981{Jan 1982). Research Scientist, Carnegie- puter Science" Cambridge University Press. Editorial Mellon University, USA (Mar 1982{Dec 1983). board of \Transactions on Petri Nets and Other • University Lecturer in Computer Science, Cam- Models of Concurrency" Springer Lecture Notes in bridge (Jan 1984{Oct 1987) Computer Science. Guest Editor of Information and • Reader in Theoretical Computer Science Cam- Computation LICS'97 Special Issue. Guest Editor bridge (Oct 1987{Jul 1988). \Annals of Pure and Applied Logic" devoted to the • Fellow of King's College, Cambridge (Jul 1985{Jul proceedings of PTAC (1998). Member of LICS Orga- 1988). nizing Committee (1996{2003), Advisory Committee • Professor of Computer Science, Aarhus, Denmark (2004-). On the three-man LICS Test-of-Time Award (Jul 1988{Oct 2000). Committee 2006-7 and 2008-9. Advisory board of the • Director of BRICS, Centre for Basic Research in journal Higher-Order and Symbolic Computation. Edi- Computer Science, Aarhus (Jan 1994{Oct 2000). torial Board of Semantic Structures in Computation, • Professor of Computer Science, Cambridge, Eng- Kluwer Academic Publishers (-2003). Advisory Board land (Oct 2000{). Higher Order and Symbolic Computation (HOSC) • Fellow of Emmanuel College, Cambridge (Oct (2002-). On Board of EASL (European Association of 2000{). Symbolic Logic) (2005-). Referee for numerous inter- • Guest professorships: ENS Paris (2002), Paris national journals and conferences as well as reviewer XIII (2004), PPS Paris VII (2006, 2013), Aarhus of NSF and Canadian research proposals. Served (regularly, 2000{13). on numerous evaluation committees. Some recent Glynn Winskel 2 Curiculum Vitae Glynn Winskel programme committees: Mathematical Foundations • Emmanuel College Derek Brewer visiting fellow- of Program Semantics, New Orleans, 1995; Logic In ship for P-L Curien (April{June 2009). Computer Science '96, Rutgers; Logic In Computer • Royal Society Leverhulme visiting professorship for Science '97, Warsaw, Chairman; International Confer- P-L Curien (3 months 2009&2010). ence on Automata Languages and Programming '98, • Royal Society Leverhulme fellowship 2010{11. Aalborg, Co-chairman; CONCUR'99; FOSSACS 2000; Research Council Advanced grant ECSYM WOLLIC'02; CONCUR'03; APPSEM'04, WISP'04; (Events, Causality and Symmetry|the next APPSEM'05, CONCUR'05, FOSSACS'05, UFO'07, generation semantics), 2011{2017. FICS'08, Chair of LICS Test-of-Time Award Com- mittee 2010; SASB 2010, SASB 2011, DCM 2012 Teaching and supervision: (Co-chair), invited LICS 2013 and POPL 2013, CSL I have taught at Edinburgh, Aarhus, Pisa, Carnegie- 2019, EU Reviewer. Mellon, Stanford and Cambridge universities and supervised PhD students at Carnegie-Mellon, Cam- Examination and Evaluation duties: bridge, Aarhus universities and at ENS Lyon. PhD examiner for the universities of Oxford, Cam- bridge (in Pure Mathematics and Computer Science), Masters students, Aarhus 1988-2000: University of Copenhagen, Denmark's Technical Uni- • Sten Agerholm and Henrik Skjødt: Automating a versity at Lyngby, Edinburgh, Ecole Polytechnique and model checker for recursive modal asssertions in Ecole Nationale Sup´erieuredes Mines, Paris, Manch- HOL. Student project, DAIMI IR-92, 1990. ester, Marseilles, Aalborg, Aarhus, Sussex, Universit´e • Sten Agerholm: Program refinement in HOL. MSc du Qu´ebec `aMontreal, Rennes and the Free Univer- thesis, 1992. sity of Amsterdam. D.Sc. and Habilitation examiner • Ann-Grete Tan, Anders Pilegaard and Peter for Cambridge, Paris, Sheffield, Aarhus, Rennes and Strarup Jensen: Defining mutually recursive types Savoie Mont Blanc universities. On evaluation com- in HOL. Student project, DAIMI IR-99, 1990 mittees for research positions, assistant-lectureship, • Ann-Grete Tan, Anders Pilegaard: Programming lectureship, readership and professorship positions in with proofs. MSc thesis, 1991. Denmark, Sweden, Germany and the UK. EU, ERC • Brian Andersen and Carsten Rickers: A low level and EPSRC reviewer. Public Examiner in the Hon- circuit model in HOL. Student project, 1990. our School of Mathematics and Computation, Public • Michael Pedersen, Jens Bæk Jørgensen and Rikke Examiner in the Honour School of Computation, Uni- Drewsen Andersen: Literal resolution in the versity of Oxford (1997{2000). MFOCS Examiner in propositional calculus using the HOL theorem Oxford (Mathematics and CS) 2002{05. Panel member prover. Student project, 1990. Irish Advanced Laureate Awards 2018/2019. • Poul Christensen and Hans Jacob Pedersen: Automating mutually recursive type definition in Research grants: HOL. Student project, DAIMI IR-94, 1990 • SERC grantholder at Cambridge on \Models and • Poul Christensen and Hans Jacob Pedersen: A logic for parallel computation" (1985{88). reformulation of Lamport's Temporal Logic of • Holder of a Danish Research Council grant (1989{ Actions. MSc thesis, 1993. 92). • Ole I. Hougaard: Computability in HOL|a model • On the steering and programme committees of for computation in formal logic. MSc thesis, 1993. DART a medium size research collaboration • Urban Engberg: Analyzing authentication proto- between Aarhus, Aalborg and Copenhagen univer- cols. Student project, DAIMI IR-97, 1990. sities (1992{1994). • Claus Torp Jensen: The concurrency workbench • BRICS: Founding and scientific director of BRICS with priority. Student project, 1992. (Basic Research in Computer Science), research • Bettina Blaaberg Sørensen and Christian Clausen: centre of the Danish Research Foundation (1994{ Adequacy results for a lazy functional language 2000). with recursive and polymorphic types. Student • Site leader of EU projects CEDISYS, CLICS I and project, 1992. Published in Theor.Comp.Sc., 1994. II, LINEAR, APPSEM. • Henrik Enstrøm: A model of polymorphism in the • EPSRC grantholder at Cambridge on \Domain effective topos. MSc thesis, 1997. theory for concurrency" (2004{08). • Three successful applications for EPSRC Fellow- PhD students: ships for Abbes, Sobocinski and Staton, originally employed on above grant (Abbes and Sobocin- • Jonathon Billington: Coloured Petri Nets. 1989. ski left for permanent lectureships in Paris and • Guo-Qiang Zhang: Logic of Domains. 1991. Southampton resp., 2008). Published by Birkh¨auser. • Juanito Camilleri: Priority in Process Calculi. 1991. Glynn Winskel Curiculum Vitae Glynn Winskel 3 • Henrik Reif Andersen: Verification of temporal USA; Workshop on Systems Biology, Bellairs Research properties of concurrent systems. 1993. Institute (McGill Univ), Barbados, March 2010; SAS • Sten Agerholm: Domain Theory in HOL. 1994. 2010, Perpignan; Christmas Lecture at the Midlands • Claus Torp Jensen: Prioritized and independent Graduate School (Birmingham, Leicester, Nottingham actions in distributed computer systems. 1994. and Sheffield Universities), December 15, 2010; Har- • Urban Engberg: Reasoning in the Temporal Logic vard Medical School, two weeks in November 2010 of Actions, the design and implementation of an and in 2011; CHOCO project, ENS Lyon, April 2011; interactive computer system. 1996. Information Security Workshop, ISR 2011, Oxford; • Torben Bra¨uner: An Axiomatic Approach to Nordic Workshop on Programming Theory, V¨aster˚as, Adequacy. 1996. Sweden, 2011, Robin Milner Memorial 2012, Edin- • Gian Luca Cattani: Presheaf Models for Concur- burgh; FOSSACS 2012, Tallin; ACCATS 2013, Rome; rency. 1999. Opening lecture at the new-building celebrations of • Thomas Troels Hildebrandt: Categories of mod- Labs PPS and LIAFA, Paris, April 2013; 60th Birth- els for concurrency|independence, fairness and day Event in Oxford for Samson Abramsky, May 2013; dataflow. 2000. 60th Birthday Event in Venice for Pierre-Louis Curien, • Mikkel Nygaard: Domain Theory for Concurrency. September 2013; ISDT'13, October 2013, Changsha; 2003. LOCALI 2013, Beijing, November 2013; WIP2013, • Mario Jose Caccamo: A Formal Calculus for CIAPA (Tulane Univ), Costa Rica, December 2013. Categories. 2003. Workshop on Probability, Bellairs Research Institute • Federico Crazzolara: Language, Semantics, and (McGill Univ),

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    3 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us