共 50 条
Coordination in the ImpUNITY framework
被引:3
|作者:
Goeman, HJM
Kok, JN
Sere, K
Udink, RT
机构:
[1] Leiden Univ, Dept Comp Sci, NL-2300 RA Leiden, Netherlands
[2] Abo Akad Univ, Dept Comp Sci, FIN-20520 Turku, Finland
[3] Univ Utrecht, Dept Comp Sci, NL-3508 TB Utrecht, Netherlands
关键词:
coordination languages;
program specifications;
refinement calculus;
program transformations;
UNITY;
D O I:
10.1016/S0167-6423(97)00025-7
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
Our main interest in this paper is to investigate how we can combine different systems and languages via a shared tuple space. The languages themselves can be for example standard imperative languages. Hence we study a framework, in which we can have both the possibility for communication via a shared tuple space, and more standard imperative programming constructs. The ImpUNITY framework is an extension of the UNITY framework. It contains several program structuring mechanisms and puts special emphasis on compositional refinement of both specifications and programs. It has an associated temporal logic, formal refinement notions, and program transformation rules. In this paper we extend this framework further: we show how coordination in the farm of a shared tuple space between communicating ImpUNITY programs is modelled and used during formal program specification and refinement. We exemplify our formalism by a larger case study on a phone system where communication in the system is partly taken care of via a tuple space. Additionally, we bring structure in the tuple space and the state spaces of the local programs, by allowing parts of them to be hidden and making it possible to restrict the access rights of different components to the tuple space. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:313 / 334
页数:22
相关论文