Reasoning about code mobility with mobile UNITY

  • Authors:

  • Gian Pietro Picco;Gruia-Catalin Roman;Peter J. McCann

  • Affiliations:

  • Politecnico di Milano, Milan, Italy;Washington Univ. in Saint Louis, St. Louis, MO;Lucent Technologies, Naperville, IL

  • Venue:
  • ACM Transactions on Software Engineering and Methodology (TOSEM)
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 of binding. Code mobility, for instance, allows for invocation-time binding between a code fragment and the location where it executes. Similarly, mobile computing allows hosts (and the software they execute) to alter their physical location. Despite apparent similarities, the two paradigms are distinct in their treatment of location and movement. 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. Several solutions to a distributed simulation problem are used to illustrate the modeling strategy and the ability to construct assertional-style proofs for programs that employ code mobility.