ACM Transactions on Programming Languages and Systems (TOPLAS)
The Formal Specification and Design of a Distributed Electronic Funds-Transfer System
IEEE Transactions on Computers
Parallel program design: a foundation
Parallel program design: a foundation
Acta Informatica
An exercise in the formal derivation of parallel programs: maximum flows in graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stepwise refinement of parallel algorithms
Science of Computer Programming
Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency
IEEE Transactions on Software Engineering
A calculational derivation of the CASOP algorithm
Information Processing Letters
A derivation of a serial-parallel multiplier
Science of Computer Programming
Proceedings of the 21st international conference on Software engineering
Modeling mobile IP in mobile UNITY
ACM Transactions on Software Engineering and Methodology (TOSEM)
Software engineering for mobility: a roadmap
Proceedings of the Conference on The Future of Software Engineering
Reasoning about code mobility with mobile UNITY
ACM Transactions on Software Engineering and Methodology (TOSEM)
The Science of Programming
A Discipline of Programming
A Method of Programming
A UNITY-Style Programming Logic for Shared Dataspace Programs
IEEE Transactions on Parallel and Distributed Systems
Formal Derivation of Rule-Based Programs
IEEE Transactions on Software Engineering
Architecture-Directed Refinement
IEEE Transactions on Software Engineering
Compositional Programming Abstractions for Mobile Computing
IEEE Transactions on Software Engineering
Reasoning About Synchronic Groups
Research Directions in High-Level Parallel Programming Languages
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Policy-based Coordination in PAGODA: A Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Termination detection, a classical problem in distributed computing, is revisited in the new setting provided by the emerging mobile computing technology. A simple solution tailored for use in ad hoc networks is employed as a vehicle for demonstrating the applicability of formal requirements and design strategies to the new field of mobile computing. The approach is based on well understood techniques in specification refinement, but the methodology is tailored to mobile applications and helps designers address novel concerns such as the mobility of hosts, transient interactions, and specific coordination constructs. The proof logic and programming notation of Mobile UNITY provide the intellectual tools required to carry out this task.