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 ty...

We present an adaptive slicing scheme for reducing manufacturing time of 3D printing system. Based on a new saliency based metric, our method optimizes the thicknesses of slicing layers to save the printing time and preserve the visual quality of printing results. We formulate the problem as a constrained `0 optimization and compute the slicing result via a two-step optimization scheme. To furt...

Program slicing is a reduction technique that removes irrelevant parts of a program automatically, based on dependencies. It is used in the context of documentation to improve the user’s understanding as well as for reducing the size of a program when analysing. In this paper we describe an approach for slicing not program code but models of software or systems written in the graphical Behavior...

Program slicing is an automatic technique for determining which code in a program is relevant to a particular computation. Slicing has been applied in many areas, including program understanding, debugging, and maintenance. However, little attention has been paid to suitable interfaces for exploring program slices. We present an interface for program slicing that allows slicing at the statement...

One approach to reverse engineering is to partially automate sub component extraction, improvement and subsequent recombination. Two previously proposed automated techniques for supp orting this activity are slicing and concept assignment. However, neither is directly applicable in isolation; slicing criteria (sets of program variables) are simply too low level in many cases, while conc eptassi...

We present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours through a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplifi...

Image segmentation is the basis for computer vision and object recognition. Watershed transform is one of the common methods used for region based segmentation. The previous watershed methods results in over segmentation. In this paper we present a novel method for efficient image segmentation by using bit-plane slicing and markercontrolled watershed. Bit-Plane slicing method produces the slice...

Different program slicing methods are used for maintenance, reverse engineering, testing and debugging. Slicing algorithms can be classified as static slicing and dynamic slicing methods. In several applications the computation of dynamic slices is more preferable since it can produce more precise results. In this paper we introduce a new forward global method for computing backward dynamic sli...

We define a safety slice as a subnet of a marked Petri net Σ that approximates Σ’s temporal behavior with respect to a set of interesting places Crit. This safety slice can be used to verify and falsify stutter-invariant linear-time safety properties when Crit is the set of places referred to by the safety property. By construction it is guaranteed that the safety slice’s state space is at most...

We describe an algorithm for slicing an unstructured triangular mesh model by a series of parallel planes. We prove that the algorithm is asymptotically optimal: its time complexity is O(n log k+k+m) for irregularly spaced slicing planes, where n is the number of triangles, k is the number of slicing planes, andm is the number of triangle-plane intersections segments. The time complexity reduce...