• No results found

Curriculum Vitae for Peter Sestoft Updated 20 April 2016

N/A
N/A
Protected

Academic year: 2021

Share "Curriculum Vitae for Peter Sestoft Updated 20 April 2016"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

(1)

Curriculum Vitae for Peter Sestoft

Updated 20 April 2016

Name, Address and Nationality:

Peter Andreas Sestoft, sestoft@itu.dk, Rådhusvej 30, DK-2920 Charlottenlund, Denmark. Born 25 June 1962 in Hellerup, Denmark. Nationality: Danish

Education:

1981–1988 MSc in Computer Science and Mathematics, University of Copenhagen 1989–1991 PhD in Computer Science, University of Copenhagen

Employment:

1992–1994 Assistant professor, Technical University of Denmark

1995–2002 Associate professor, Royal Veterinary and Agricultural University, Denmark

2002–2007 Professor mso, Royal Veterinary and Agricultural University, and IT University of Copenhagen. 1999–2008 Associate professor, IT University of Copenhagen, Denmark

2009–2014 Adjunct professor, University of Copenhagen

Sept 2008– Professor, Head of Software and Systems Section, IT University of Copenhagen, Denmark

Computer science interests:

Theory, implementation and principles of managed object-oriented programming languages, and of functional languages including spreadsheets. Abstract machines. Partial evaluation, abstract interpretation, program trans-formation. Software development and construction. Bioinformatics.

Some programs and systems:

Moscow ML, developed with colleagues in Moscow and Cambridge since 1993 and based on Caml Light from INRIA, France, is a Standard ML implementation used in teaching, research and industry.

C5, the most comprehensive collection library for the C# programming language [25].

The book [12] is among the 900 most cited computer science publications, out of several million.

International experience:

Research stays abroad after PhD studies: AT&T Bell Labs, New Jersey, USA, 1994–1995; Microsoft Research, Cambridge UK, Sep–Dec 2001; Harvard University School of Engineering and Computer Science, Boston, USA, Mar–Jun 2009; Microsoft Research, Cambridge UK, Dec 2009.

Refereeing etc for international fora:

Organizer or programme committee member (or chair) for 20 international conferences and workshops. [26]. Refereeing for international journals: Journal of Symbolic Computation; Journal of Logic Programming; Acta Informatica; Science of Computer Programming; Formal Aspects of Computing; Journal of Functional Pro-gramming; Computer Journal; ACM Transactions on Programming Languages and Systems; Lisp and Sym-bolic Computation; Theoretical Computer Science; Journal of Logic and Computation; Journal of Automated Software Engineering; Nordic Journal of Computing; Software Practice and Experience; Journal of Logic and Algebraic Programming.

Refereeing of conference and workshop submissions on approximately 50 occasions.

PhD evaluation committees: Copenhagen University, Technical University of Denmark, Aarhus University, Chalmers University of Technology (Sweden), Royal Institute of Technology (Sweden), Edinburgh University, IT University of Copenhagen, University of Pisa, Luleå University, Aalborg University.

Evaluation of academic positions: University of Copenhagen; Technical University of Denmark; Royal Institute of Technology (Stockholm); Royal Veterinary and Agricultural University, Denmark; Agricultural University of Norway; Copenhagen Business School; IT University of Copenhagen; Aalborg University; Roskilde University. Letters of promotion for full professorships: Oregon State University; University of Illinois.

(2)

Member of the Ecma International standardization committee for C# and the Common Language Infrastructure, 2003–2006 and 2013 onwards.

Member of the Danish national Research Council for Technology and Production (FTP) Aug 2007–Dec 2012; vice-chair Jan 2011–Dec 2012.

External evaluator for grant agencies in Australia, Austria, the Netherlands, and the United States.

Panel member for national science foundations in Sweden (2013) and Norway (2012, 2013, 2014); member of the Norwegian Research Council’s FRINATEK committee 2014–2017.

Member of the Danish national Industrial PhD and Postdoc grant committee (2016–).

External funding:

Principal investigator ofResource Constrained Embedded Systemsin collaboration with Technical University of Denmark and GN Resound; public IT Research Program 2000-2004, 4.2m DKK.

Co-principal investigator with Y. Dittrich ofEvolvable Software Productsin collaboration with Microsoft De-velopment Center Denmark; public IT Research Program 2006-2008, 3.6m DKK.

