Program slicing is a method for automatically decomposing programs by analyzing their data flow and control flow. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a ``slice,'' is an independent program guaranteed to represent faithfully the original program within the domain of the specified subset of behavior. Some properties of slices are presented. In particular, finding statement-minimal slices is in general unsolvable, but using data flow analysis is sufficient to find approximate slices. Potential applications include automatic slicing tools for debuggng and parallel processing of slices.

Program Slicing

The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity. Substantially revised, reorganised and updated, the book now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject. Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science. It will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.

Digraphs Theory Algorithms And Applications

http://cjluserv.iis.sinica.edu.tw/~josephcclin/paper/cographs.pdf

Complement reducible graphs

http://compalg.inf.elte.hu/~tony/Kutatas/BinPacking/Johnson-BinPacking-NP-Column-JAlg-2002.pdf

The NP-completeness column: An ongoing guide

Program slicing is a method used by experienced computer programmers for abstracting from programs. Starting from a subset of a program's behavior, slicing reduces that program to a minimal form which still produces that behavior. The reduced program, called a “slice”, is an independent program guaranteed to faithfully represent the original program within the domain of the specified subset of behavior.Finding a slice is in general unsolvable. A dataflow algorithm is presented for approximating slices when the behavior subset is specified as the values of a set of variables at a statement. Experimental evidence is presented that these slices are used by programmers during debugging. Experience with two automatic slicing tools is summarized. New measures of program complexity are suggested based on the organization of a program's slices.

Program slicing

We present a linear-time algorithm to recognize the class of vertex series-parallel (VSP) digraphs. Our method is based on the relationship between VSP digraphs and the class of edge series-paralle...

The Recognition of Series Parallel Digraphs

We present an algorithm that recognizes the class of General Series Parallel digraphs and runs in time proportional to the size of its input. To perform this recognition task it is necessary to compute the transitive reduction and transitive closure of any General Series Parallel digraph. Our analysis is based on the relationship between General Series Parallel digraphs and a class of well known models of electrical networks.

The recognition of Series Parallel digraphs

A parsing method based on the triconnected decomposition of a biconnected graph is presented. The parsing algorithm runs in linear time and handles a large class of flow graphs. The applications of this algorithm to flow analysis and to the automatic structuring of programs are discussed.

Prime subprogram parsing of a program

This paper presents an algorithm for recognizing two dimensional partial orders. The algorithm accepts as input an arbitrary partial order G and responds “yes” if the dimension of G is less than or equal to two and responds “no” otherwise. As part of the recognition process, the algorithm decomposes the partial order in a canonical way which can be used to determine whether two partial orders of dimension two are isomorphic. Both the recognition and the isomorphism algorithms can be implemented to run in time O(n2) when the input is a partial order on n elements. The best previously known algorithms for these two tasks had a worst case behavior of O(n3).

Recognition and Isomorphism of Two Dimensional Partial Orders

In th i s pape r we descr ibe a ve ry i m p o r t a n t c o m p o n e n t of a n y VLSI (very largescale in t eg ra t ion ) des ign e n v i r o n m e n t : a tool to a u t o m a t e the l a y o u t of circuits . Th i s work is p a r t of a n effort to c rea te a n i n t e g r a t e d e n v i r o n m e n t for VLSI des ign ( including l ayou t sys tems, device a n d swi tchlevel s imula tors , a n d t e s t ing facilities} cu r r en t ly u n d e r way a t P r i n c e t o n Univers i ty .

Jacobo Valdes

Papers

The Recognition of Series Parallel Digraphs

The recognition of Series Parallel digraphs

Prime subprogram parsing of a program

Recognition and Isomorphism of Two Dimensional Partial Orders

VLSI Layout as Programming