%0 Book Section
%A De Nicola, Rocco
%A Pugliese, Rosario
%B Analysis and Verification of Multiple-Agent Languages (LOMAPS 1996)
%D 1997
%E Dam, Mads
%F eprints:358
%I Springer
%P 320-344
%S Lecture Notes in Computer Science
%T Testing Semantics of Asynchronous Distributed Programs
%U http://eprints.imtlucca.it/358/
%V 1192
%X 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.