Verification of semantic commutativity conditions and inverse operations on linked data structures

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

Volumn , Issue , 2011, Pages 528-541

  Kim, Deokhwan ^a   Rinard, Martin C ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

commutativity condition; data structure; inverse operation; verification

Indexed keywords

DATA HANDLING; LINKED DATA; PARALLEL PROCESSING SYSTEMS; PARALLEL PROGRAMMING; SEMANTICS;

COMMUTATIVITY; COMMUTATIVITY CONDITION; CONDITION; HASH TABLE; INVERSE OPERATION; LINKED DATA STRUCTURES; LOGICAL FORMULAS; MAP INTERFACES; PROGRAM ANALYSIS; SOUND AND COMPLETE;

DATA STRUCTURES;

EID: 79959887153     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993561     Document Type: Conference Paper

References (52)

1. F. Aleen and N. Clark. Commutativity analysis for software parallelization: Letting program transformations see the big picture. In Proc. of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2009.
2. T. E. Anderson. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parall. Distrib. Syst., 1(1), 1990.
3. H. Attiya, R. Guerraoui, D. Hendler, P. Kuznetsov, M. M. Michael, and M. Vechev. Laws of order: Expensive synchronization in concurrent algorithms cannot be eliminated. In Proc. of the ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), 2011.
4. D. F. Bacon, R. Konuru, C. Murthy, and M. Serrano. Thin locks: Featherweight synchronization for Java. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1998.
5. R. L. Bocchino Jr., V. S. Adve, D. Dig, S. V. Adve, S. Heumann, R. Komuravelli, J. Overbey, P. Simmons, H. Sung, and M. Vakilian. A type and effect system for Deterministic Parallel Java. In Proc. of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), 2009.
6. C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. C. Rinard. Using first-order theorem provers in the Jahob data structure verification system. In Proc. of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), 2007.
7. M. J. Bridges, N. Vachharajani, Y. Zhang, T. B. Jablin, and D. I. August. Revisiting the sequential programming model for the multicore era. IEEE Micro, 28(1), 2008.
8. J. Burnim, G. Necula, and K. Sen. Specifying and checking semantic atomicity for multithreaded programs. In Proc. of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2011.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company, 1989.
10. L. de Moura and N. Bjørner. Efficient E-matching for SMT solvers. In Proc. of the International Conference on Automated Deduction (CADE), 2007.
11. R. DeLine and M. Fähndrich. Enforcing high-level protocols in low-level software. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2001.
12. B. Demsky and P. Lam. Views: Object-inspired concurrency control. In Proc. of the ACM/IEEE International Conference on Software Engineering (ICSE), 2010.
13. I. Dillig, T. Dillig, and A. Aiken. Precise reasoning for programs using containers. In Proc. of the ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), 2011.
14. T. Elmas, S. Qadeer, and S. Tasiran. A calculus of atomic actions. In Proc. of the ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), 2009.
15. M. Fähndrich and R. DeLine. Adoption and focus: Practical linear types for imperative programming. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2002.
16. M. Fähndrich and K. R. M. Leino. Heap monotonic typestates. In Proc. of the International Workshop on Aliasing, Confinement and Ownership in Object-Oriented Programming (IWACO), 2003.
17. A. Fekete, N. A. Lynch, M. Merritt, and W. E. Weihl. Commutativity-based locking for nested transactions. In Proc. of the International Workshop on Persistent Object Systems (POS), 1989.
18. J. Field, D. Goyal, G. Ramalingam, and E. Yahav. Typestate verification: Abstraction techniques and complexity results. In Proc. of the International Static Analysis Symposium (SAS), 2003.
19. Y. Ge, C. Barrett, and C. Tinelli. Solving quantified verification conditions using satisfiability modulo theories. In Proc. of the International Conference on Automated Deduction (CADE), 2007.
20. A. Goel, K. Po, K. Farhadi, Z. Li, and E. de Lara. The Taser intrusion recovery system. In Proc. of the ACM Symposium on Operating Systems Principles (SOSP), 2005.
21. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993.
22. S. Gulwani and G. C. Necula. Precise interprocedural analysis using random interpretation. In Proc. of the ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), 2005.
23. P. Hawkins, A. Aiken, K. Fisher, M. Rinard, and M. Sagiv. Data representation synthesis. In Proc. of the ACM SIGPLAN conference on Programming Language Design and Implementation (PLDI), 2011.
24. J. G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, R. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Proc. of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 1995.
25. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queue as an example. In Proc. of the International Conference on Distributed Computing Systems (ICDCS), 2003.
26. D. Kim and M. C. Rinard. Verification of semantic commutativity conditions and inverse operations on linked data structures. Technical Report MIT-CSAIL-TR-2010-056, Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Dec. 2010.
27. T. Kim, X. Wang, N. Zeldovich, and M. F. Kaashoek. Intrusion recovery using selective re-execution. In Proc. of the Symposium on Operating Systems Design and Implementation (OSDI), 2010.
28. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. In Proc. of the ACM SIGPLAN conference on Programming Language Design and Implementation (PLDI), 2007.
29. M. Kulkarni, D. Prountzos, D. Nguyen, and K. Pingali. Defining and implementing commutativity conditions for parallel execution. Technical Report TR-ECE-09-11, School of Electrical and Computer Engineering, Purdue University, Aug. 2009.
30. M. Kulkarni, D. Nguyen, D. Prountzos, X. Sui, and K. Pingali. Exploiting the commutativity lattice. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2011.
31. V. Kuncak and M. Rinard. Towards efficient satisfiability checking for Boolean algebra with Presburger arithmetic. In Proc. of the International Conference on Automated Deduction (CADE), 2007.
32. V. Kuncak, P. Lam, and M. Rinard. Role analysis. In Proc. of the ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), 2002.
33. V. Kuncak, P. Lam, K. Zee, and M. C. Rinard. Modular pluggable analyses for data structure consistency. IEEE Trans. Softw. Eng., 32 (12), 2006.
34. V. Kuncak, H. H. Nguyen, and M. Rinard. Deciding Boolean algebra with Presburger arithmetic. Journal of Automated Reasoning, 36(3), 2006.
35. P. Lam, V. Kuncak, and M. Rinard. Crosscutting techniques in program specification and analysis. In Proc. of the International Conference on Aspect-Oriented Software Development (AOSD), 2005.
36. P. Lam, V. Kuncak, and M. Rinard. Hob: A tool for verifying data structure consistency. In Proc. of the International Conference on Compiler Construction (CC), 2005.
37. P. Lam, V. Kuncak, and M. Rinard. Generalized typestate checking for data structure consistency. In Proc. of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), 2005.
38. P. Mahajan, R. Kotla, C. C. Marshall, V. Ramasubramanian, T. L. Rodeheffer, D. B. Terry, and T. Wobber. Effective and efficient compromise recovery for weakly consistent replication. In Proc. of the ACM European Conference on Computer Systems (EuroSys), 2009.
39. M. M. Michael and M. L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proc. of the ACM Symposium on Principles of Distributed Computing (PODC), 1996.
40. E. Moss. Personal communication, 2011.
41. M. C. Rinard and P. C. Diniz. Commutativity analysis: a new analysis technique for parallelizing compilers. ACM Trans. Prog. Lang. Syst., 19(6), 1997.
42. M. C. Rinard and M. S. Lam. The design, implementation, and evaluation of Jade. ACM Trans. Prog. Lang. Syst., 20(3), 1998.
43. S. Sagiv, T. W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Trans. Prog. Lang. Syst., 24(3), 2002.
44. S. Schulz. E - a brainiac theorem prover. AI Commun., 15(2-3), 2002.
45. F. Shafique, K. Po, and A. Goel. Correlating multi-session attacks via replay. In Proc. of the Workshop on Hot Topics in System Dependability (HotDep), 2006.
46. N. Shavit and D. Touitou. Software transactional memory. Distributed Computing, 10(2), 1997.
47. R. E. Strom and S. Yemini. Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Softw. Eng., 12(1), 1986.
48. C. Weidenbach. Combining superposition, sorts and splitting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 27, pages 1965-2013. TheMIT Press, 2001.
49. W. E. Weihl. Commutativity-based concurrency control for abstract data types. IEEE Trans. Comput., 37(12), 1988.
50. T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. Field constraint analysis. In Proc. of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), 2006.
51. K. Zee, V. Kuncak, and M. C. Rinard. Full functional verification of linked data structures. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2008.
52. K. Zee, V. Kuncak, and M. C. Rinard. An integrated proof language for imperative programs. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2009.