eprintid: 358
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/58
datestamp: 2011-06-13 13:56:57
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-13 13:56:57
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Pugliese, Rosario
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Testing Semantics of Asynchronous Distributed Programs
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: The algebraic approach to concurrency is tuned for modelling operational semantics and supporting formal verification of distributed imperative programs with asynchronous communications. We consider an imperative process algebra, IPAL, which is obtained by embedding the Linda primitives for interprocess communication in a CSP-like process description language enriched with a construct for assignment. We setup a testing scenario and present a proof system for IPAL which is sound and complete with respect to the induced behavioural relations.
date: 1997
date_type: published
series: Lecture Notes in Computer Science
volume: 1192
publisher: Springer
pagerange: 320-344
id_number: 10.1007/3-540-62503-8_15
refereed: TRUE
isbn: 3-540-62503-8
book_title: Analysis and Verification of Multiple-Agent Languages (LOMAPS 1996)
editors_name: Dam, Mads
official_url: http://dx.doi.org/10.1007/3-540-62503-8_15
funders: This work has been partially supported by EEC within the HCM Project EXPRESS, by CNR within Progetto Coordinato Comitato 12 "Metodologie e strumenti di analisi, verifica e validazione per sistemi software affidabili", and by Istituto di Elaborazio
citation:   De Nicola, Rocco and Pugliese, Rosario  Testing Semantics of Asynchronous Distributed Programs.   In:  Analysis and Verification of Multiple-Agent Languages (LOMAPS 1996).   Lecture Notes in Computer Science, 1192 .  Springer, pp. 320-344.  ISBN 3-540-62503-8      (1997)