Sketching concurrent data structures

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 136-148

  Solar Lezama, Armando ^a   Jones, Christopher Grant ^a   Bodik, Rastislav ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Concurrency; SAT; Sketching; SPIN; Synthesis

Indexed keywords

CONCURRENCY; SAT; SKETCHING; SPIN; SYNTHESIS;

BOOLEAN FUNCTIONS; C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTERS; DATA STRUCTURES; FILE ORGANIZATION; LEARNING ALGORITHMS; LINGUISTICS; PHILOSOPHICAL ASPECTS;

CONCURRENCY CONTROL;

EID: 57349122370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375599     Document Type: Conference Paper

References (24)

1. J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren. Conversion of control dependence to data dependence. In POPL '83: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 177-189, New York, NY, USA, 1983. ACM.
2. D. Amit, N. Rinetzky, T. Reps, M. Sagiv, and E. Yahav. Comparison under abstraction for verifying linearizability. In CAV '07: 19th International Conference on Computer Aided Verification, volume 4590, pages 477-490. Springer, 2007.
3. D. Andre and S. Russell. Programmable reinforcement learning agents. Advances in Neural Information Processing Systems, 13, 2001. MIT Press.
4. D. Angluin and C. H. Smith. Inductive inference: Theory and methods. ACM Comput. Surv., 15(3):237-269, 1983.
5. Y. Bar-David and G. Taubenfeld. Automatic discovery of mutual exclusion algorithms. In PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 305-305, New York, NY, USA, 2003. ACM.
6. J. Bilmes, K. Asanovic, C.-W. Chin, and J. Demmel. Optimizing matrix multiply using phipac: A portable, high-performance, ansi c coding methodology. In International Conference on Supercomputing, pages 340-347, 1997.
7. S. Burckhardt, R. Alur, and M. M. K. Martin. Checkfence: checking consistency of concurrent data types on relaxed memory models. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, volume 42, pages 12-21, New York, NY, USA, 2007. ACM.
8. B. Fischer and J. Schumann. Autobayes: a system for generating data analysis programs from statistical models. Journal of Functional Programming, 13(3):483-508, May 2003.
9. S. Heller, M. Herlihy, V. Luchangco, M. Moir, W. N. S. III, and N. Shavit. A lazy concurrent list-based set algorithm. In OPODIS '05: 9th International Conference on Principles of Distributed Systems, volume 3974, pages 3-16. Springer, 2005.
10. D. Hensgen, R. Finkel, and U. Manber. Two algorithms for barrier synchronization. International Journal of Parallel Programming, 17(1):1-17, 1988.
11. M. Herlihy and N. Shavit. The art of multiprocessor programming. Morgan Kaufmann, 2008.
12. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463- 492,1990.
13. G. J. Holzmann. The model checker SPIN. Software Engineering, 23(5):279-295, 1997.
14. R. Kowalski. Algorithm = logic + control. Commun. ACM, 22(7):424-436, 1979.
15. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, 28(9):690-691, 1979.
16. A. Silberschatz and P. B. Galvin. Operating System Concepts. John Wiley & Sons, Inc., New York, NY, USA, 2000.
17. D. R. Smith. KIDS: A semiautomatic program development system. IEEE Transactions on Software Engineering, 16(9): 1024-1043, 1990.
18. A. Solar-Lezama, G. Arnold, L. Tancau, R. Bodik, V. Saraswat, and S. Seshia. Sketching stencils. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, volume 42, pages 167-178, New York, NY, USA, 2007. ACM.
19. A. Solar-Lezama, R. Rabbah, R. Bodik, and K. Ebcioglu. Programming by sketching for bit-streaming programs. In PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, pages 281-294, New York, NY, USA, 2005. ACM Press.
20. A. Solar-Lezama, L. Tancau, R. Bodik, V. Saraswat, and S. Seshia. Combinatorial sketching for finite programs. In ASPLOS '06, San Jose, CA, USA, 2006. ACM Press.
21. A. Solar-Lezama, L. Tancau, R. Bodik, V. Saraswat, and S. Seshia. Combinatorial sketching for finite programs. In 12th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2006), pages 404-415, New York, NY, USA, 2006. ACM Press.
22. V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. Proving correctness of highly-concurrent linearisable objects. In PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 129-136, New York, NY, USA, 2006. ACM.
23. M. T. Vechev, E. Yahav, and D. F. Bacon. Correctness-preserving derivation of concurrent garbage collection algorithms. In PLDI '06: Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation, pages 341-353, New York, NY, USA, 2006. ACM.
24. M. T. Vechev, E. Yahav, D. F. Bacon, and N. Rinetzky. Cgcexplorer: a semi-automated search procedure for provably correct concurrent collectors. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, pages 456-467, New York, NY, USA, 2007. ACM.