| Interprocedural slicing using dependence graphs S Horwitz, T Reps, D Binkley ACM Transactions on Programming Languages and Systems (TOPLAS) 12 (1), 26-60, 1990 | 2126 | 1990 |
| Precise interprocedural dataflow analysis via graph reachability T Reps, S Horwitz, M Sagiv Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of …, 1995 | 1561 | 1995 |
| Using slicing to identify duplication in source code R Komondoor, S Horwitz International static analysis symposium, 40-56, 2001 | 832 | 2001 |
| Interprocedural slicing using dependence graphs S Horwitz, T Reps, D Binkley Proceedings of the ACM SIGPLAN 1988 conference on Programming Language …, 1988 | 746 | 1988 |
| Integrating noninterfering versions of programs S Horwitz, J Prins, T Reps ACM Transactions on Programming Languages and Systems (TOPLAS) 11 (3), 345-387, 1989 | 651 | 1989 |
| The use of program dependence graphs in software engineering S Horwitz, T Reps Proceedings of the 14th international conference on Software engineering …, 1992 | 442 | 1992 |
| Incremental program testing using program dependence graphs S Bates, S Horwitz Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of …, 1993 | 375 | 1993 |
| Fast and accurate flow-insensitive points-to analysis M Shapiro, S Horwitz Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of …, 1997 | 371 | 1997 |
| Precise interprocedural dataflow analysis with applications to constant propagation M Sagiv, T Reps, S Horwitz Theoretical Computer Science 167 (1-2), 131-170, 1996 | 370 | 1996 |
| Dependence analysis for pointer variables S Horwitz, P Pfeiffer, T Reps Proceedings of the ACM SIGPLAN 1989 Conference on Programming language …, 1989 | 353 | 1989 |
| Identifying the semantic and textual differences between two versions of a program S Horwitz Proceedings of the ACM SIGPLAN 1990 conference on Programming language …, 1990 | 335 | 1990 |
| Speeding up slicing T Reps, S Horwitz, M Sagiv, G Rosay ACM SIGSOFT Software Engineering Notes 19 (5), 11-20, 1994 | 278 | 1994 |
| Demand interprocedural dataflow analysis S Horwitz, T Reps, M Sagiv ACM SIGSOFT Software Engineering Notes 20 (4), 104-115, 1995 | 237 | 1995 |
| Slicing programs with arbitrary control-flow T Ball, S Horwitz International Workshop on Automated and Algorithmic Debugging, 206-222, 1993 | 233 | 1993 |
| Precise flow-insensitive may-alias analysis is NP-hard S Horwitz ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (1), 1-6, 1997 | 211 | 1997 |
| On the adequacy of program dependence graphs for representing programs S Horwitz, J Prins, T Reps Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of …, 1988 | 210 | 1988 |
| Program integration for languages with procedure calls D Binkley, S Horwitz, T Reps ACM Transactions on Software Engineering and Methodology (TOSEM) 4 (1), 3-35, 1995 | 182 | 1995 |
| Protecting C programs from attacks via invalid pointer dereferences SH Yong, S Horwitz Proceedings of the 9th European software engineering conference held jointly …, 2003 | 169 | 2003 |
| The effects of the precision of pointer analysis M Shapiro, S Horwitz Static Analysis: 4th International Symposium, SAS'97 Paris, France …, 1997 | 156 | 1997 |
| Semantics-preserving procedure extraction R Komondoor, S Horwitz Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of …, 2000 | 150 | 2000 |
Thomas RepsJ. Barkley Rosser Professor & Rajiv and Ritu Batra Chair Emeritus, CS Dept., Univ. of WisconsinVerified email at cs.wisc.edu
