Verifying atomicity via data independence

2014 International Symposium on Software Testing and Analysis, ISSTA 2014 - Proceedings

Volumn , Issue , 2014, Pages 26-36

  Shacham, Ohad ^a   Yahav, Eran ^b   Golan Gueta, Guy ^a   Aiken, Alex ^c   Bronson, Nathan ^c   Sagiv, Mooly ^d   Vechev, Martin ^e  

^a YAHOO RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c STANFORD UNIVERSITY   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

^e ETH ZURICH   (Switzerland)

Author keywords

Collections; Composed operations; Concurrency; Dataindependence; Linearizability; Verification

Indexed keywords

VERIFICATION;

COLLECTIONS; COMPOSED OPERATIONS; CONCURRENCY; DATAINDEPENDENCE; LINEARIZABILITY;

SOFTWARE TESTING;

EID: 84942766188     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2610384.2610402     Document Type: Conference Paper

References (31)

1. http://gee.cs.oswego.edu/dl/jsr166/dist/jsr166edocs/jsr166e/ConcurrentHashMapV8.html.
2. http://old.nabble.com/ConcurrentHashMapV8-td32352891i20.html.
3. Apache servicemix. http://servicemix.apache.org/.
4. Apache tomcat. http://tomcat.apache.org/.
5. Autoandroid. http://code.google.com/p/autoandroid.
6. Benchmark programs. https://docs.google.com/document/pub?id=1ik0MQKebMrupYjE8yeWwF7PxaYgO1GmL5P07SjpIxXo.
7. Flexive. https://sourceforge.net/projects/flexive/.
8. Koders. http://www.koders.com/.
9. Openjdk. http://hg.openjdk.java.net/jdk7/jaxp/jdk.
10. T.j. watson libraries for analysis (wala). http://wala.sourceforge.net/wiki/index.php/Main-Page.
11. ALUR, R., MCMILLAN, K., AND PELED, D. Model-checking of correctness conditions for concurrent objects. In LICS (1996), p. 219.
12. AMIT, D., RINETZKY, N., REPS, T. W., SAGIV, M., AND YAHAV, E. Comparison under abstraction for verifying linearizability. In CAV (2007), pp. 477-490.
13. BERDINE, J., LEV-AMI, T., MANEVICH, R., RAMALINGAM, G., AND SAGIV, M. Thread quantification for concurrent shape analysis. In CAV (2008).
14. BURCKHARDT, S., DERN, C., MUSUVATHI, M., AND TAN, R. Line-up: A complete and automatic linearizability checker. In PLDI (2010).
15. CERNY, P., RADHAKRISHNA, A., ZUFFEREY, D., CHAUDHURI, S., AND ALUR, R. Model checking of linearizability of concurrent list implementations. In CAV. 2010, pp. 465-479.
16. COLVIN, R., GROVES, L., LUCHANGCO, V., AND MOIR, M. Formal verification of a lazy concurrent list-based set algorithm. In CAV (2006).
17. COUSOT, P., AND COUSOT, R. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In POPL (1977), pp. 238-252.
18. DOHERTY, S., GROVES, L., LUCHANGCO, V., AND MOIR, M. Formal verification of a practical lock-free queue algorithm. In FORTE (2004).
19. FLANAGAN, C., AND FREUND, S. N. Atomizer: A dynamic atomicity checker for multithreaded programs. In POPL (2004), pp. 256-267.
20. FLANAGAN, C., FREUND, S. N., AND YI, J. Velodrome: A sound and complete dynamic atomicity checker for multithreaded programs. In PLDI (2008), pp. 293-303.
21. GAO, H., AND HESSELINK, W. H. A formal reduction for lock-free parallel algorithms. In CAV (2004).
22. GODEFROID, P. Partial-order methods for the verification of concurrent systems - An approach to the state-explosion problem, 1995.
23. HERLIHY, M. P., AND WING, J. M. Linearizability: A correctness condition for concurrent objects. TOPLAS 12, 3 (1990).
24. HOLZMANN, G. J. The Spin Model Checker, Primer and Reference Manual. Addison-Wesley, Reading, Massachusetts, 2003.
25. MANEVICH, R., LEV-AMI, T., SAGIV, M., RAMALINGAM, G., AND BERDINE, J. Heap decomposition for concurrent shape analysis. In SAS (2008), pp. 363-377.
26. SHACHAM, O. Verifying Atomicity of Composed Concurrent Operations. PhD thesis, Tel Aviv University, 2012.
27. SHACHAM, O., BRONSON, N., AIKEN, A., SAGIV, M., VECHEV, M., AND YAHAV, E. Testing atomicity of composed concurrent operations. In OOPSLA (2011), pp. 51-64.
28. VAFEIADIS, V. Automatically proving linearizability. In CAV. 2010.
29. VAFEIADIS, V., HERLIHY, M., HOARE, T., AND SHAPIRO, M. Proving correctness of highly-concurrent linearisable objects. In PPoPP (2006).
30. VECHEV, M., YAHAV, E., AND YORSH, G. Experience with model checking linearizability. In SPIN (2009), pp. 261-278.
31. WOLPER, P. Expressing interesting properties of programs in propositional temporal logic. In POPL (1986).