Mobile UNITY Research Articles

Formal Specification for Implementing Atomic Read/Write Shared Memory in Mobile Ad Hoc Networks Using the Mobile Unity

Formal Specification for Implementing Atomic Read/Write Shared Memory in Mobile Ad Hoc Networks Using the Mobile Unity

Formal Specification for Implementing Atomic Read/Write Shared Memory in Mobile Ad Hoc Networks Using the Mobile Unity

The Geoquorum approach for implementing atomic read/write shaved memory in mobile ad hoc networks. This 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 of this paper is based on well understood techniques in specification refinement, but the methodology is tailored to mobile applications and help designers address novel concerns such as logical mobility, the invocations, specific conditions constructs. The proof logic and programming notation of mobile UNITY provide the intellectual tools required to carryout this task. Also, the quorum systems are investigated in highly mobile networks in order to reduce the communication cost associated with each distributed operation.

IMPLEMENTASI PERATURAN KAPOLRI NOMOR 17 TAHUN 2007 TENTANG TATA KEARSIPAN PADA KANTOR SATUAN BRIGADE MOBILE POLISI DAERAH SUMATERA SELATAN DALAM MENINGKATKAN KINERJA KEANGGOTAAN (STUDI KASUS PADA DETASEMEN A PELOPOR)

The study of the research was the implementation decision of Kapolri No 17, 2007 about the administration of Brigade Mobile unity office, SUMSEL. Increasing the performance of the participant (study case on Detasemen A Pelopor). The aim of the study was knowing and analyzing the case, which related to the implementation the role of Kapolri No 17 ,2007 about the administration of Brigade Mobile Unity. The method was using qualitative approach. The object of the implementation was using communication resource, disposisi, and structure of birokrasi. The process of collecting the data was using by observation, interview and documentation. Analyzing the data was doing by analyze which collected from sistematik data, regular and structured. In this study, there are relation both implementation kapolri no 17, 2007 and filing officer/administration. Limited human resources, infrastructure as a supporting implementation of the administration quality and quantity in a pelopor areaKeywords : implementation, decision Kapolri No 17,2007

Modeling decoupled mobile cloud computing using Mobile UNITY

SummaryA mobile cloud computing paradigm supports different resource‐intensive mobile applications by leasing various mobile cloud services, thus helping these applications to overcome the inherent shortcomings of mobile ∕ portable devices of end users. However, mobile cloud services in existing architectures become tightly coupled with mobile applications during servicing, which is highly undesirable because of the dynamic nature of the mobile cloud computing paradigm. A new mobile cloud architecture, where the interactions between mobile applications and mobile cloud services are decoupled during service invocation and delivery phases, is proposed in this paper. The tuple space model is used in this architecture to decouple such interactions, thereby improving adaptability and robustness of mobile cloud computing. This paper also suggests an approach of modeling and formally verifying the correctness of the proposed architecture, which also validates its adaptability and robustness during interactions between mobile applications and mobile cloud services. The modeling and verification are carried out using the Mobile UNITY model. Copyright © 2014 John Wiley & Sons, Ltd.

A practical approach to specifying and verifying mobile agent algorithms

Mobile agent, as a new mobile computing technology, has been applied to various parallel and distributed computing problem solutions. Several mobile agent systems have been built to drive the agents following a platform dependant scheme, and some formal approaches have been proposed to describe mobile agents’ behaviors or properties for respective purposes. However, there remains a lack of a standard approach to describing a mobile agent algorithm and its semantics from the viewpoint of a practical program, which makes it difficult to specify an algorithm unambiguously and verify its correctness formally. This paper proposes a practical approach to overcome that difficulty by defining a script language and associated mechanisms to specify and verify mobile agent algorithms. The language, called SMAL, can describe mobile agent’s behaviors clearly due to its explicitly defined semantics. Based on the semantics, a transformation function for converting the specified algorithm to its equivalent specification in Mobile UNITY, a well‐known mobile computation formal approach for correctness verification, is presented. Formal verification of the algorithms can be accomplished based on the UNITY‐logic rules.

A principled exploration of coordination models

