Please note that the definitive versions of these papers are the published versions. The PostScript versions are provided here as a courtesy, and, in some cases, there may be differences between the PostScript provided here and the published version. We believe that all of the differences are either formatting differences or copy-editing changes. If you cite these papers, please cite the published version rather than giving a URL.
[Back to the Table of Contents]
The slice of a program with respect to a set of program elements S is a projection of the program that includes only program elements that might affect (either directly or transitively) the values of the variables used at members of S. Slicing allows one to find semantically meaningful decompositions of programs, where the decompositions consist of elements that are not textually contiguous.
Program slicing is a fundamental operation that can aid in solving many software-engineering problems. For instance, it has applications to program understanding, maintenance, debugging, testing, differencing, specialization, reuse, and merging.
The activities of the project have been devoted to:
More recently, we found some unexpected connections between interprocedural dataflow analysis and our previous work on interprocedural program slicing. In particular, we have shown how a large class of interprocedural dataflow-analysis problems can be solved by transforming them into a special kind of graph-reachability problem. This graph-reachability problem can be solved precisely in polynomial time by the algorithm originally developed for interprocedural slicing.
[Back to the Table of Contents]
[Back to the Table of Contents]
A retrospective on the paper was published as
An extended version of the PLDI 88 paper later appeared as the following journal paper:
[Back to the Table of Contents]
[Back to the Table of Contents]
[Back to the Table of Contents]
Interprocedural Dataflow Analysis
[Back to the Table of Contents]
Alias Analysis, Pointer Analysis, and Shape Analysis
[Back to the Table of Contents]
Analysis of Multi-Threaded Programs
Symbolic Abstraction and Decision Procedures
Other Program-Analysis Problems
[Back to the Table of Contents]
[Back to the Table of Contents]
[Back to the Table of Contents]
[Back to the Table of Contents]
Computational Differentiation and Computational Divided Differencing
[Back to the Table of Contents]
[Back to the Table of Contents]
[Back to the Table of Contents]
Chinese reprint published by the World Publishing Corporation, Beijing, China, 1991.
[Back to the top]
Journal Publications
[Back to the Table of Contents]
Invited Papers
[Back to the Table of Contents]
Book Chapters
[Back to the Table of Contents]
Reprinted in Collections
Revised version of Reps, T.W. and Rall, L.B., Computational divided differencing and divided-difference arithmetics. Higher-Order and Symbolic Computation 16, 1-2 (June 2003).
Reprinted from Proc. Computer-Aided Verification, 2005.
Reprinted from Proc. 3rd Asian Symposium on Programming Languages and Systems, (Tsukuba, Japan, Nov. 3-5, 2005).
Reprinted from Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 22-24, 1988), ACM SIGPLAN Notices 23, 7 (July 1988), pp. 35-46.
A retrospective on the paper was published as
Horwitz, S., Reps, T., and Binkley, D., Retrospective: Interprocedural slicing using dependence graphs. 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1979 - 1999): A Selection, K.S. McKinley, ed., ACM SIGPLAN Notices 39, 4 (April 2004), 229-231. [retrospective (PS); retrospective (PDF); ACM Author-Izer Link.]
Reprinted from ACM Transactions on Programming Languages and Systems 12, 1 (January 1990), 26-60. [abstract; paper; ACM Author-Izer Link.]
Reprinted from ACM Transactions on Programming Languages and Systems 12, 1 (January 1990), 26-60. [abstract; paper; ACM Author-Izer Link.]
Reprinted from ACM Transactions on Programming Languages and Systems 11, 3 (July 1989), 345-387. [abstract; paper; ACM Author-Izer Link.]
Reprinted from Proceedings of the Colloquium on Combining Paradigms for Software Development, (Brighton, UK, April 8-12, 1991), Lecture Notes in Computer Science, Vol. 494, S. Abramsky and T.S.E. Maibaum (eds.), Springer-Verlag, New York, NY, 1991, pp. 137-152. [PDF.]
Reprinted from IEEE Computer 20, 11 (November 1987), 29-40.
Reprinted from Communications of the ACM 24, 9 (September 1981), 563-573. [abstract; ACM Author-Izer Link.]
Reprinted from Proceedings of the ACM SIGPLAN/SIGOA Symposium on Text Manipulation, (Portland, OR, June 8-10, 1981), ACM SIGPLAN Notices 16, 6 (June 1981), pp. 8-16. [ACM Author-Izer Link.]
[Back to the Table of Contents]
Edited Books
[Back to the Table of Contents]
Conference and Refereed Workshop Publications
Extended version: TR-1840, Computer Sciences Department, University of Wisconsin, Madison, WI. Revised April 2017. [abstract; PDF]
Miné, A., Breck, J., and Reps, T., An algorithm inspired by constraint solvers to infer inductive invariants in numeric programs. In Proc. European Symp. on Programming (ESOP), Apr. 2016. [abstract; PDF]
[Back to the Table of Contents]
Tutorials
[Back to the Table of Contents]
Pending Submissions
For this work, Venkatesh received the UW Computer Sciences Department's Outstanding Graduate Student Research Award for 2016-2017.
For this work, Aditya was a co-recipient of the UW Computer Sciences Department's Outstanding Graduate Student Research Award for 2013-2014.
For this work, Junghee received the UW Computer Sciences Department's Outstanding Graduate Student Research Award for 2010-2011.
For this work, Akash was a co-recipient of the 2009 ACM SIGPLAN John C. Reynolds Doctoral Dissertation Award, and a co-recipient of the UW Computer Sciences Department's Outstanding Graduate Student Research Award for 2008-2009. Akash was also named to MIT Technology Review's 2011 India TR-35 list (top innovators under 35).
For this work, Gogul received the UW Computer Sciences Department's Outstanding Graduate Student Research Award for 2007-2008.
Dissertation published as: Ramalingam, G., Bounded Incremental Computation, Lecture Notes in Computer Science, Vol. 1089, Springer-Verlag, New York, NY, 1996. [Access via SpringerLink.]
[Back to the Table of Contents]
Magazine Articles
[Back to the Table of Contents]
Other Publications and Reports
[Back to the Table of Contents]
[Back to the Table of Contents]