Program slicing is a technique to extract relevant parts of a program, and it is widely used in program debugging, parallelization, testing, reverse engineering, etc. This paper concerns static slicing and it follows the Weiser’s definition of slicing that consists of computing what statements of the program might affect the value of some particular variable at a specified program point. We arg...

The present study was undertaken to assess the relative efficiency of three different collection techniques of ovarian biometrics and oocytes grading percent of oocytes in local goats of Andhra Pradesh The mean oocyte recovery from right and left ovary was 1.9 ± 0.28 and 0.8 ± 0.18 in aspiration technique, 2.15 ± 0.31 and 2.9 ± 0.46 in dissection technique and 6.55 ± 0.57 and 4.51 ± 0.46 in sli...

The rapidly increasing number of cores available in multicore processors does not necessarily lead directly to a commensurate increase in performance: programs written in conventional languages, such as C, need careful restructuring, preferably automatically, before the benefits can be observed in improved run-times. Even then, much depends upon the intrinsic capacity of the original program fo...

Anonymization is a technique preserving privacy on micro data, we have so many anonymization techniques like generalization, bucketization all these are privacy preserving on sensitive data, with these techniques there is no security for the data, generalization loses the important data and bucketization is not preventing membership disclosure and does not apply on the data for clear separation...

An important problem in publishing the data is privately held data about individuals without revealing the sensitive information about them. Several anonymization techniques, such as suppression, bucketization and slicing have been designed for privacy preservation in microdata publishing. Suppression involves not releasing a value at all it leads to the utility loss while the anonymized table ...

Several anonymization techniques, such as generalization and bucketization, have been designed for privacy preserving microdata publishing. Recent work has shown that generalization loses considerable amount of information, especially for high-dimensional data. Bucketization, on the other hand, does not prevent membership disclosure and does not apply for data that do not have a clear separatio...

The next generation of hypertext documents will be based on richer semantics and have more potential for automation and personalization than is currently possible. One system that shows much promise is the "sliced book". Slicing Book Technology splits textbooks into small, self– coherent slices and then uses semantic links to make structural relationships such as "Slice A builds on Slice B" exp...

A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. As defined in this paper, a slice of a schema is obtained from a schema by deleting some of its statements. We prove that given a schema S which is functionlin...

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually targeting either the imperative or the object oriented paradigms, are based on some sort of gra...

In this contribution, we show how correctness proofs for intra[8] and interprocedural slicing [9] can be used to prove that slicing is able to guarantee information flow noninterference. Moreover, we also illustrate how to lift the control flow graphs of the respective frameworks such that they fulfil the additional assumptions needed in the noninterference proofs. A detailed description of the...