Abstraction-guided synthesis of synchronization

International Journal on Software Tools for Technology Transfer

Volumn 15, Issue 5-6, 2013, Pages 413-431

  Vechev, Martin ^a   Yahav, Eran ^b   Yorsh, Greta ^c  

^a ETH ZURICH   (Switzerland)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c ARM LTD   (United Kingdom)

Author keywords

Abstract interpretation; Concurrency; Synthesis; Verification

Indexed keywords

ABSTRACT INTERPRETATIONS; ABSTRACTION REFINEMENT; AUTOMATIC INFERENCE; CONCURRENCY; CONCURRENT PROGRAM; INFINITE STATE; NEW APPROACHES; VERIFICATION PROCESS;

SPECIFICATIONS; SYNCHRONIZATION; SYNTHESIS (CHEMICAL); VERIFICATION;

ABSTRACTING;

EID: 84884595686     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s10009-012-0232-3     Document Type: Article

References (35)

1. Attie, P., Emerson, E.: Synthesis of concurrent systems for an atomic read/atomic write model of computation, pp. 111-120. In: PODC'96, ACM, Berlin (1996)
2. Ball, T., Rajamani, S.K.: Automatically validating temporal safety properties of interfaces. In: SPIN, pp. 103-122 (2001)
3. Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: A static analyzer for large safety-critical software. In: PLDI, pp. 196-207 (2003)
4. Bloem, R., Chatterjee, K., Henzinger, T., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: CAV, pp. 140-156 (2009)
5. Cherem, S., Chilimbi, T., Gulwani, S.: Inferring locks for atomic sections. In: PLDI, pp. 304-315 (2008)
6. Clarke, E., Emerson, E.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Logic of Programs, Workshop, pp. 52-71 (1982)
7. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In:CAV, pp. 154-169 (2000)
8. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixed points. In: POPL, pp. 238-252 (1977)
9. Emmi, M., Fischer, J.S., Jhala, R., Majumdar, R.: Lock allocation. In: POPL, pp. 291-296 (2007)
10. Golan-Gueta, G., Bronson, N., Aiken, A., Ramalingam, G., Sagiv, M., Yahav, E.: Automatic fine-grain locking using shape properties. In: Proceedings of the 2011 ACM International Conference on Object Oriented Programming Systems Languages and Applications, pp. 225-242. OOPSLA'11. ACM, New York (2011)
11. Griesmayer, A., Bloem, R.P., Cook, B.:Repair of boolean programs with an application to C. In: CAV, pp. 358-371 (2006)
12. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL, pp. 58-70 (2002)
13. Jobstmann, B., Griesmayer, A., Bloem, R.: Program repair as a game. In: CAV, pp. 226-238 (2005)
14. Jobstmann, B., Staber, S., Griesmayer, A., Bloem, R.: Finding and fixing faults. J. Comput. Syst. Sci. (2008)
15. Kuperstein, M.: Preserving correctness under relaxed memory models. Master's thesis, Technion (2012)
16. Kuperstein, M., Vechev, M., Yahav, E.: Automatic fence inference. In: FMCAD'10: Formal Methods in Computer Aided Design (2010)
17. Kuperstein, M., Vechev, M., Yahav, E.: Partial-coherence abstractions for relaxed memory models. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI'11, pp. 187-198. ACM, New York (2011)
18. Liu, F., Nedev, N., Prisadnikov, N., Vechev, M., Yahav, E.:Dynamic synthesis for relaxedmemorymodels. In: PLDI'12: Proceedings of the 2012 ACM SIGPLAN Conference on Programming Language Design and Implementation (2012)
19. Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6(1), 68-93 (1984)
20. McCloskey, B., Zhou, F., Gay, D., Brewer, E.: Autolocker: synchronization inference for atomic sections. In: POPL, pp. 346-358 (2006)
21. Miné, A.: The octagon abstract domain. Higher Order Symbol. Comput. 19(1), 31-100 (2006)
22. Nagpaly, R., Pattabiramanz, K., Kirovski, D., Zorn, B.: Tolerace: Tolerating and detecting races. In: STMCS: Second Workshop on Software Tools for Multi-Core Systems (2007)
23. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL'89, pp. 179-190. ACM, New York (1989)
24. Rajamani, S., Ramalingam, G., Ranganath, V.-P., Vaswani, K.: Controlling non-determinism for semantic guarantees. In: Exploiting Concurrency Efficiently and Correctly-(EC)2 (2008)
25. Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. 29(5), 26 (2007)
26. Shavit, N., Touitou, D.: Software transactional memory. In: PODC'95, pp. 204-213. ACM, New York (1995)
27. Solar-Lezama, A., Arnold, G., Tancau, L., Bodík, R., Saraswat, V.A., Seshia, S.A.: Sketching stencils. In: PLDI, pp. 167-178 (2007)
28. Solar-Lezama, A., Jones, C.G., Bodik, R.: Sketching concurrent data structures. In: PLDI, pp. 136-148 (2008)
29. Solar-Lezama, A., Rabbah, R.M., Bodík, R., Ebcioglu, K.: Programming by Sketching for Bit-Streaming Programs. In: PLDI, pp. 281-294 (2005)
30. Staber, S., Jobstmann, B., Bloem, R.: Finding and fixing faults. In: CHARME, pp. 35-49 (2005)
31. The SAT4J SAT solver. http://www.sat4j.org/
32. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the Symposium on Logic in Computer Science, pp. 332-344 (1986)
33. Vechev, M., Yahav, E.: Deriving linearizable fine-grained concurrent objects. In: PLDI, pp. 125-135 (2008)
34. Vechev, M.T., Yahav, E., Bacon, D.F., Rinetzky, N.: Cgcexplorer: a semi-automated search procedure for provably correct concurrent collectors. In: PLDI, pp. 456-467 (2007)
35. Vechev, M.T., Yahav, E., Yorsh, G.: Inferring synchronization under limited observability. In: TACAS, pp. 139-154 (2009)