Assertional reasoning about pairwise transient interactions in mobile computing

  • Authors:

  • Gruia-Catalin Roman;Peter J. McCann;Jerome Y. Plun

  • Affiliations:

  • Department of Computer Science, Washington University, St. Louis, MO;Department of Computer Science, Washington University, St. Louis, MO;Department of Computer Science, Washington University, St. Louis, MO

  • Venue:
  • Proceedings of the 18th international conference on Software engineering
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns of the individual components present designers with unprecedented challenges in the areas of modularity and dependability. The paper describes two ideas regarding a modular approach to specifying and reasoning about mobile computing. The novelty of our approach rests with the notion of allowing transient interactions among programs which move in space. We restrict our concern to pairwise interactions involving variable sharing and action synchronization. The motivation behind the transient nature of the interactions comes from the fact that components can communicate with each other only when they are within a certain range. The notation we propose is meant to simplify the writing of mobile applications and is a direct extension of that used in UNITY. Reasoning about mobile computations relies on the UNITY proof logic.