This paper investigates full abstraction of a trace semantics for two Linda-like languages. The first language provides primitives for adding and re-moving 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.

Full abstraction for Linda

DI GIUSTO, CINZIA;GABBRIELLI, MAURIZIO
2008

Abstract

This paper investigates full abstraction of a trace semantics for two Linda-like languages. The first language provides primitives for adding and re-moving 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
Proceedings of the European Symposium on Programming (ESOP08)
78
92
C. Di Giusto; M. Gabbrielli
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/56982
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact