Towards formally specifying and verifying transactional memory

Formal Aspects of Computing

Volumn 25, Issue 5, 2013, Pages 769-799

  Doherty, Simon ^a   Groves, Lindsay ^a   Luchangco, Victor ^b   Moir, Mark ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b ORACLE CORPORATION   (United States)

Author keywords

Formal specification; I O automation; Refinement; Simulation proof; Transactional memory; Verification

Indexed keywords

CORRECTNESS PROOFS; FORMAL SPECIFICATION; IMPLEMENTATION TECHNIQUES; REFINEMENT; RESTRICTIVE CONDITIONS; SIMULATION PROOF; TECHNIQUES AND TOOLS; TRANSACTIONAL MEMORY;

AUTOMATA THEORY; SPECIFICATIONS; VERIFICATION;

STORAGE ALLOCATION (COMPUTER);

EID: 84882997823     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-012-0225-8     Document Type: Article

References (38)

1. Aydonat U, Abdelrahmen T (2008) Serializability of transactions in software transactional memory. In: 3rd ACM workshop on transactional computing (TRANSACT)
2. Abadi M, Birrell A, Harris T, Isard M (2011) Semantics of transactional memory and automatic mutual exclusion. ACM Trans Program Lang Syst 33(1): 2:1-2:50
3. Adl-Tabatabai A-R, Shpeisman T (eds) (2009) Draft specification of transactional language constructs for C++, version 1.0. http://labs.oracle.com/ scalable/pubs/C++-transactional-constructs-1.0.pdf
4. Colvin R, Doherty S, Groves L (2005) Verifying concurrent data structures by simulation. In: Boiten E, Derrick J (eds) Proceedings of the refineNet workshop (REFINE). Electronic notes in theoretical computer science. Guildford, UK
5. Colvin R, Groves L, Luchangco V, Moir M (2006) Formal verification of a lazy concurrent list-based set algorithm. In: Proceedings of the 18th international conference on computer aided verification (CAV), pp 475-488
6. Cohen A, O'Leary JW, Pnueli A, Tuttle MR, Zuck LD (2007) Verifying correctness of transactional memories. In: Proceedings of the formal methods in computer aided design (FMCAD), pp 37-44
7. Cohen A, Pnueli A, Zuck LD (2008) Mechanical verification of transactional memories with non-transactional memory accesses. In: Proceedings of the 20th international conference on computer aided verification (CAV), pp 121-134
8. Doherty S, Groves L, Luchangco V, Moir M (2004) Formal verification of a practical lock-free queue algorithm. In: Proceedings of the international conference on formal techniques for networked and distributed systems (FORTE), pp 97-114
9. Doherty S, Groves L, Luchangco V, Moir M (2009) Towards formally specifying and verifying transactional memory. In: Proceedings of the refineNet workshop (REFINE). Electronic notes in theoretical computer science. http://labs.oracle.com/scalable/pubs/Refine09-TM-correctness.pdf
10. Doherty S, Moir M (2009) Nonblocking algorithms and backward simulation. In: Proceedings of 23rd international conference on distributed computing (DISC)
11. Dice D, Shalev O, Shavit N (2006) Transactional locking II. In: Proceedings of the international conference on distributed computing (DISC), pp 194-208
12. Dalessandro L, Spear MF, Scott ML (2010) NOrec: streamlining STM by abolishing ownership records. In: Proceedings of the 15th ACM SIGPLAN symposium on principles and practice of parallel programming (PPoPP), pp 67-78
13. Guerraoui R, Henzinger TA, Jobstmann B, Singh V (2008) Model checking transactional memories. In: Proceedings of the 2008 ACM SIGPLAN conference on programming language design and implementation (PLDI), pp 372-382
14. Guerraoui R, Henzinger TA, Singh V (2008) Completeness and nondeterminism in model checking transactional memories. In: Proceedings of the 19th international conference on concurrency theory (CONCUR), pp 21-35
15. Guerraoui R, Henzinger TA, Singh V (2009) Software transactional memory on relaxed memory models. In: Proceedings of the 21st international conference on computer aided verification (CAV), pp 321-336
16. Guerraoui R, Kapalka M (2008) On the correctness of transactional memory. In: Proceedings of the 13th ACM SIGPLAN symposium on principles and practice of parallel programming (PPoPP), pp 175-184
17. Guerraoui R, Kapałka M (2010) Principles of Transactional Memory. Synthesis Lectures on Distributed Computing Theory. Morgan Claypool, USA
18. Herlihy M, Koskinen E (2008) Transactional boosting: a methodology for highly-concurrent transactional objects. In: Proceedings of the 13th ACM SIGPLAN symposium on principles and practice of parallel programming (PPoPP), pp 207-216
19. Herlihy M, Moss JEB (1993) Transactional memory: architectural support for lock-free data structures. In: Proceedings of the 20th annual international symposium on computer architecture (ISCA)
20. Hoare CAR (1972) Towards a theory of parallel programming. In: Operating systems techniques. Academic Press, New York, pp 61-71
21. Hudson RL, Saha B, Adl-Tabatabai A-R, Hertzberg BC (2006) McRT-Malloc: a scalable transactional memory allocator. In: Proceedings of the 5th international symposium on memory management (ISMM), pp 74-83
22. Imbs D, de Mendívil J, Raynal M (2008) On the consistency conditions of transactional memories. Technical Report 1917, Institut de Recherche en Informatique et Systèmes Aalátoires
23. Imbs D, de Mendívil J, Raynal M (2009) Brief announcement: virtual world consistency, a new condition for STM systems. In: Proceedings of the 2009 ACM symposium on principles of distributed computing (PODC), pp 280-281
24. Lev Y, Luchangco V, Marathe VJ, Moir M, Nussbaum D, Olszewski M (2009) Anatomy of a scalable software transactional memory. In: 4th ACM SIGPLAN workshop on transactional computing (TRANSACT)
25. Lynch N, Tuttle M (1987) Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the 6th annual ACM symposium on principles of distributed computing (PODC), pp 137-151
26. Lynch NA, Tuttle MR (1989) An introduction to input/output automata. CWI Q 2: 219-246
27. Lynch N, Vaandrager F (1995) Forward and backward simulations, I: untimed systems. Inf Comput 121(2): 214-233
28. Moore KF, Grossman D (2008) High-level small step operational semantics for transactions. In: Proceedings of the 35th annual ACM symposium on principles of prgoramming languages (POPL)
29. Moss JEB, Hosking AL (2006) Nested transactional memory: model and architecture sketches. Sci Comput Program 63(2): 186-201
30. Owicki S, Gries D (1976) An axiomatic proof technique for parallel programs. Acta Inform 6(4): 319-340
31. O'Leary J, Saha B, Tuttle MR (2009) Model checking transactional memory with Spin. In: Proceedings of the 29th IEEE international conference on distributed computing systems (ICDCS), pp 335-342
32. Papadimitriou CH (1979) The serializability of concurrent database updates. J ACM 26: 631-653
33. The PVS specification and verification system. http://pvs.csl.sri.com/
34. Ramadan HE, Roy I, Witchel E (2008) Dependence-aware transactional memory for increased concurrency. In: Proceedings of the 41st annual IEEE/ACM international symposium on microarchitecture, pp 246-257
35. Saha B, Adl-Tabatabai A-R, Hudson RL, Minh CC, Hertzberg B (2006) McRT-STM: a high performance software transactional memory system for a multi-core runtime. In: Proceedings of the 11th ACM SIGPLAN symposium on principles and practice of parallel programming (PPoPP), pp 187-197
36. Schneider F (1992) Introduction, special issue: specification of concurrent systems. Distrib Comput 6(1)
37. Scott ML (2006) Sequential specification of transactional memory semantics. In: 1st ACM SIGPLAN workshop on languages, compilers, and hardware support for transactional computing (TRANSACT)
38. SkySTM Interest Google Group (2009). http://groups.google.com/group/ skystm-interest