*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Speaker: Jens Palsberg, UCLA
Title: How to find bugs in transactional memory
Abstract: Guerraoui and Kapalka defined opacity as a safety criterion for transactional memory algorithms in 2008. Researchers have shown how to prove opacity, while little is known about pitfalls that can lead to non-opacity. We identify two problems that lead to non-opacity, we present automatic tool support for finding those problems, and we prove an impossibility result. We first show that the well-known TM algorithms DSTM and McRT don't satisfy opacity. DSTM suffers from a write-skew anomaly, while McRT suffers from a write-exposure anomaly. We then prove that for direct-update TM algorithms, opacity is incompatible with a liveness criterion called local progress, even for fault-free systems. Our result implies that if TM algorithm designers want both opacity and local progress, they should avoid direct-update algorithms. Joint work with Mohsen Lesani that we will present at DISC 2013 and have presented at TRANSACT 2013 under the title "Proving non-opacity".
Bio: Jens Palsberg is Professor and Chair of Computer Science at UCLA, University of California, Los Angeles. His research interests span the areas of compilers, embedded systems, programming languages, software engineering, and information security. He is the editor-in-chief of ACM Transactions of Programming Languages and Systems, a member of the editorial board of Information and Computation, a former member of the editorial board of IEEE Transactions on Software Engineering, and a former conference program chair of ACM Symposium on Principles of Programming Languages (POPL), Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), the Static Analysis Symposium (SAS), Conference on Embedded Systems Software (EMSOFT), Conference on Formal Methods and Programming Models for Co-Design (MEMOCODE), ACM Workshop on Program Analysis for Software Tools and Engineering (PASTE), and Symposium on Requirements Engineering for Information Security (SREIS). In 2012 he received the ACM SIGPLAN Distinguished Service Award.
Jens Palsberg received a Ph.D. in Computer Science from University of Aarhus, Denmark in 1992. In 1992-1996 he was a visiting scientist at various institutions, including MIT. In 1996-2002 he was an Associate Professor and, in 2002-2003, Professor of Computer Science at Purdue University, after which he moved to UCLA. He has authored over 80 technical papers, co-authored the book Object-Oriented Type Systems, and co-authored the 2002 revision of Appel's textbook on Modern Compiler Implementation in Java. He is the recipient of National Science Foundation CAREER and ITR awards, a Purdue University Faculty Scholar award, an IBM Faculty Award, and an Okawa Foundation research award. His research has also been supported by DARPA, Intel, and British Telecom. He has served as the vice chair of ACM SIGBED, Special Interest Group on Embedded Systems, as vice chair of computer science at UCLA, as associate head of computer science at Purdue University, as the general chair of POPL and International Workshop on Model Checking of Software (SPIN), and as the conference chair of the IEEE Symposium on Logic in Computer Science (LICS).
