Writing concurrent software while achieving both correctness and efficiency is a grand challenge. To facilitate this task, concurrent data structures have been introduced into the standard library of popular languages like Java and C#. Unfortunately, while the operations exposed by concurrent data structures behave atomically, compositions of these operations are not necessarily atomic. Recent studies have found many erroneous implementations of composed concurrent operations.
We address the problem of fixing nonlinearizable composed operations such that they behave atomically. We introduce Flint, an automated fixing algorithm for composed Map operations. Flint accepts as input a composed operation suffering from atomicity violations. Its output, if fixing succeeds, is a composed operation that behaves equivalently to the original operation in sequential runs and is guaranteed to be atomic. To our knowledge, Flint is the first general algorithm for fixing incorrect concurrent compositions.
We have evaluated Flint on 48 incorrect compositions from 27 popular applications, including Tomcat and MyFaces. The results are highly encouraging: Flint is able to correct 96% of the methods, and the fixed version is often the same as the fix by an expert programmer and as efficient as the original code.
Thu 23 Oct
|15:30 - 15:52|
Dan BarowyUniversity of Massachusetts, Amherst, Dimitar GochevUniversity of Massachusetts, Amherst, Emery BergerUniversity of Massachusetts, AmherstLink to publication
|15:52 - 16:15|
|Link to publication File Attached|
|16:15 - 16:37|
Peng LiuPurdue University, Omer TrippIBM Thomas J. Watson Research Center, Xiangyu ZhangPurdue UniversityLink to publication
|16:37 - 17:00|
|Link to publication|