eprintid: 334
rev_number: 10
eprint_status: archive
userid: 32
dir: disk0/00/00/03/34
datestamp: 2011-06-09 08:43:49
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-09 08:43:49
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Pugliese, Rosario
creators_name: Rowstron, Antony I. T.
creators_id: r.denicola@imtlucca.it
creators_id: 
creators_id: 
title: Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: In this paper we describe the proof of an optimisation that can be applied to tuple space based run-time systems (as used in Linda). The optimisation allows, under certain circumstances, for a tuple that has been destructively removed from a shared tuple space (for example, by a Linda in) to be returned as the result for a non-destructive read (for example, a Linda rd) for a different process. The optimisation has been successfully used in a prototype run-time system.
date: 2000
date_type: published
series: Lecture Notes in Computer Science
volume: 1906
publisher: Springer
pagerange: 66-80
id_number: 10.1007/3-540-45263-X_5
refereed: TRUE
isbn: 3-540-41020-1
book_title: Coordination Models and Languages (COORDINATION 2000)
editors_name: Porto, Antonio
editors_name: Roman, Catalin
official_url: http://dx.doi.org/10.1007/3-540-45263-X_5
citation:   De Nicola, Rocco and Pugliese, Rosario and Rowstron, Antony I. T.  Proving the Correctness of Optimising Destructive and Non-destructive Reads over Tuple Spaces.   In:  Coordination Models and Languages (COORDINATION 2000).   Lecture Notes in Computer Science, 1906 .  Springer, pp. 66-80.  ISBN 3-540-41020-1      (2000)