World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
13938
World Ranking
11421
National Ranking
4692

Overview

Susan Horwitz was affiliated with the University of Wisconsin-Madison in the United States. Their academic career involved engagement in research and teaching at this institution.

No specific recent papers, frequent co-authors, or publication venues are available in the data to detail their research contributions or collaborations. Similarly, there is no available information on specific fields, subfields, or topics of study associated with their work.

There is also no record of book publications or awards received in the source data provided.

Due to the lack of detailed data, it is not possible to elaborate on particular research themes, publication impact, or professional achievements. The profile focuses solely on the verified institutional connection and the status of being deceased.

Best Publications

  • Interprocedural slicing using dependence graphs

    Susan Horwitz;Thomas Reps;David Binkley

  • Interprocedural slicing using dependence graphs

    Susan Horwitz;Thomas Reps;David Binkley

  • Precise interprocedural dataflow analysis via graph reachability

    Thomas Reps;Susan Horwitz;Mooly Sagiv

  • Using Slicing to Identify Duplication in Source Code

    Raghavan Komondoor;Susan Horwitz

  • Integrating noninterfering versions of programs

    Susan Horwitz;Jan Prins;Thomas Reps

  • Integrating non-intering versions of programs

    S. Horwitz;J. Prins;T. Reps

  • The use of program dependence graphs in software engineering

    Susan Horwitz;Thomas Reps

  • Fast and accurate flow-insensitive points-to analysis

    Marc Shapiro;Susan Horwitz

  • Precise interprocedural dataflow analysis with applications to constant propagation

    Mooly Sagiv;Thomas Reps;Susan Horwitz

  • Incremental program testing using program dependence graphs

    Samuel Bates;Susan Horwitz

  • Dependence analysis for pointer variables

    S. Horwitz;P. Pfeiffer;T. Reps

  • Speeding up slicing

    Thomas Reps;Susan Horwitz;Mooly Sagiv;Genevieve Rosay

  • Demand interprocedural dataflow analysis

    Susan Horwitz;Thomas Reps;Mooly Sagiv

  • Slicing Programs with Arbitrary Control-flow

    Thomas Ball;Susan Horwitz

  • On the adequacy of program dependence graphs for representing programs

    S. Horwitz;J. Prins;T. Reps

  • Identifying the semantic and textual differences between two versions of a program

    Susan Horwitz

  • Precise flow-insensitive may-alias analysis is NP-hard

    Susan Horwitz

  • Program integration for languages with procedure calls

    David Binkley;Susan Horwitz;Thomas Reps

  • Protecting C programs from attacks via invalid pointer dereferences

    Suan Hsi Yong;Susan Horwitz

  • The Effects of the Precision of Pointer Analysis

    Marc Shapiro;Susan Horwitz

  • Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation

    Shmuel Sagiv;Thomas W. Reps;Susan Horwitz

Frequent Co-Authors

Thomas Reps
Thomas Reps University of Wisconsin–Madison
Jan F. Prins
Jan F. Prins University of North Carolina at Chapel Hill
Mooly Sagiv
Mooly Sagiv Tel Aviv University
David Binkley
David Binkley Loyola University Maryland
Thomas Ball
Thomas Ball Microsoft (United States)
Barbara G. Ryder
Barbara G. Ryder Virginia Tech
Ben Liblit
Ben Liblit University of Wisconsin–Madison

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a degree in Computer Science opens doors to numerous online education and career opportunities. If you’re considering alternative pathways or complementary fields, it's helpful to investigate the best majors in college that can align with your interests and broaden your skillset.

For those seeking advanced degrees, flexibility and duration matter. Many students look for the easiest masters degree to get online, balancing career growth with ease of completion. Pursuing graduate studies online can fit various lifestyles and employment situations.

Affordability is another key issue. Today, there are several options for the cheapest doctorate degree online, making it more feasible to obtain a terminal degree in your field without significant financial burden.

Some may also consider fast-tracked doctoral programs like the online edd, especially for those interested in educational technology or academic leadership. These accelerated programs help students enter leadership roles in a shorter timeframe.

Best Scientists Citing Susan Horwitz

Recently Published Articles