Co-principal investigator with L. Birkedal ofTools and Methods for Scalable Software Verification; DFF-FTP 2009–2013, 5.4m DKK.

Co-principal investigator with M. Steffensen ofActulus: Actuarial Calculus and Computing, in collaboration with Edlund A/S and Department of Mathematics, University of Copenhagen; HTF 2011–2015, 2.3m DKK out of the project total 11.2m DKK.

Principal investigator ofPopular Parallel Programming (P3), in collaboration with Aalborg University DFF-FTP 2015-2018, 2.8m DKK out of the project total 5.6m DKK.

Principal investigator ofMulticore and Heterogeneous Parallel Computing, in collaboration with Chinese Academy of Sciences 2015-2018, 1.5m DKK from Sino-Danish University Center.

PhD supervision:

Main or sole supervisor of Andrzej Wasowski (PhD 2005, now associate professor at IT University of Copen-hagen); Ken Friis Larsen (PhD 2006, now associate professor at Copenhagen University); Sebastien Vaucouleur (PhD 2009, now at a company in Paris); Anders Hessellund (PhD 2009, now at Deltek/Maconomy); Hannes Mehnert (PhD 2013, now postdoc at Cambridge University); David Raymond Christiansen (PhD 2015, now postdoc at Indiana University, USA); Florian Biermann (ongoing, expected completion 2018); Alexander Bock (ongoing, expected completion 2019).

Co-supervisor of Elfar Thorarinsson (PhD 2008); Hataichanok Unphon (PhD 2010); Jonas Buhrkal Jensen (PhD 2013); Filip Sieczkowski (PhD 2014, now postdoc at Aarhus University).

MSc and BSc supervision:

(3)

Publications in chronological order:

[1] N.D. Jones, P. Sestoft, and H. Søndergaard. An experiment in partial evaluation: The generation of a compiler generator. In J.-P. Jouannaud, editor,Rewriting Techniques and Applications, Dijon, France. (LNCS 202), pages 124–140. Springer-Verlag, 1985.

[2] P. Sestoft. The structure of a self-applicable partial evaluator. In H. Ganzinger and N.D. Jones, editors,Programs as Data Objects, Copenhagen, Denmark, 1985. (LNCS 217), pages 236–256. Springer-Verlag, 1986.

[3] P. Sestoft. Automatic call unfolding in a partial evaluator. In D. Bjørner, A.P. Ershov, and N.D. Jones, editors,

Partial Evaluation and Mixed Computation, pages 485–506. North-Holland, 1988.

[4] N.D. Jones, P. Sestoft, and H. Søndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9–50, 1989.

[5] P. Sestoft. Replacing function parameters by global variables. In Fourth International Conference on Func-tional Programming Languages and Computer Architecture, Imperial College, London, pages 39–53. ACM Press, September 1989.

[6] H. Søndergaard and P. Sestoft. Referential transparency, definiteness and unfoldability. Acta Informatica, 27:505–517, 1990.

[7] C.K. Gomard and P. Sestoft. Globalization and live variables. In Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut (Sigplan Notices, vol. 26, no. 9, September 1991), pages 166– 177. ACM, 1991.

[8] C.K. Gomard and P. Sestoft. Evaluation order analysis for lazy data structures. In R. Heldal, C. Kehler Holst, and P. Wadler, editors,Functional Programming, Glasgow 1991, pages 112–127. Springer-Verlag, 1992. [9] C.K. Gomard and P. Sestoft. Path analysis for lazy data structures. In M. Bruynooghe and M. Wirsing, editors,

Programming Language Implementation and Logic Programming, 4th International Symposium, PLILP ’92, Leuven, Belgium. (LNCS 631), pages 54–68. Springer-Verlag, 1992.

[10] H. Søndergaard and P. Sestoft. Non-determinism in functional languages. Computer Journal, 35(5):514–523, October 1992.

[11] Z. Chaochen, M.R. Hansen, and P. Sestoft. Decidability and undecidability results for duration calculus. In P. En-jalbert, A. Finkel, and K.W. Wagner, editors,STACS 93. 10th Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 1993. (LNCS 665), pages 58–68. Springer-Verlag, 1993.

