Distributed Data and Programs Slicing.

摘要: This paper presents a new technique for data slicing of distributed programs running on hierarchy machines. Data can be realized as program transformation that partitions heaps machines in into independent regions. Inside each region machine, pointers preserve the original pointer structures heap hierarchy. Each component base type (e.g., integer type) goes only to one heaps. The proposed has shape system inference rules. In addition, this simply structure decide soundness programs. Using system, mathematical proof preserves typing properties is outlined well.