Concurrency Combinators for Declarative Synchronization

Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronization is required. A synchronization logic, or policy, is at present entangled in the component code. Adding a new component or modifying existing components, which may require a change of the (global) synchronization policy, is therefore subjected to an extensive inspection of the complete code. We propose a calculus of concurrency combinators that allows a program code and its synchronization policy to be expressed separately; the policies include true parallelism, sequentiality, and isolation-only transactions. The calculus is equipped with an operational semantics and a type system. The type system is used to verify if a synchronization policy declared using combinators can be satisfied by program execution.


Editor(s):
Chin, W. N.
Published in:
Programming Languages and Systems. APLAS 2004
Presented at:
APLAS '04: the 2nd Asian Symposium on Programming Languages and Systems, Taipei, Taiwan, November 4-6, 2004
Year:
2004
Publisher:
Berlin, Heidelberg, Springer
Laboratories:




 Record created 2005-08-09, last modified 2018-01-27

External link:
Download fulltext
Fulltext
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)