Abstraction-guided synthesis of synchronization

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 327-338

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

^a IBM RESEARCH   (United States)

Author keywords

Abstract interpretation; Concurrency; Synthesis

Indexed keywords

ABSTRACT INTERPRETATIONS; ABSTRACTION REFINEMENT; AUTOMATIC INFERENCE; CONCURRENT PROGRAM; ERROR PRONES; INFINITE STATE; INTERLEAVINGS; NEW APPROACHES; ON-THE-FLY; VERIFICATION PROCESS;

ABSTRACTING; COMPUTER SOFTWARE; LINGUISTICS; SPECIFICATIONS; SYNCHRONIZATION;

PROGRAM INTERPRETERS;

EID: 77950883615     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1706299.1706338     Document Type: Conference Paper

References (30)

1. The SAT4J SAT solver. available at http://www.sat4j.org/.
2. ATTIE, P., AND EMERSON, E. Synthesis of concurrent systems for an atomic read/atomic write model of computation. In PODC '96 (1996), ACM, pp. 111-120.
3. BALL, T., AND RAJAMANI, S. K. Automatically validating temporal safety properties of interfaces. In SPIN (2001), pp. 103-122.
4. BLANCHET, B., COUSOT, P., COUSOT, R., FERET, J., MAUBORGNE, L., MINÉ, A., MONNIAUX, D., AND RIVAL, X. A static analyzer for large safety-critical software. In PLDI (2003), pp. 196-207.
5. BLOEM, R., CHATTERJEE, K., HENZINGER, T., AND JOBSTMANN, B. Better quality in synthesis through quantitative objectives. In CAV (2009), pp. 140-156.
6. CHEREM, S., CHILIMBI, T., AND GULWANI, S. Inferring locks for atomic sections. In PLDI (2008), pp. 304-315.
7. CLARKE, E., AND EMERSON, E. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, Workshop (1982), pp. 52-71.
8. CLARKE, E. M., GRUMBERG, O., JHA, S., LU, Y., AND VEITH, H. Counterexample-guided abstraction refinement. In CAV (2000), pp. 154-169.
9. CLARKE, JR., E., GRUMBERG, O., AND PELED, D. Model Checking. The MIT Press, 1999.
10. 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.
11. EMMI, M., FISCHER, J. S., JHALA, R., AND MAJUMDAR, R. Lock allocation. In POPL (2007), pp. 291-296.
12. GRIESMAYER, A., BLOEM, R. P., AND COOK, B. Repair of boolean programs with an application to C. In CAV (2006), pp. 358-371.
13. HENZINGER, T. A., JHALA, R., MAJUMDAR, R., AND SUTRE, G. Lazy abstraction. In POPL (2002), pp. 58-70.
14. JOBSTMANN, B., GRIESMAYER, A., AND BLOEM, R. Program repair as a game. In CAV (2005), pp. 226-238.
15. JOBSTMANN, B., STABER, S., GRIESMAYER, A., AND BLOEM, R. Finding and fixing faults. Journal of Computer and System Sciences (JCSS) (2008).
16. MANNA, Z., AND WOLPER, P. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. (TOPLAS) 6, 1 (1984), 68-93.
17. MCCLOSKEY, B., ZHOU, F., GAY, D., AND BREWER, E. Autolocker: synchronization inference for atomic sections. In POPL (2006), pp. 346-358.
18. MINÉ, A. The octagon abstract domain. Higher Order Symbol. Comput. 19, 1 (2006), 31-100.
19. NAGPALY, R., PATTABIRAMANZ, K.,KIROVSKI, D., AND ZORN, B. Tolerace: Tolerating and detecting races. In STMCS: Second Workshop on Software Tools for Multi-Core Systems (2007).
20. PNUELI, A., AND ROSNER, R. On the synthesis of a reactive module. In POPL '89 (New York, NY, USA, 1989), ACM, pp. 179-190.
21. RAJAMANI, S., RAMALINGAM, G., RANGANATH, V.-P., AND VASWANI, K. Controlling non-determinism for semantic guarantees. In Exploiting Concurrency Efficiently and Correctly - (EC)2 (2008).
22. RIVAL, X., AND MAUBORGNE, L. The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. 29, 5 (2007), 26.
23. SHAVIT, N., AND TOUITOU, D. Software transactional memory. In PODC '95 (New York, NY, USA, 1995), ACM, pp. 204-213.
24. SOLAR-LEZAMA, A., ARNOLD, G., TANCAU, L., BODÍK, R., SARASWAT, V. A., AND SESHIA, S. A. Sketching stencils. In PLDI (2007), pp. 167-178.
25. SOLAR-LEZAMA, A., JONES, C. G., AND BODIK, R. Sketching concurrent data structures. In PLDI (2008), pp. 136-148.
26. SOLAR-LEZAMA, A., RABBAH, R. M., BODÍK, R., AND EBCIOGLU, K. Programming by Sketching for Bit-Streaming Programs. In PLDI (2005), pp. 281-294.
27. STABER, S., JOBSTMANN, B., AND BLOEM, R. Finding and fixing faults. In CHARME (2005), pp. 35-49.
28. VECHEV, M., AND YAHAV, E. Deriving linearizable fine-grained concurrent objects. In PLDI (2008), pp. 125-135.
29. VECHEV, M. T., YAHAV, E., BACON, D. F., AND RINETZKY, N. Cgcexplorer: a semi-automated search procedure for provably correct concurrent collectors. In PLDI (2007), pp. 456-467.
30. VECHEV, M. T.,YAHAV, E., AND YORSH, G. Inferring synchronization under limited observability. In TACAS (2009), pp. 139-154.