Distributed Data and Programs Slicing
This addresses the challenge of managing data in distributed systems for developers, though it appears incremental as it builds on existing slicing concepts.
The paper tackles the problem of data slicing for distributed programs running on hierarchical machines by presenting a program transformation technique that partitions heaps into independent regions while preserving pointer structures. It includes a type system to ensure type soundness and provides a proof that the slicing preserves typing properties.
This paper presents a new technique for data slicing of distributed programs running on a hierarchy of machines. Data slicing can be realized as a program transformation that partitions heaps of machines in a hierarchy into independent regions. Inside each region of each machine, pointers preserve the original pointer structures in the original heap hierarchy. Each heap component of the base type (e.g., the integer type) goes only to a region of one of the heaps. The proposed technique has the shape of a system of inference rules. In addition, this paper presents a simply structure type system to decide type soundness of distributed programs. Using this type system, a mathematical proof that the proposed slicing technique preserves typing properties is outlined in this paper as well.