TY  - CHAP
SN  - 3-540-62503-8
Y1  - 1997///
M1  - 1192
N2  - 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.
ED  - Dam, Mads
PB  - Springer
EP  - 344
A1  - De Nicola, Rocco
A1  - Pugliese, Rosario
T2  - Analysis and Verification of Multiple-Agent Languages (LOMAPS 1996)
T3  - Lecture Notes in Computer Science
SP  - 320
ID  - eprints358
TI  - Testing Semantics of Asynchronous Distributed Programs
AV  - none
UR  - http://dx.doi.org/10.1007/3-540-62503-8_15
ER  -