Ryoichi Ueda

Proposal and Evaluation of Policy Description for Information Lifecycle Management

Information lifecycle management (ILM) is attracting more attention as the costs of data retention and security and of regulatory compliance requirements are being increased by the explosive growth of information being handled and by increasingly stringent government regulations. The goal of ILM is to ensure that information is stored on the most appropriate medium providing the service level required at the phase of the informations lifecycle. This paper describes a method for describing and interpreting ILM policies in a way that information managers find easy to understand and that can be used to automate the ILM process

An algorithm for computing slices for recursive program

Program slicing is a useful technique for debugging, testing and program integration. Intuitively, by the slice of a program P is meant, for a point n and a variable v in P, the set of statements and expressions in P that affect the value of v at n. To determine a slice, there must be a precise analysis of the dependencies among the statements in the program. It is difficult, on the other hand, to analyze the program containing recursions. This paper presents a static analysis for the dependencies in the program containing recursion, as well as the algorithm to determine the slice based on the result of the analysis. To cope with the recursive definition of the procedure, the proposed algorithm assumes the interprocedure information needed in the computation. This information is modified to the correct direction, and the process is iterated until the result converges. The program dependence graph is extended to hold the interprocedure information. Compared to the conventional algorithm, the proposed algorithm can analyze efficiently the program containing recursions, and can be used in the system to provide interactively the slice information.