Name
Abstract | ||
|---|---|---|
This paper presents a technique for automatically constructing a fix for buggy concurrent programs: given a concurrent program that does not satisfy user-provided assertions, we infer atomic blocks that fix the program. An atomic block protects a piece of code and ensures that it runs without interruption from other threads. Our technique uses a verification tool as a subroutine to find the smallest atomic regions that remove all bugs in a given program. Keeping the atomic regions small allows for maximum concurrency. We have implemented our approach in a tool called AtomicInf. A user of AtomicInf can choose between strong and weak atomicity semantics for the inferred fix. While the former is simpler to find, the latter provides more information about the bugs that got fixed. We ran AtomicInf on several benchmarks and came up with the smallest and the most precise atomic regions in all of them. We implemented an earlier technique to our setting and observed that AtomicInf is 1.7 times faster on an average as compared to an earlier approach. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Atomicity,Programming language,Subroutine,Concurrency,Computer science,Thread (computing),Semantics |
DocType | Volume | Citations |
Journal | abs/1403.1749 | 1 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saurabh Joshi | 1 | 26 | 2.53 |
| Akash Lal | 2 | 537 | 32.12 |