Model checking transactional memories

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

Volumn , Issue , 2008, Pages 372-382

  Guerraoui, Rachid ^a   Henzinger, Thomas A ^a   Jobstmann, Barbara ^a   Singh, Vasu ^a  

^a EPFL   (Switzerland)

Author keywords

Model checking; Transactional memories

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTERS; CONCURRENCY CONTROL; DATA STORAGE EQUIPMENT; LINGUISTICS; PROBLEM ORIENTED LANGUAGES; STORAGE ALLOCATION (COMPUTER);

CONCURRENT TRANSACTIONS; LIVELOCK FREEDOMS; LIVENESS; LIVENESS PROPERTIES; MODEL CHECKERS; MODEL CHECKING SOFTWARES; OPTIMISTIC CONCURRENCIES; SAFETY CASES; SAFETY PROPERTIES; SERIALIZABILITY; SHARED VARIABLES; SIMULATION RELATIONS; STATE TRANSITIONS; TRANSACTIONAL MEMORIES; TRANSITION SYSTEMS; VERIFICATION PROBLEMS;

MODEL CHECKING;

EID: 57349171360     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375626     Document Type: Conference Paper

References (26)

1. [AKH03] J. H. Anderson, Y. Kim, and T. Herman. Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing, pages 75-110, 2003.
2. [AMP00] R. Alur, K. L. McMillan, and D. Peled. Model-checking of correctness conditions for concurrent objects. Information and Computation, pages 167-188, 2000.
3. [BAM07] S. Burckhardt, R. Alur, and M. M. K. Martin. Checkfence: checking consistency of concurrent data types on relaxed memory models. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 12-21, 2007.
4. [BCG89] M. C. Browne, E. M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. Information and Computation, pages 13-31, 1989.
5. [BD94] J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessors control. In International Conference on Computer Aided Verification (CAV), pages 68-80. Springer, 1994.
6. [COP+07] A. Cohen, J. O'Leary, A. Pnueli, M. R. Tuttle, and L. Zuck. Verifying correctness of transactional memories. In International Conference on Formal Methods in Computer-Aided Design (FMCAD), pages 37-44. IEEE Computer Society, 2007.
7. [DSS06] D. Dice, O. Shalev, and N. Shavit. Transactional locking II. In International Symposium on Distributed Computing (DISC), pages 194-208. Springer, 2006.
8. [EGLT76] K. P. Eswaran, J. Gray, R. A. Lorie, and I. L. Traiger. The notions of consistency and predicate locks in a database system. Communications of the ACM, pages 624-633, 1976.
9. [FH07] K. Fraser and T. Harris. Concurrent programming without locks. ACM Transactions on Computer Systems, 2007.
10. [FR85] M. Fié and G. Roucairol. Maximal serializability of iterated transactions. Theoretical Computer Science, pages 1-16, 1985.
11. [GK08] R. Guerraoui and M. Kapalka. On the correctness of transactional memory. In ACM SIGPLAN Symposium, on Principles and Practice of Parallel Programming (PPoPP), pages 175-184, 2008.
12. [GYS04] G. Gopalakrishnan, Y. Yang, and H. Sivaraj. QB or Not QB: An efficient execution verification tool for memory orderings. In International Conference on Computer Aided Verification (CAV), pages 401-413. Springer, 2004.
13. [Her91] M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, pages 124-149, 1991.
14. [HHK95] M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 453-462, 1995.
15. [HLM03] M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In International Conference on Distributed Computing Systems, pages 522-529. IEEE Computer Society, 2003.
16. [HLMS03] M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer. Software transactional memory for dynamic-sized data structures. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 92-101, 2003.
17. [HM93] M. Herlihy and I. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In International Symposium on Computer Architecture, pages 289-300. ACM Press, 1993.
18. [HQR99] T. A. Henzinger, S. Qadeer, ar, d s. K. Rajamani. Verifying sequential consistency on shared-memory multiprocessor systems. In International Conference on Computer Aided Verification (CAV), pages 301-315. Springer, 1999.
19. [KR81] H. T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM Transactions on Database Systems, pages 213-226, 1981.
20. [LR07] J. R. Larus and R. Rajwar. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan & Claypool, 2007.
21. [Mil71] R. Milner. An algebraic definition of simulation between programs. In International Joint Conference on Artificial Intelligence (IJCAI), pages 481-489. William Kaufmann, 1971.
22. [Pap79] C. H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, pages 631-653, 1979.
23. [Qad03] S. Qadeer. Verifying sequential consistency on shared-memory multiprocessors by model checking. IEEE Transactions on Parallel and Distributed Systems, pages 730-741, 2003.
24. [Sco06] M.L. Scott. Sequential specification of transactional memory semantics. In ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT), 2006.
25. [SS05] W. N. Scherer and M. L. Scott. Advanced contention management for dynamic software transactional memory. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 240-248, 2005.
26. [ST95] N. Shavit and D. Touitou. Software transactional memory. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 204-213, 1995.