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)Full text not available from this repository.
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.
|Item Type:||Book Section|
|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|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||13 Jun 2011 13:56|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)