Name
Abstract | ||
|---|---|---|
We address the problem of efficient verification of multi-threaded programs running over Total Store Order (TSO) memory model. It has been shown that even with finite data domain programs, the complexity of control state reachability under TSO is non-primitive recursive. In this paper, we first present a bounded-buffer verification approach wherein a bound on the size of buffers is placed; verification is performed incrementally by increasing the size of the buffer with each iteration of the verification procedure until the said bound is reached. For programs operating on finite data domains, we also demonstrate the existence of a buffer bound k such that if the program is safe under that bound, then it is also safe for unbounded buffers. We have implemented this technique in a tool ProofTraPar. Our results against memorax [2], a state-of-the-art sound and complete verifier for TSO memory model, have been encouraging. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Logic in Computer Science | Data domain,Computer science,Parallel computing,Reachability,Total store order,Memory model,Verification procedure,Recursion |
DocType | Volume | Citations |
Journal | abs/1606.05435 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chinmay Narayan | 1 | 53 | 3.53 |
| Subodh Sharma | 2 | 47 | 5.69 |
| S. Arun-Kumar | 3 | 4 | 1.49 |