Skip to main content
Conference ProceedingsOPEN ACCESS

Full abstraction for Linda

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4960 LNCS 78-92
DOI: 10.1007/978-3-540-78739-6_6
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper investigates full abstraction of a trace semantics for two Linda-like languages. The first language provides primitives for adding and removing messages from a shared memory, local choice, parallel composition and recursion. The second one adds the possibility of checking for the absence of a message in the store. After having defined a denotational semantics based on traces, we obtain fully abstract semantics for both languages by using suitable abstractions in order to identify different traces which do not correspond to different operational behaviours. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Di Giusto, C., & Gabbrielli, M. (2008). Full abstraction for Linda. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4960 LNCS, pp. 78–92). https://doi.org/10.1007/978-3-540-78739-6_6

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