Static analyses, as points-to analysis, are useful to determine and assure different properties about a program, such as security or type safety. While existing analyses are effective in programs restricted to static features, precision declines in the presence of dynamic language features, and even further when the system behavior changes dynamically. As a consequence, improved points-to sets algorithms taking into account such language features and uses are required. In this paper, we present and extension of the point-to sets analysis to incorporate the language abstractions introduced by context-oriented programming adding the capability for programs to adapt their behavior dynamically to the system’s execution context. To do this, we extend WALA to detect the context-oriented language abstractions, and their representation within the system, to capture the dynamic behavior, in the particular case of the Context Traits JavaScript language extension. To prove the effectiveness of our extension, we evaluate the precision of the points-to set analysis with respect to the state of the art, over a set of context-oriented programs taken from the literature.

This paper proposes a mechanism that enables to the inspection of payloads in a packet inside software defined network switch called PRS, and presents a prototype implementation that combines a sequence of payloads decomposed by TCP segmentation and also IP fragmentation. Introducing Software Defined Network (SDN) facilitates network management in which network topologies will be free from physical connections among network switches. Since switches in SDN can only refer to fields of layer 2-4 in TCP/IP network, a controller that controls switches cannot use the payload, which is higher-layer information over layer 5 in TCP/IP network, for routing, preventing developing applications such as layer 7 switch and/or load balancers.In this paper, we will overcome this limitation, then make it possible to control networks using payloads. To address this issue, we propose the entire architecture of PRS, then show the performance of the essential prototype implementation that combines a sequence of payloads by conducting experiments.

Molecule loss is a critical reliability issue in diffusive molecular communications. This paper proposes a communica- tion framework that allows biologically-enabled machines (bio- nanomachines) to transmit and receive information-carrying molecules (information molecules) in a robust manner against molecule losses. The proposed framework, called molecular fountain, employs deoxyribonucleic-acid (DNA) molecules as information carriers and leverages molecular fragmentation (i.e., packetization) between transmitter (Tx) and receiver (Rx) bio-nanomachines. It performs feedback-aided rateless erasure coding that considers biochemical constraints in DNA synthesis and sequencing to generate molecular packets. The Tx bio- nanomachine repeatedly generates molecular packets with Luby transform codes and transmits them to the Rx bio- nanomachine until it receives an acknowledgment from the Rx bio-nanomachine. The Rx bio-nanomachine can reconstruct lost molecular packets from other packets that have been successfully transmitted. Simulation results show that molecular fountain enhances robustness against molecular packet losses and in turn improves communication performance such as transmission latency, jitter, error rate, and coding overhead.

A Wireless Sensor Network (WSN) is typically deployed on a place in which no electric source is provided, meaning that its battery consumption is crucial. Applications for WSNs require implementations of complex operations like network administration. To simplify the development of these applications, several mobile agent middle wares have been proposed (e.g., Agilla). Applications for these middle wares are executed by communications among agents, therefore, a common operation is to look up agents. Because existing proposals do not have much technical support for efficient approach to look up agents, every lookup consumes a significant amount of battery energy and time. In addition, current approaches can fail their lookup operations if the target agent moves during a lookup operation. This paper proposes CMSN, an efficient and effective lookup for mobile agent middle wares using distributed hash table. We evaluate and compare CMSN in terms of effective lookups and battery consumption.

The Web is one of the useful references for developers to find pieces of code that represent what they need nowadays. In addition, we can find websites that contain not only source code but also detailed explanations of the code. In these websites, explanations are usually located above/-below code, thereby users, who refer to these explanations, sometimes need to scroll a (browser) window to understand pieces of code reading the corresponding explanations. As a consequence, users have to temporarily memorize code and/or the corresponding expositions, wasting extra time. On the other hand, it is common to use wiki to edit a set of code and corresponding explanations. In most wiki systems, they prepare only one window to edit code and its explanations, therefore editors usually need to scroll the window to complete editing, also consuming extra time.

Asynchronous programming has been widely adopted in domains such as Web development. This programming style usually uses callback methods, non-blocking operations, allowing high responsive user interactions even if an application works without multi-threading. However, this style requires the uncoupling of a module into two sub-modules at least, which are not intuitively connected by a callback method. The separation of modules spurs the birth of other issues: callback spaghetti and callback hell. This paper proposes a virtual block approach to address the previous two issues. This approach enables a programmer to virtually block a program execution and restart it at arbitrary points in the program. As a result, programmers do not need to uncouple a module even if non-blocking operations are adopted; therefore, callback dependencies disappear. Using aspect-oriented programming, this approach uses aspects to control the execution of a program in an oblivious manner. As a consequence, programmers do not need to be concerned whether pieces of code use blocking or non-blocking operations. We implement a proof-of-concept for this approach, called SyncAS, for ActionScript3. In addition, we apply our proposal to a toy application and conduct experiments to show its modular application, flexibility, and performance.

Rich Internet Application (RIA) has been proposed in order to solve the problems of current web applications. The user experience of current web applications is not comparable to desktop applications. RIA provides sophisticated interfaces for representing complex processes and data. Therefore, it requires collaboration between designers who design the interface and animation of an application and developers who implement business logics. In the development process of an application, the change of design is usually happened and it requires not only designer's work but also developer's work.Therefore, it costs a lot in large scaled applications. This paper provides a system which can provide complete separation of designer's and developer's work in source code level in order to reduce development costs for RIAs. In addition, we introduce this system into a practical system and evaluate its utility.