In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent regions. Pointers within each region mirror the structure of pointers in the original heap; however, each field whose type is a base type (e.g., the integer type) appears in only one of these regions. In addition, we d...

Program slicing is a technique for statically analyzing a program and extracting an executable sub-program, which is called a program slice, from the original program. This technique has been widely applied to program testing, debugging and maintenance. This paper presents a slicing method for extracting program slices from a program that calls library functions, which are provided as object co...

Program slicing consists of deleting statements from a program , creating a reduced program, a slice, that preserves the original program's behaviour for a given set of variables at a chosen point in the program. However, some aspects of a program's semantics are not captured by a set of variables, rendering slicing inapplica-ble to their analysis. These aspects of the program's state shall, co...

Programming languages designed specifically for multi-agent systems represent a new programming paradigm that has gained popularity over recent years, with some multi-agent programming languages being used in increasingly sophisticated applications, often in critical areas. To support this, we have developed a set of tools to allow the use of model-checking techniques in the verification of sys...

– Instead of defining both Ctl formulas and least fixed point computation algorithms, program slicing can be described as a μ-calculus formula [11] only. This greatly simplifies the definition of existing classes of program slicing (backward/forward/chopping, static/dynamic/hybrid/conditioned, syntaxpreserving/amorphous) in a unified and concise framework. Due to its capability of defining both...

Nowadays, applications are usually large-scale, this making tasks of comprehending and debugging software rather complicated. As a dynamic reduction technique for simplifying programs, dynamic program slicing is an effective and important approach for locating and diagnosing software attacks. However, most of the existing dynamic slicing tools perform slicing at the source code level, but the s...

More than a few anonymization techniques, such as simplification and bucketization, have been deliberate for privacy protecting micro data publishing. Current work has shown that generalization loses substantial quantity of in sequence, particularly for high-dimensional data. Bucketization, on the other offer, does not put off membership revelation and does not apply for data that do not have a...

Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperative programming, this technique has been successfully applied to debugging, specialization, reuse, maintenance, etc. Due to its declarative nature, adapting the slicing notions and techniques to a logic programming set...