De Nicola, Rocco and Pugliese, Rosario A Process Algebra Based on LINDA. In: Coordination Languages and Models (COORDINATION 1996). Lecture Notes in Computer Science, 1061 . Springer, pp. 160-178. ISBN 3-540-61052-9 (1996)Full text not available from this repository.
The problem of comparing and analyzing the relationships between distributed programs written in the same concurrent programming language is addressed. It arises each time one wants to establish program correctness with respect to a notion of "being an approximation of". We define a testing scenario for PAL, a process algebra which is obtained by embedding the Linda primitives for interprocess communication in a CSP like process description language. We present a proof system for PAL processes which is sound and complete with respect to the behavioural relation and illustrate how it works by giving a small example.
|Item Type:||Book Section|
|Funders:||Work partially supported by EEC within the HCM Project EXPRESS, and by CNR within the project "Specifica ad Alto Livello e Verifica di Sistemi Digitali".|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||14 Jun 2011 10:53|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)