Formalising Java RMI with explicit code mobility

Abstract

This paper presents a Java-like core language with primitives for object-oriented distribution and explicit code mobility. We apply our formulation to prove the correctness of several optimisations for distributed programs. Our language captures crucial but often hidden aspects of distributed object-oriented programming, including object serialisation, dynamic class downloading and remote method invocation. It is defined in terms of an operational semantics that concisely models the behaviour of distributed programs using machinery from calculi of mobile processes. Type safety is established using invariant properties for distributed runtime configurations. We argue that primitives for explicit code mobility offer a programmer fine-grained control of type-safe code distribution, which is crucial for improving the performance and safety of distributed object-oriented applications.

Design of Distributed Architecture Based on Java Remote Method Invocation Technology

“…The API of JavaBeans provides a standard format for the java class, the user needn't direct the preparation of any code and can manipulate these categories, as well as model Ⅰ (JSP+ JavaBeans) and model Ⅱ(JSP+ Servlets+ JavaBeans) [8].…”

Semantics of (Resilient) X10

“…We extend that work to handle exceptions (necessary for the formalization of resilience), and place-shifting at, and formally treat resilience. [1] presents a semantics for Java with remote method invocation; hence they also deal with multiple places and communication across places. In particular they formalize a relational definition of copying an object graph, although they do not formalize or mechanize an implementation of this specification.…”

Timed, Distributed, Probabilistic, Typed Processes

“…This intuition is formalised as follows: let A be an action type and l an action. The predicate A l is defined if (1) We note that Theorems 3 and 4 also hold for the typed bisimilarity.…”

“…In addition, the linear type discipline has the capability to model DS with failures and timers where applications written in typed high-level languages run inside distributed locations, without losing expressivity and usability. For example it can be extended to type-based programming analyses such as secure information flow [19,21], it embeds various higher-order programming languages fully abstractly [6,19,32] and models distributed Java [1] and web services [8]. The main contribution of this paper is to show that the linear type discipline generalises smoothly to distributed computation: no new types have to be invented and all existing typing rules stay unchanged.…”