Terminator at Techfest keynote speech
Rick Rashid (Senior VP of Microsoft Research) discusses Terminator, termination, and liveness in his TechFest keynote address. See the video (at 29m into the talk).
Imperial lectures
I'll be giving a mini-course on proving program termination/liveness at Imperial, May 26th, 27th, and 28th, from 2-4pm. If you're in the London area you're welcome to come, to send students, etc. These lectures will be a condensed version of the 14 lectures on the same topic that I gave at Carnegie Mellon this winter, and preliminary version of what I will give at Marktoberdorf this summer.
Final week at CMU, returning to Cambridge
This is my final week at CMU. On wednesday I go to Baltimore to attend the NSA's HCSS meeting (where I will give a talk and sit on a panel), and then I return to Cambridge.
My visit to CMU was fantastic. Thanks to Ed Clarke, Jeannette Wing and Randy Bryant for the invitation, and to Peter Lee, Randy Bryant, and Denny Marous for making it happen. I worked with a number of great people, learned a lot, and made many new connections. It was an exciting time to be at CMU, especially given the recent announcement about this year's Turing prize winners.
My course seemed to go remarkably well, especially considering the lack of introductory papers/books from which to draw material. I can confidently assert that my course was the most in-depth course on termination/liveness ever taught before......with 14 lectures covering topics such as well-founded relations, decomposition techniques, rank function synthesis, invariance and variance analysis, refinement, inductive proof techniques for termination, termination for recursive and concurrent programs, and fair termination. Throughout the course I had numerous bright people in the audience asking questions and participating in discussion. Special thanks to the core group (those that attended nearly all of the lectures): Stephen Brooks, Sager Chaki, James Ezick, Arie Gurfinkel, Will Kleiber, Neel Krishnaswami, Stephen Magill, Sean McLaughlin, Frank Pfenning, John Reynolds, Robert Simmons, Jiri Simsa, Michael Tschantz, and Kwangkeun Yi.
Note: Upon hearing about my course at CMU, several people outside of CMU have asked for copies of notes and/or slides. I am currently preparing a more polished version of the notes, please contact me if you would like to see a draft when I'm happy with it........
My visit to CMU was fantastic. Thanks to Ed Clarke, Jeannette Wing and Randy Bryant for the invitation, and to Peter Lee, Randy Bryant, and Denny Marous for making it happen. I worked with a number of great people, learned a lot, and made many new connections. It was an exciting time to be at CMU, especially given the recent announcement about this year's Turing prize winners.
My course seemed to go remarkably well, especially considering the lack of introductory papers/books from which to draw material. I can confidently assert that my course was the most in-depth course on termination/liveness ever taught before......with 14 lectures covering topics such as well-founded relations, decomposition techniques, rank function synthesis, invariance and variance analysis, refinement, inductive proof techniques for termination, termination for recursive and concurrent programs, and fair termination. Throughout the course I had numerous bright people in the audience asking questions and participating in discussion. Special thanks to the core group (those that attended nearly all of the lectures): Stephen Brooks, Sager Chaki, James Ezick, Arie Gurfinkel, Will Kleiber, Neel Krishnaswami, Stephen Magill, Sean McLaughlin, Frank Pfenning, John Reynolds, Robert Simmons, Jiri Simsa, Michael Tschantz, and Kwangkeun Yi.
Note: Upon hearing about my course at CMU, several people outside of CMU have asked for copies of notes and/or slides. I am currently preparing a more polished version of the notes, please contact me if you would like to see a draft when I'm happy with it........
Subscribe to:
Posts (Atom)