Rocco De Nicola1, Rosario Pugliese2
1 Dipartimento di Sistemi e Informatica, Universita' di Firenze
2 Dipartimento di Scienze dell'Informazione, Universita' di Roma ``La Sapienza''
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.