[12] N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Englewood Cliffs, NJ: Prentice Hall, 1993. At http://www.itu.dk/people/sestoft/pebook/pebook.html.

[13] P. Sestoft. ML pattern match compilation and partial evaluation. In O. Danvy, R. Glück, and P. Thiemann, editors,Partial Evaluation, Dagstuhl Castle, Germany, February 1996. (LNCS 1110), pages 446–464. Springer-Verlag, 1996.

[14] T. Mogensen and P. Sestoft. Partial evaluation. In A. Kent and J.G. Williams, editors,Encyclopedia of Computer Science and Technology, volume 37, pages 247–279. New York: Marcel Dekker, 1997.

[15] P. Sestoft. Deriving a lazy abstract machine. Journal of Functional Programming, 7(3):231–264, May 1997. [16] S. Romanenko, C. Russo, and P. Sestoft.Moscow ML Owner’s Manual, version 2.00, June 2000. 35 pages. [17] S. Romanenko, C. Russo, and P. Sestoft.Moscow ML Language Overview, version 2.00, June 2000. 24 pages. [18] S. Diehl, P. Hartel, and P. Sestoft. Abstract machines for programming language implementation. Future

Gen-eration Computer Systems, 16(7):739–751, May 2000.

[19] P. Sestoft. Demonstrating lambda calculus reduction. In T. Mogensen, D. Schmidt, and I. H. Sudborough, editors,The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones. (LNCS 2566), pages 420–435. Springer-Verlag, 2002.

[20] P. Sestoft.Java Precisely. Cambridge, MA: The MIT Press, May 2002.

[21] E. Danielsen, L. Elkjær Jørgensen, and P. Sestoft. Monte Carlo simulations of PAC-spectra as a general approach to dynamic interactions. Hyperfine Interactions, 142:607–626, 2002.

[22] A.L. Gimsing, O.K. Borggaard, and P. Sestoft. Modeling the kinetics of the competitive adsorption and desorp-tion of glyphosate and phosphate on goethite and gibbsite and in soils. Environmental Science and Technology, 38(6):1718–1722, March 2004.

(4)

[23] P. Sestoft and H. I. Hansen. C# Precisely. Cambridge, MA: The MIT Press, October 2004. [24] P. Sestoft.Java Precisely. Cambridge, MA: The MIT Press, second edition, August 2005.

[25] Niels Kokholm and Peter Sestoft. The C5 Generic Collection Library for C# and CLI. Technical Report ITU-TR-2006-76, IT University of Copenhagen, January 2006. 254 pages.

[26] P. Sestoft, editor. Programming Languages and Systems. 15th European Symposium on Programming, ESOP 2006, Vienna, Austria, volume 3924 ofLecture Notes in Computer Science. Springer-Verlag, 2006.

[27] P. Sestoft. A Spreadsheet Core Implementation in C#. Technical Report ITU-TR-2006-91, IT University of Copenhagen, September 2006. 135 pages.

[28] Niels Kokholm and Peter Sestoft. The C5 generic collection library. A .NET 2.0 collection library that supports advanced functionality. Dr. Dobb’s Journal, pages 50–56, July 2007.

[29] J. Jagger, N. Perry, and P. Sestoft. C# Annotated Standard. Morgan Kaufmann, 2007.

[30] E.S. Andersen, A. Lind-Thomsen, B. Knudsen, S.E. Kristensen, J.H. Havgaard, E. Torarinsson, N. Larsen, C. Zwieb, P. Sestoft, J. Kjems, and J. Gorodkin. Semiautomated improvement of rna alignments. RNA Journal, 13:1–10, September 2007.

[31] Peter Sestoft. Implementing function spreadsheets. InFourth Workshop on End-User Software Engineering (WEUSE IV), Leipzig, Germany, 12 May 2008, pages 91–94, 2008.

[32] Anders Hessellund and Peter Sestoft. Flow analysis of code customizations. In J. Vitek, editor, European Conference on Object-Oriented Programming (ECOOP) 2008, LNCS 5142, pages 285–308. Springer-Verlag, 2008.

[33] Rasmus Johansen, Peter Sestoft, and Stephan Spangenberg. Zero-overhead composable aspects for .NET. In E. Börger and A. Cisternino, editors,Advances in Software Engineering. LNCS 5316, pages 185–215. Springer-Verlag, 2008.

