Issue No. 02 - February (1998 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.666824
<p><b>Abstract</b>—Recent advances in wireless networking technology and the increasing demand for ubiquitous, mobile connectivity demonstrate the importance of providing reliable systems for managing reconfiguration and disconnection of components. Design of such systems requires tools and techniques appropriate to the task. Many formal models of computation, including UNITY, are not adequate for expressing reconfiguration and disconnection and are, therefore, inappropriate vehicles for investigating the impact of mobility on the construction of modular and composable systems. Algebraic formalisms such as the π-calculus have been proposed for modeling mobility. This paper addresses the question of whether UNITY, a state-based formalism with a foundation in temporal logic, can be extended to address concurrent, mobile systems. In the process, we examine some new abstractions for communication among mobile components that express reconfiguration and disconnection and which can be composed in a modular fashion.</p>
Formal methods, mobile computing, Mobile UNITY, weak consistency, shared variables, synchronization, transient interactions.
Peter J. McCann, Gruia-Catalin Roman, "Compositional Programming Abstractions for Mobile Computing", IEEE Transactions on Software Engineering, vol. 24, no. , pp. 97-110, February 1998, doi:10.1109/32.666824