Coordination is a style of interaction in which information exchange among independent system components is accomplished by means of high-level constructs designed to enhance the degree of decoupling among participants. A decoupled mode of computation is particularly important in the design of mobile systems which emerge dynamically through the composition of independently developed components meeting under unpredictable circumstances and thrust into achieving purposeful cooperative behaviors. This paper examines a range of coordination models tailored for use in mobile computing and shows that the constructs they provide are reducible to simple schema definitions in Mobile UNITY. Intellectually, this exercise contributes to achieving a better operational-level understanding of the relation among several important classes of models of mobility. Pragmatically, this work demonstrates the immediate applicability of Mobile UNITY to the formal specification of coordination constructs supporting mobile computing. Moreover, the resulting schemas are shown to be helpful in reducing the complexity of the formal verification effort.

Reasoning About Context-Awareness in the Presence of Mobility

Context-awareness is emerging as an important computing paradigm designed to address the special needs of applications that must accommodate or exploit the highly dynamic environments that occur in the presence of physical or logical mobility. A number of formal models are available for reasoning about concurrency. Models designed to capture the specifics of mobility are fewer but still well represented (e.g., Mobile Ambients, π-Calculus, and Mobile UNITY). These models do not, however, provide constructs necessary for explicit modeling of context-aware interactions. This paper builds upon earlier efforts on state-based formal reasoning about mobility and explores the process by which a model such as Mobile UNITY can be transformed to explicitly capture context- awareness. Starting with an examination of the essential features of context-aware systems, this paper explores a range of constructs designed to facilitate a highly decoupled style of programming among context-aware components. The result of this exploration is a model called Context UNITY.

CODEWEAVE: Exploring Fine-Grained Mobility of Code

This paper is concerned with an abstract exploration of code mobility constructs designed for use in settings where the level of granularity associated with the mobile units exhibits significant variability. Units of mobility that are both finer and coarser grained than the unit of execution are examined. To accomplish this, we take the extreme view that every line of code and every variable declaration are potentially mobile, i.e., it may be duplicated or moved from one program context to another on the same host or across the network. We also assume that complex code assemblies may move with equal ease. The result is CODEWEAVE, a model that shows how to develop new forms of code mobility, assign them precise meaning, and facilitate formal verification of programs employing them. The design of CODEWEAVE relies greatly on Mobile UNITY, a notation and proof logic for mobile computing. Mobile UNITY offers a computational milieu for examining a wide range of constructs and semantic alternatives in a clean abstract setting, i.e., unconstrained by compilation and performance considerations traditionally associated with programming language design. Ultimately, the notation offered by CODEWEAVE is given exact semantic definition by means of a direct mapping to the underlying Mobile UNITY model. The abstract and formal treatment of code mobility offered by CODEWEAVE establishes a technical foundation for examining competing proposals and for subsequent integration of some of the mobility constructs both at the language level and within middleware for mobility.

Reasoning about code mobility with mobile UNITY

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.

A fine-grained model for code mobility

In this paper we take the extreme view that every line of code is potentially mobile, i.e., may be duplicated and/or moved from one program context to another on the same host or across the network. Our motivation is to gain a better understanding of the range of constructs and issues facing the designer of a mobile code system, in a setting that is abstract and unconstrained by compilation and performance considerations traditionally associated with programming language design. Incidental to our study is an evaluation of the expressive power of Mobile UNITY, a notation and proof logic for mobile computing.

Modeling mobile IP in mobile UNITY

With recent advances in wireless communication technology, mobile computing is an increasingly important area of research. A mobile system is one where independently executing components may migrate through some space during the course of the computation, and where the pattern of connectivity among the components changes as they move in and out of proximity. Mobile UNITY is a notation and proof logic for specifying and reasoning about mobile systems. In this article 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. The packet-fowarding mechanism at the core of the Mobile IP protocol for routing to mobile hosts is taken as an example. A Mobile UNITY model of packet forwarding and the mobile system in which it must operate is developed. Proofs of correctness properties, including important real-time properties, are outlined, and the role of formal verification in the development of protocols such as Mobile IP is discussed.

Connectors for mobile programs

Software architecture has put forward the concept of connector to express complex relationships between system components, thus facilitating the separation of coordination from computation. This separation is especially important in mobile computing due to the dynamic nature of the interactions among participating processes. We present connector patterns, inspired in Mobile UNITY, that describe three basic kinds of transient interactions: action inhibition, action synchronization, and message passing. The connectors are given in COMMUNITY, a UNITY-like program design language which has a semantics in category theory. We show how the categorical framework can be used for applying the proposed connectors to specific components and how the resulting architecture can be visualized by a diagram showing the components and the connectors.

Expressing code mobility in mobile UNITY

Expressing code mobility in mobile UNITY