[talks] Colloquium Speaker: Frank Pfenning Monday, September 26th
Nicole E. Wagenblast
nwagenbl at CS.Princeton.EDU
Tue Sep 20 16:48:43 EDT 2016
Professor Frank Pfenning, Carnegie Mellon University
Monday, September 26th, 12:30pm
Computer Science 105
Design and Implementation of a Freshman Algorithms Course with Contracts
We provide an overview of the introductory computer science curriculum at Carnegie Mellon University and then provide some detail about its perhaps most unusual component: a first-semester freshman-level course on imperative programming, algorithms, data structures, and computational thinking. A key aspect of this course is its use of C0, a small safe subset of C augmented with a language for expressing contracts that capture pre- and post-conditions as well as loop and data structure invariants. We provide some sample lecture material and report on our experience with this course over the last six years.
Frank Pfenning studied Mathematics and Computer Science at the Technical University Darmstadt and then left for Carnegie Mellon University on a Fulbright scholarship where he obtained his Ph.D. in Mathematics in 1987 under the supervision of Professor Peter Andrews.
He subsequently joined the Department of Computer Science at Carnegie Mellon University as research faculty where he became Professor in 2002 and served as Director of Graduate Programs from 2004 to 2008 and Associate Dean for Graduate Education from 2009 to 2010. He was appointed Head of the Computer Science Department in January 2013 and the Joseph F. Traub Professor of Computer Science in October 2015.
He has spent time as visiting scientist at the Max-Planck-Institute for Computer Science in Saarbrücken, as Alexander-von-Humboldt fellow at the Technical University Darmstadt, and as visiting professor at École Polytechnique and INRIA-Futurs. He has advised 24 completed Ph.D. theses and won the Herbert A. Simon Award for Teaching Excellence in the School of Computer Science in 2002.
He served as trustee, vice president, and president of CADE, Inc., the governing body of the International Conference on Automated Deduction, and on advisory boards for INRIA, the Max-Planck-Institute for Computer Science, and Seoul National University. He has chaired several conferences and program committees, including CADE and LICS, and has been a member of the editorial boards for Theoretical Computer Science, Journal of Automated Reasoning, and the Journal of Symbolic Computation. He was named Fellow of the ACM in 2015.
His research interests include programming languages, logic and type theory, logical frameworks, automated deduction, and computer security. In his spare time he enjoys playing squash, running, hiking, cooking, and reading.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the talks