Compositional Programming Abstractions for Mobile Computing

@article{McCann1998CompositionalPA,
  title={Compositional Programming Abstractions for Mobile Computing},
  author={Peter J. McCann and Gruia-Catalin Roman},
  journal={IEEE Trans. Software Eng.},
  year={1998},
  volume={24},
  pages={97-110}
}
Recent advances in wireless networking technology and the increasing demand for ubiquitous, mobile connectivity demonstrate the importance of providing reliable systems for managing the reconfiguration and disconnection of components. The 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… Expand
Enabling the rapid development of dependable applications in the mobile environment
TLDR
The goal of this thesis is to develop an environment that will facilitate rapid development of dependable mobile applications executing in both physical and logical mobile environments and to present two design strategies to achieve this goal. Expand
A Notation and Logic for Mobile Computing
TLDR
The goal is to find a minimalist model of mobile computation that will allow us to express mobile components in a modular fashion and to reason formally about the possible behaviors of a system composed from mobile components. Expand
Formal Specification and Design of Mobile Systems
TLDR
Termination detection, a classical problem in distributed computing, is revisited in the new setting provided by the emerging mobile computing technology and the proof logic and programming notation of Mobile UNITY provide the intellectual tools required to carry out this task. Expand
Modeling mobile IP in mobile UNITY
TLDR
It is argued that Mobile UNITY contributes to the modular development of system specifications because of the declarative fashion in which coordination among components is specified. Expand
Reasoning about code mobility with mobile UNITY
TLDR
This paper seeks to uncover a common foundation for the two paradigms by exploring the manner in which stereotypical forms of code mobility can be expressed in a programming notation developed for mobile computing. Expand
Nomadic Pict: language and infrastructure design for mobile computation
TLDR
An agent programming language is introduced – Nomadic Pict – designed to allow infrastructure algorithms to be expressed clearly, as translations from a high-level language to a lower level, based on rigorously-defined process calculi, which provide sharp levels of abstraction. Expand
Reasoning About Code Mobility with Mobile UnityGian
Advancements in network technology have led to the emergence of new computing paradigms that challenge established programming practices by employing weak forms of consistency and dynamic forms ofExpand
Developing Mobile Applications : A L IME Primer
Mobility poses peculiar challenges that must be addressed by novel programming constructs. LIME (Linda in a Mobile Environment) tackles the problem by adopting a coordination perspective inspired byExpand
Investigating communicating sequential processes for Java to support ubiquitous computing
TLDR
A generalisation of the architecture has been made that should provide greater suitability of the ideas behind JCSP Networking to support Ubiquitous Computing, and has resulted in the creation of a verified communication protocol that can be applied to any Communicating Process Architecture. Expand
An Algebraic Framework for Modeling of Mobile Systems
TLDR
Based on hidden algebra, the components of a mobile system are specified as behavioral objects or Observational Transition Systems, a kind of transition system, enriched with special action and observation operators related to the distinct characteristics of mobile computing systems. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
Mobile UNITY: reasoning and specification in mobile computing
TLDR
This article considers the nature of the underlying formal models that will enable us to specify and reason about mobile computations, and employs the methods of UNITY, a highly modular extension of the UNITY programming notation. Expand
Mobile UNITY Coordination Constructs Applied to Packet Forwarding for Mobile Hosts
TLDR
It is argued that Mobile UNITY contributes to the modular development of system specifications precisely because of the decoupled and declarative fashion in which coordination among components is specified. Expand
ACTORS - a model of concurrent computation in distributed systems
  • G. Agha
  • Computer Science
  • MIT Press series in artificial intelligence
  • 1990
TLDR
A foundational model of concurrency is developed and issues in the design of parallel systems and why the actor model is suitable for exploiting large-scale parallelism are addressed. Expand
Distributed Processes and Location Failures (Extended Abstract)
TLDR
A process calculus in which processes are run at distributed locations is defined, which provides operators to kill locations, to test the status (dead or alive) of locations, and to spawn processes at remote locations, based on an operational semantics that uses configurations to record the status of locations. Expand
Foundations of Actor Semantics
The actor message-passing model of concurrent computation has inspired new ideas in the areas of knowledge-based systems, programming languages and their semantics, and computer systems architecture.Expand
A calculus of mobile processes, II
TLDR
The a-calculus is presented, a calculus of communicating systems in which one can naturally express processes which have changing structure, including the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions. Expand
Managing update conflicts in Bayou, a weakly connected replicated storage system
TLDR
The motivation for and design of these mechanisms for conflict detection and per -write conflict resolution based on client-provid ed procedures are presented and the experiences gained with an initial implementation of the system are described. Expand
An Asynchronous Model of Locality, Failurem and Process Mobility
We present a model of distributed computation which is based on a fragment of the π-calculus relying on asynchronous communication. We enrich the model with the following features: the explicitExpand
Formal Derivation of Concurrent Programs: An Example from Industry
TLDR
The formal derivation of an implementation of the I/O (input/output) subsystem portion of an existing operating system is presented and illustrates a number of techniques for organizing large specifications and proofs. Expand
On the minimal synchronism needed for distributed consensus
TLDR
The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others, and several critical system parameters, including various synchronicity conditions, are identified. Expand
...
1
2
3
4
...