Interprocedural Slicing Using Dependence Graphs - Horwitz, Reps, Binkley (1990)(Correct)(325 citations)
Impl.pages 302-312, 1994. 2] T. Ball and S. Horwitz. Slicing programs with arbitrary control-flow. In
and Impl.pages 302-312, 1994. 2] T. Ball and S. Horwitz. Slicing programs with arbitrary control-flow.
Slicing Using Dependence Graphs Susan Horwitz Comp. Sci. Department University of www.cs.wisc.edu/wpis/papers/pldi88.retrospective.ps
Fast and Accurate Flow-Insensitive Points-To Analysis - Shapiro, Horwitz (1997)(Correct)(110 citations)
thesis, Cornell University, Jan 1990. HPR89] S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis
Points-To Analysis Marc Shapiro and Susan Horwitz Computer Sciences Department, University of
[42] Marc Shapiro and Susan Horwitz. Fast and accurate flow-insensitive point-to www.cs.wisc.edu/wpis/papers/popl97.ps
The Effects of the Precision of Pointer Analysis - Shapiro (1997)(Correct)(38 citations)
New York, NY, 1981. Springer-Verlag. HRB90] S. Horwitz, T. Reps, and D. Binkley. Interprocedural
of Pointer Analysis Marc Shapiro and Susan Horwitz University of Wisconsin -Madison 1210 West
[41] Marc Shapiro and Susan Horwitz. The effects of the precision of pointer www.cs.wisc.edu/wpis/papers/sas97.ps
Speeding up Slicing - Reps, Horwitz, Sagiv, Rosay (1994)(Correct)(38 citations)
Madison, WI 53706 USA. Electronic mail: reps, horwitz, sagiv, rosay}cs.wisc.edu. who gave algorithms
Illinois, Urbana, IL (October 1979)4. Bates, S. and Horwitz, S.Incremental program testing using
Speeding up Slicing Thomas Reps, Susan Horwitz, Mooly Sagiv, and Genevieve Rosay www.cs.wisc.edu/wpis/papers/fse94.ps
Slicing Programs with Arbitrary Control Flow - Thomas Ball Susan (1992)(Correct)(34 citations)
24(1) pp. 98-120 (January 1977)3. Ball, T. and Horwitz, S.Slicing programs with arbitrary control
With Arbitrary Control Flow Thomas Ball Susan Horwitz Tom@cs.wisc.edu Horwitz@cs.wisc.edu
[BH92] Thomas Ball and Susan Horwitz. Slicing programs with arbitrary control www.cs.wisc.edu/wpis/papers/aadebug93.ps
On the Adequacy of Program Dependence Graphs for.. - Horwitz, Prins, Reps (1988)(Correct)(27 citations)
and Systems 9(3) pp. 319-349 (July 1987)6. Horwitz, S.Prins, J.and Reps, T.Integrating
Dependence Graphs for Representing Programs Susan Horwitz, Jan Prins, and Thomas Reps University of
Siemens, and Xerox. Authors' current addresses: Susan Horwitz and Thomas Reps, Computer Sciences www.cs.wisc.edu/wpis/papers/popl88b.ps
Using Slicing to Identify Duplication in Source Code - Komondoor, Horwitz (2001)(Correct)(20 citations)
11. R. Komondoor and S. Horwitz. Semantics-preserving procedure extraction. In
www.codesurfer.com. 11. R. Komondoor and S. Horwitz. Semantics-preserving procedure extraction. In
Madison, WI 53706 USA raghavan@cs.wisc.edu Susan Horwitz Computer Sciences Department University of www.cs.wisc.edu/wpis/papers/sas01.ps
Precise Flow-Insensitive May-Alias Analysis is NP-Hard - Horwitz (1997)(Correct)(15 citations)
Flow-Insensitive May-Alias Analysis Is Np-Hard Susan Horwitz University Of Wisconsin-Madison Determining
128.105.7.11/wpis/html/ 23] Susan Horwitz. Precise flow-insensitive may-alias analysis
Flow-Insensitive May-Alias Analysis is NP-Hard Susan Horwit www.cs.wisc.edu/wpis/papers/toplas97a.ps
Using Static Single Assignment Form to Improve.. - Hasti, Horwitz (1998)(Correct)(15 citations)
than a flowinsensitive analysis. Shapiro and Horwitz [SH97] give an algorithm that can be `tuned' so
28(6)36-45, June 1993. Hor97] S. Horwitz. Precise flow-insensitive may-alias analysis is
Pointer Analysis Rebecca Hasti and Susan Horwitz Computer Sciences Department, University of www.cs.wisc.edu/wpis/papers/pldi98.ps