[34] Peter Sestoft and Sebastien Vaucouleur. Technologies for evolvable software products. In E. Börger and A. Cis-ternino, editors,Advances in Software Engineering. LNCS 5316, pages 216–253. Springer-Verlag, 2008. [35] Jonas Braband Jensen, Lars Birkedal, and Peter Sestoft. Modular verification of linked lists with views via

separation logic. In12th Workshop on Formal Techniques for Java-like Programs, June 2010. [36] Peter Sestoft. Organizing research data. Acta Veterinaria Scandinavica, 53(Suppl 1):S2, June 2011. [37] P. Sestoft and H. I. Hansen. C# Precisely. Cambridge, MA: The MIT Press, second edition, February 2012. [38] H. Mehnert, F. Sieczkowski, L. Birkedal, and P. Sestoft. Formalized verification of snapshotable trees: Separation

and sharing. InVerified Software: Theories, Tools, Experiments - 4th International Conference, VSTTE 2012, volume 7152 ofLecture Notes in Computer Science, pages 179–195, 2012.

[39] P. Sestoft.Programming Language Concepts. Springer-Verlag, August 2012. xiv + 278 pages.

[40] P. Sestoft and J. Zeilund Sørensen. Sheet-defined functions: implementation and initial evaluation. In Y. Dittrich et al., editors,International Symposium on End-User Development, June 2013, volume 7897 ofLecture Notes in Computer Science, pages 88–103, 2013.

[41] Peter Sestoft. Online partial evaluation of sheet-defined functions. In A. Banerjee, O. Danvy, K. Doh, and J. Hatcliff, editors,Semantics, Abstract Interpretation, and Reasoning about Programs, volume 129 ofElectronic Proceedings in Theoretical Computer Science, pages 136–160, 2013.

[42] D. R. Christiansen, H. Niss, K. Grue, K. Sigtryggsson, and P. Sestoft. An actuarial programming language for life insurance. In30th International Congress of Actuaries, Washington DC, 2014.

[43] C. Harrington, N. Dahl, P. Sestoft, and D. Christiansen. High-performance reserve calculations for life insurance portfolios. In30th International Congress of Actuaries, Washington DC, 2014.

[44] Peter Sestoft, Jonas Druedahl Rask, and Simon Eikeland Timmermann. End-user development via sheet-defined functions. InFirst workshop on software engineering methods in spreadsheets (SEMS), Delft, The Netherlands, 2014.

[45] Christian Harrington, Nicolai Dahl, Peter Sestoft, and David Christiansen. Pension reserve computations on GPUs. InThird ACM SIGPLAN workshop on Functional High-Performance Computing, Gothenburg, Sweden, September 2014.

[46] P. Sestoft.Spreadsheet Implementation Technology. Basics and Extensions. MIT Press, 2014. ISBN 978-0-262-52664-7. 325 pages.

(5)

[47] Peter Sestoft. Early Nordic compilers and autocodes. In C. Gram, P. Rasmussen, and S. D. Østergaard, editors,

History of Nordic computing 4, 4th IFIP WG 9.7 Conference, HiNC4, Copenhagen, Denmark, pages 350–366. Springer, 2015.

References

Related documents

Mistakes that have been made in the past (e.g., by setting regulated prices for network access too low to stimulate investment in cable infrastructures) should not be used as

Development of open mass online courses is positive in many respects in pedagogical environment of traditional higher education institutions.. Global competition for students in the

This might lead one to believe that the introduction of a transaction tax in an economy with heterogeneous beliefs reduces trading volume and price volatility, however reducing

Because of the students hectic schedules in class, difficulties in sleeping habits, complaints and depression, fewer sleeping time because of exams and tests, projects, plates

A previous study investigated the effects of antenatal exercise on obese women during the prenatal period and measured their QOL on the basis of the World Health Organisation

The Working Group recognizes that choice based on a variety of offers is a basic ingredient of competition in the market. Not all consumers have the same

Virtual engineering applications need to provide clear added value to engineering processes of an enterprise without the need for the company to build up VR know-how or apply

In Sections III and IV we present initial validation of our numerical scheme by performing direct numerical simulation of the Taylor-Green vortex evolution and a fully