Transactional Memory allows programmers to reduce the number of synchronization errors introduced in concurrent programs, but does not ensures its complete elimination. This paper proposes a pattern matching based approach to the static detection of atomicity violation, based on a path-sensitive symbolic execution method to model four anomalies that may affect Transactional Memory programs. The proposed technique may be used to to bring to programmer's attention pairs of transactions that the programmer has mis-specified, and should have been combined into a single transaction. The algorithm first traverses the AST tree, removing all the non-transactional blocks and generating a trace tree in the path sensitive manner for each thread. The trace tree is a Trie like data structure, where each path from root to a leaf is a list of transactions. For each pair of threads, erroneous patterns involving two consecutive transactions are then checked in the trace tree. Results allow to conclude that the proposed technique, although triggering a moderate number of false positives, can be successfully applied to Java programs, correctly identifying the vast majority of the relevant erroneous patterns.
|Title of host publication||ACM|
|Place of Publication||New York, NY, USA|
|Publication status||Published - 1 Jan 2010|
|Event||Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging (PADTAD) - |
Duration: 1 Jan 2010 → …
|Conference||Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging (PADTAD)|
|Period||1/01/10 → …|