A calculus of atomic actions

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

Volumn , Issue , 2009, Pages 2-15

  Elmas, Tayfun ^a   Qadeer, Shaz ^b   Tasiran, Serdar ^a  

^a KOÇ UNIVERSITY   (Turkey)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Abstraction; Atomicity; Concurrent programs; Reduction

Indexed keywords

ABSTRACTION; ATOMIC ACTIONS; ATOMIC BLOCKS; ATOMIC CODES; ATOMICITY; CONCURRENT PROGRAM; CONCURRENT PROGRAMS; ITERATIVE PROOFS; PROOF CALCULUS; PROOF TOOLS; SEPARATION OF CONCERNS; SHARED MEMORIES; STATIC VERIFICATION;

ABSTRACTING; ATOMS; AUTOMATA THEORY;

CONCURRENCY CONTROL;

EID: 67649841057     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480885     Document Type: Conference Paper

References (25)

1. E. A. Ashcroft. Proving assertions about parallel programs. J. Comput. Syst. Sci., 10(1):110-135, 1975.
2. M. Barnett, B.-Y. E. Chang, R. DeLine, B. Jacobs, and K. R. M. Leino. Boogie: A modular reusable verifier for object-oriented programs. FMCO '05: 4th International Symposium on Formal Methods for Components and Objects, pages 364-387, 2005.
3. S. Brookes. A semantics for concurrent separation logic. Theor. Comput. Sci., 375(1-3):227-270, 2007. (Pubitemid 46528652)
4. J. W. Coleman and C. B. Jones. Guaranteeing the soundness of rely/guarantee rules. Journal of Logic and Computation, 17(4):807-841, 2007.
5. F. S. de Boer, U. Hannemann, and W.-P. de Roever. A compositional proof system for shared variable concurrency. In FME'97: 4th International Symposium of Formal Methods Europe, volume 1313, pages 515-532. Springer-Verlag, 1997. (Pubitemid 127124570)
6. L. M. de Moura and N. Björner. Z3: An efficient SMT solver. In TACAS '08: Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, pages 337-340. Springer, 2008.
7. E. W. Dijkstra. A Discipline of Programming. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1997.
8. T. Elmas, S. Qadeer, and S. Tasiran. A calculus of atomic actions. Technical Report MSR-TR-2008-2099, Microsoft Research, 2008.
9. T. Elmas, S. Tasiran, and S. Qadeer. VYRD: Verifying concurrent programs by runtime refinement-violation detection. In PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming Language Design and Implementation, pages 27-37, New York, NY, USA, 2005. ACM Press. (Pubitemid 43182887)
10. C. Flanagan, S. N. Freund, and S. Qadeer. Exploiting purity for atomicity. IEEE Trans. Softw. Eng., 31(4):275-291, 2005. (Pubitemid 41046920)
11. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In PLDI '02: Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, pages 234-245, New York, NY, USA, 2002. ACM Press. (Pubitemid 34991522)
12. C. Flanagan and S. Qadeer. Types for atomicity. In TLDI '03: Proceedings of the 2003 ACM SIGPLAN International Workshop on Types in Language Design and Implementation, pages 1-12, New York, NY, USA, 2003. ACM.
13. S. Freund and S. Qadeer. Checking concise specifications for multithreaded software. Journal of Object Technology, 3(6):81-101, 2004. (Pubitemid 39300052)
14. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In ICDCS '03: Proceedings of the 23rd International Conference on Distributed Computing Systems, pages 522-529, Washington, DC, USA, 2003. IEEE Computer Society.
15. B. Jacobs, J. Smans, F. Piessens, and W. Schulte. A simple sequential reasoning approach for sound modular verification of mainstream multithreaded programs. Electron. Notes Theor. Comput. Sci., 174(9):23-47, 2007. (Pubitemid 46891376)
16. C. B. Jones. Development Methods for Computer Programs including a Notion of Interference. PhD thesis, Oxford University, June 1981.
17. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Commun. ACM, 17(8):453-455, 1974.
18. R. J. Lipton. Reduction: a method of proving properties of parallel programs. Commun. ACM, 18(12):717-721, 1975.
19. M. M. Michael. Hazard pointers: Safe memory reclamation for lockfree objects. IEEE Trans. Parallel Distrib. Syst., 15(6):491-504, 2004.
20. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 268-280, New York, NY, USA, 2004. ACM.
21. S. Owicki and D. Gries. Verifying properties of parallel programs: an axiomatic approach. Commun. ACM, 19(5):279-285, 1976.
22. M. Parkinson, R. Bornat, and P. O'Hearn. Modular verification of a non-blocking stack. SIGPLAN Not., 42(1):297-302, 2007. (Pubitemid 46160776)
23. L. Wang and S. D. Stoller. Static analysis for programs with nonblocking synchronization. In PPoPP '05: Proceedings of the ACM SIGPLAN 2005 Symposium on Principles and Practice of Parallel Programming, pages 61-71. ACM Press, June 2005. (Pubitemid 43182833)
24. L. Wang and S. D. Stoller. Runtime analysis of atomicity for multithreaded programs. IEEE Transactions on Software Engineering, 32:93-110, Feb. 2006. (Pubitemid 43323906)
25. Q. Xu, W. P. de Roever, and J. He. The rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects of Computing, 9(2):149-174, 1997. (Pubitemid 127526549)