Date: Thu, 07 Nov 1996 19:09:20 GMT
Server: NCSA/1.5
Content-type: text/html
Last-modified: Mon, 04 Nov 1996 17:34:54 GMT
Content-length: 4121
Susan B. Horwitz
Susan B. Horwitz
Professor
Computer Sciences Department
University of Wisconsin-Madison
1210 West Dayton Street
Madison, WI 53706-1685
USA
E-mail: horwitz@cs.wisc.edu
Telephone: (608) 262-7946
Secretary: (608) 262-0017
Department: (608) 262-1204
Fax: (608) 262-9777
Ph.D., Cornell University, 1985
Research interests:
- language-based programming environments
- program slicing, differencing, and merging
- static analysis of programs
- interprocedural dataflow analysis
Research Summary
My work mainly involves the design and implementation
of language-based programming tools that help programmers with problems like:
- understanding how existing programs work, and how they would be affected
by proposed modifications;
- understanding the textual, structural, and semantic differences between
two versions of a program;
- retesting a program after changing it;
- combining pieces of old programs to produce a new program, with certain
semantic guarantees.
This work has involved the use of a program representation called the
program dependence graph (PDG), and an operation called slicing.
I am also working on new algorithms for precise, interprocedural
dataflow analysis.
Previous work on interprocedural dataflow analysis mainly concentrated
either on efficient algorithms for specific individual problems,
or on (not necessarily efficient) algorithms for a general class of problems.
Thomas Reps, Mooly Sagiv, and I have developed and implemented a new
algorithm that is both efficient, and applies to a large class of problems.
Recent Publications
-
M. Shapiro and S. Horwitz,
Fast and accurate flow-insensitive points-to analysis,
To appear in Conference Record of the Twenty-Fourth ACM Symposium on
Principles of Programming Languages,
(Paris, France, January 1997).
-
S. Horwitz, T.Reps, and M. Sagiv,
Demand interprocedural dataflow analysis.
In Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software
Engineering,
(Washington DC, October 1995).
-
M. Sagiv, T. Reps, and S. Horwitz,
Precise interprocedural dataflow analysis with applications to constant
propagation.
In Proceedings of the Sixth International Joint Conference on the Theory
and Practice of Software Development,
(Aarhus Denmark, May 1995).
-
T. Reps, M. Sagiv, and S. Horwitz,
Precise interprocedural dataflow analysis via graph reachability.
In Conference Record of the Twenty-Second ACM Symposium on Principles
of Programming Languages,
(San Francisco CA, January 1995).
-
S. Bates and S. Horwitz,
Incremental program testing using program dependence graphs.
In Conference Record of the Twentieth ACM Symposium on Principles
of Programming Languages,
(Charleston, SC, January 1993).
-
S. Horwitz and T. Reps,
The use of program dependence graphs in software engineering.
In Proceedings of the Fourteenth International Conference
on Software Engineering,
(Melbourne, Australia, May 1992).
-
S. Horwitz,
Identifying the semantic and textual differences between two versions of a
program.
In Proceedings of the SIGPLAN 90 Conference on Programming Language
Design and Implementation,
(White Plains, NY, June 1990).
Teaching