Meeting 51
Host: Bertrand Meyer
Location: Santa Barbara, CA, USA
Dates: 17–21 January 2011
Talks
- N. Shankar, Probabilistic Inference with PCE
- Rajeev Joshi, Building a verifiable data management system
- Peter Müller, Freedom Before Commitment: Simple Flexible Initialization for Non-Null Types
- Daniel Jackson, Arguing that it works
- Andreas Zeller, Mining Specifications
- Andreas Podelski, Trace abstraction
- Byron Cook, Prophecies and new frontiers
- Michael Butler, Structures for understanding and designing control systems
- Rupak Majumdar, Verification for control (and vice versa)
- Bertrand Meyer, Verification as a matter of course
- Pamela Zave, The architecture of mobility
- Tevfik Bultan, Analyzing Interactions of Asynchronously Communicating Systems
- Sebastian Nanz, Planning-based unit testing of concurrent programs
- Ralph-Johan Back, Formal Methods in Mathematics Education
- K. Rustan M. Leino, Refinement, reusable libraries, instantiable classes
- Peter Müller and Shankar, VSTTE Verification Competition, the alpha-version
- Guillaume Marceau, On the design of error messages aimed at novice programmers
- Bertrand Meyer, The Facebook generation: 1st-year CS students
- Rajeev Joshi, Denali-2: A practical method for automatically generating optimal code
Attendees
- Ralph Back
- Tevfik Bultan (local observer)
- Michael Butler (vice chair)
- Byron Cook (observer)
- Daniel Jackson
- Michael Jackson
- Rajeev Joshi
- Shriram Krishnamurthi
- Rustan Leino (secretary)
- Rupak Majumdar (observer)
- Bertrand Meyer (host)
- Peter Müller
- Sebastian Nanz (local observer)
- Greg Nelson
- Andreas Podelski (observer)
- N. Shankar
- Emmanuel Stapf (local observer)
- Pamela Zave (chair)
- Andreas Zeller (observer)