Program slicing is a well-known technique that has been widely used for debugging in the context of imperative programming. Debugging is a particularly difficult task within lazy declarative programming. In particular, there exist very few approaches to program slicing in this context. In this paper, we describe a slicing tool for firstorder lazy functional logic languages. We also illustrate i...

Program slicing is an analysis that answers questions such as \Which statements might aaect the computation of variable v at statement s?" or \Which statements depend on the value of v computed in statement s?". The answers computed by program slicing are generally a set of statements. We introduce the idea of iteration spacing slicing: we reene program slicing to ask questions such as \Which i...

This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, employ a novel model of execution that is found useful for abstract and high level description of complex controllers. Slicing is well known in the domain of sequential transformational programs and has been found to be useful in analys...

Several approaches to reverse and re-engineering are based upon program slicing. Unfortunately, for large systems, such as those which typically form the subject of reverse engineering activities, the space and time requirements of slicing can be a barrier to successful application. Faced with this problem, several authors have found it helpful to merge Control Flow Graph (CFG) nodes, thereby i...

A dynamic program slice is this part of a program that "affects" the computation of a variable of interest during program execution on a specific program input. Dynamic program slicing refers to a collection of program slicing methods that are based on program execution and may significantly reduce the size of a program slice because run-time information, collected during program execution, is ...

Privacy preserving publishing is the kind of techniques to apply privacy to collected vast amount of data. One of the recent problem prevailing is in the field of data publication. The data often consist of personally identifiable information so releasing such data consists of privacy problem. Several anonymization techniques such as generalization and bucketization have been designed for priva...

We analyze stationary slicings of the Schwarzschild spacetime defined by members of the Bona-Massó family of slicing conditions. Our main focus is on the influence of a non-vanishing offset to the extrinsic curvature, which forbids the existence of standard Cauchy foliations but at the same time allows gauge choices that are adapted to include null infinity (I ) in the evolution. These hyperbol...

The RNAi pathway provides both innate immunity and efficient gene-knockdown tools in many eukaryotic species, but curiously not in zebrafish. We discovered that RNAi is less effective in zebrafish at least partly because Argonaute2-catalyzed mRNA slicing is impaired. This defect is due to two mutations that arose in an ancestor of most teleost fish, implying that most fish lack effective RNAi. ...

This paper extends the notion of slicing, which was originally proposed and studied for sequential programs, to concurrent programs and presents a graph-theoretical approach to slicing concurrent programs. In addition to the usual control and data dependences proposed and studied for sequential programs, the paper introduces three new types of primary program dependences in concurrent programs,...

Recently much work has been done towards extending object-oriented database systems (OODBs) with advanced tools such as view technology, advanced schema evolution support, and role modeling systems. These extensions all require that the underlying database system supports more powerful and exible modeling constructs than are currently supported by existing OODB systems. In this paper, we identi...