
The 2nd Workshop on the Theory of Transactional Memory is a forum to foster exchanges, discussions, and disseminations among researchers of speculative solutions for concurrent programming. The objective is to discuss new theoretical challenges and recent achievements in the context of transactional computing.
The transactional memory abstraction appears promising for democratizing concurrent programming. Its success lies in producing code that is extensible as atomicity is preserved under composition of transactions. This new abstraction raises several challenges such as the compliance of transactions with alternative synchronization techniques of legacy code and dedicated consistency models that favor concurrency.
As a major goal of the workshop is to explore new directions and approaches for reasoning about transactional memory, we especially encourage the submission of ongoing work, as well as position papers and case studies of existing verification projects.
The scope of the workshop includes, but is not limited to:
We solicit submissions describing recent results and/or positions relevant to the theory of transactional memory to be presented and discussed (and defended) at the workshop. As a major goal of the workshop is to explore new directions and approaches for reasoning about transactional memory, we especially encourage the submission of ongoing work, as well as position papers and case studies of existing projects. Submissions should be in PDF and include title, author information, and a 1-2 page abstract, and will be lightly reviewed for appropriateness for the workshop. Please send them by July 30 to:
vincent.gramoli@epfl.ch and victor.luchangco@oracle.comAccepted submissions will each be allotted around 10 minutes for presentation (exact time will depend on the final number of presentations). In addition, there will be significant time allotted for discussion.
|
|
Registration fee does not cover lunch.
|
A summary of this workshop is part of the December issue of the distributed computing column of ACM SIGACT News 41(4).