Intermediate Representations of Mobile Code.

Informatica (Impact Factor: 1.12). 04/2008; 32(1):1-25.
Source: DBLP


Over the past decade, since Java was first introduced and integrated into the Netscape web browser, several intermediate representations have been developed that might be potentially used for mobile code applications. This paper examines the requirements for a mobile code representation, presents several examples of stack-based, tree-oriented, and proof-annotating mobile code representations, and evaluates each of these representations according to the requirements.

Download full-text


Available from: Wolfram Amme
  • Source
    • "Figure 1 gives a structural overview of the complete system . The system has two sides inspired by Amme et al. [22] "

    Full-text · Dataset · Apr 2015
  • Source
    • "Specific deadlocks can be prevented using the SPDM model which can also be used to achieve probabilistic data races and specific program optimizations [5], [6]. Static single assignment (SSA) [7], [8] is a program representation form facilitating program analysis. SSA forms are important for software re-engineering and compiler construction. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Static alias analysis of different type of programming languages has been drawing researcher attention. However most of the results of existing techniques for alias analysis are not precise enough compared to needs of modern compilers. Probabilistic versions of these results, in which result elements are associated with occurrence probabilities, are required in optimizations techniques of modern compilers. This paper presents a new probabilistic approach for alias analysis of parallel programs. The treated parallelism model is that of SPMD where in SPMD, a program is executed using a fixed number of program threads running on distributed machines on different data. The analyzed programs are assumed to be in the static single assignment (SSA) form which is a program representation form facilitating program analysis. The proposed technique has the form of simply-strictured system of inference rules. This enables using the system in applications like Proof-Carrying Code (PPC) which is a general technique for proving the safety characteristics of modern programs.
    Preview · Article · May 2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Business process management (BPM) and service-oriented architectures (SOA) promise the development, application, maintenance, and improvement of business processes, i.e., service compositions, as it is done in software engineering. However, BPM is currently more similar to an unfinished patchwork and an overall system supporting BPM is missing since it requires a unified execution engine (a virtual machine), a common intermediate representation, and eventually a compiler. In this paper, we motivate the construction of such a system for BPM and propose an approach including the mentioned sub systems. Additionally, we show the gaps in current approaches and why some techniques are not yet fully applicable. We encourage that system with state-of-the-art approaches and our own ideas of BPM, compiler construction, and artificial intelligence. Such a system finally will encourage processes for small and medium-sized enterprises and for SOA applications.
    Full-text · Conference Paper · Jan 2015
Show more