| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426209 | Information and Computation | 2010 | 25 Pages |
Abstract
Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We provide a precise formulation of dynamic separation and compare it with other programming disciplines. Furthermore, exploiting dynamic separation, we investigate some possible implementations of the calculus and we establish their correctness.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
