A. Lakhotia. Improved interprocedural slicing algorithm. Technical Report CACS-TR-92-5-8, University of Southwestern Louisiana, Lafayette, Nov. 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Survey of Program Slicing Techniques - Tip (1995) (251 citations) (Correct)
....a same level realizable path of length zero exists from any formal out vertex to itself. A worklist is used to select a path, and extend it by adding an edge to its beginning. In [75] a demand version of the algorithm is presented, which incrementally determines the summary edges of an SDG. In [60], Lakhotia presents an algorithm for computing interprocedural slices that is also based on SDGs. This algorithm computes slices that are identical to the slices computed by the algorithm in [44] Associated with every SDG vertex v is a three valued tag; possible values for this tag are: ....
.... no Gallagher, Lyle [31, 32] D no A d S no Jiang et al. 47] D yes A d S, A, P e no Hausler [36] F no S S no Bergeretti, Carr e [16] I yes f S S no Ottenstein [69] G no S S, A no Horwitz et al. 41, 42, 76] G no S S no Horwitz et al. 44] G yes S S no Reps et al. 75] G yes S S no Lakhotia [60] G yes S S no Agrawal et al. 3] G no S S, A, P no Ball, Horwitz [8, 9] G no A S no Choi, Ferrante [21] G no A S no Agrawal [2] G no A S no Cheng [19] G no S S yes a D = dataflow equations, F = functional denotational semantics, I = information flow relations, G = reachability in a dependence ....
Lakhotia, A. Improved interprocedural slicing algorithm. Report CACS TR-92-5-8, University of Southwestern Louisiana, 1992.
Flow Analysis Models for Interprocedural Program.. - Arun Lakhotia.. (1999) Self-citation (Lakhotia) (Correct)
No context found.
A. Lakhotia. Improved interprocedural slicing algorithm. Technical Report CACS-TR-92-5-8, University of Southwestern Louisiana, Lafayette, Nov. 1992.
Flow Analysis Models for Interprocedural Program Slicing.. - Lakhotia, Deprez, Kame (1999) Self-citation (Lakhotia) (Correct)
....functions. 3 Flow analysis models for program slicing We now present flow analysis models for program slicing. We start with model for intraprocedural slicing, then give models for interprocedural slicing for Horwitz, Reps, and Binkley s two pass algorithm [14] and Lakhotia s one pass algorithm [20]. That a worklist algorithm for a flow model is equivalent to the graph reachability based algorithm it models may be determined by instantiating the worklist algorithm. We present such an instantiation for flow models of intraprocedural slicing. Algorithm for interprocedural models may be ....
....if # is equal to . Each pass of Horwitz et al. s slicing algorithm is essentially an instance of the Worklist algorithm of Figure 1. The two sets of constraints can also be solved in one pass by solving them simultaneously. Lakhotia s one pass algorithm does essentially that [20]. But it solves the constraints of Figure 3 (b) According to this model a node is in the slice iff is either equal to or ( The constraints state that a node is in the slice with value (not less than) if it is in the slicing criterion. Otherwise, a node is in the ....
[Article contains additional citation context not shown here]
A. Lakhotia. Improved interprocedural slicing algorithm. Technical Report CACS-TR-92-5-8, University of Southwestern Louisiana, Lafayette, Nov. 1992.
An Approach to Recovering Data Flow Oriented Design of a.. - Lakhotia Self-citation (Lakhotia) (Correct)
....parameters. The data dependence encoded in a system dependence graph provides the physical data flow. The logical flow of data may be derived by propagating the generation and use information through the dependence path in the PDG. Algorithms to propagate simple tags through an SDG are given in [19, 23, 22]. These algorithms may be generalized to propagate sets of values indicating the data flow information. 6 4 Current status and open problems We have implemented several variations of architecture recovery algorithm proposed by Hutchens and Basili [20] The variations were introduced to improve ....
A. Lakhotia. Improved interprocedural slicing algorithm. Technical Report CACS-TR-92-5-8, University of Southwestern Louisiana, Lafayette, November 1992 (submitted).
Analysis of Experiences with Modifying Computer Programs - Lakhotia Self-citation (Lakhotia) (Correct)
....the first two. Since it was not cost effective to complete that exercise, it was abandoned. The experience cited here relates to version 1.40 of GCC and the first release of WPIS. 5 The modification of WPIS was performed to experiment with an algorithm for interprocedural program slicing [14]. This algorithm was a variation of an algorithm due to [10] This exercise was successful. The reason we chose WPIS to develop the slicing algorithm was because it already implemented the construction of program dependence graph , an internal representation of programs. This algorithm for ....
....due to dead code , the difficulty in understanding an implementation that differs from the documentation, and . the need to resort to reading code, when all else fails. 3.8. 1 Objectives for MOD IV Replace the interprocedural slicing algorithm of WPIS, published in [10] by the algorithm in [14]. 3.8.2 Reconstruction of steps for MOD IV Subject E spent almost two months learning about program slicing, learning how to install and use WPIS, and understanding the two algorithms. Subjects A and E discussed possible changes that may need to done in the original code to move to the new code. ....
A. Lakhotia. Improved interprocedural slicing algorithm. Technical Report CACS-TR-92-5-8, University of Southwestern Louisiana, Lafayette, Nov. 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC