UTCP: Compositional semantics for shared-variable concurrency

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a Unifying Theories of Programming (UTP) semantics of shared variable concurrency that is fully compositional. Previous work was based on mapping such programs, using labelling of decision points and atomic actions, to action systems, which themselves were provided with a UTP semantics. The translation to action systems was largely compositional, but their dynamic semantics was based on having all the actions collected together. Here we take a more direct approach, albeit inspired by the action-systems view, based on an abstract notion of label generation, that then exploits the standard use of substitution in UTP, to obtain a fully compositional semantics.

Cite

CITATION STYLE

APA

Butterfield, A. (2017). UTCP: Compositional semantics for shared-variable concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10623 LNCS, pp. 253–270). Springer Verlag. https://doi.org/10.1007/978-3-319-70848-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free