Home Page of Prof. Thomas W. Reps
 
   
   

 
Computer Sciences Dept.

Thomas W. Reps

J. Barkley Rosser Professor
& Rajiv and Ritu Batra Chair

Computer Sciences Department
University of Wisconsin-Madison
1210 West Dayton Street
Madison, WI 53706-1685
USA

Picture of Thomas W. Reps
Contact Information:

E-mail: reps at cs.wisc.edu
Telephone: (608) 262-2091
Department: (608) 262-1204

Some Maps: Campus Map | Campus-to-Capitol Map | City Map

Ph.D., Cornell University, 1982 (CV, Wikipedia, Biography, Current Research, Summary of Past Research, Benefunder Profile)

Research Interests:

See also Google Scholar, DBLP, Semantic Scholar, Guide2Research, Microsoft Academic Search, CiteSeerX, ACM Digital Library, and MathSciNet.
ORCID:

Projects:

Other Affiliations:

Recent Items of Note*new*

Recent Publications

[Back to the top]

Miscellaneous

  • Tips on writing a research paper (video recording from PLMW@PLDI21)

  • Material from POPL 2018 tutorial ``Introduction to Algebraic Program Analysis'' (Z. Kincaid and T. Reps):

  • Reps interview for People of Programming Languages (2018)

  • The Reps At Sixty Workshop was held in Edinburgh, UK on September 11, 2016.
    • Slides for most of the talks given at the workshop are now available on the website.
    • Some post-workshop reflections about (i) my work on machine-code analysis, and (ii) differences between academic and industry research are available here.

  • Information about the life of Susan Horwitz (1955-2014) can be found here.

  • The paper
    • Horwitz, S., Reps, T., and Binkley, D., Interprocedural slicing using dependence graphs. In 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. [abstract; ACM Author-Izer Link]
    was selected for inclusion in a special SIGPLAN collection of the 50 most influential papers from the SIGPLAN Conference on Programming Language Design and Implementation from 1979 to 1999:
    • Horwitz, S., Reps, T., and Binkley, D., 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), 232-243.

    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 top]

Popular Papers

[Back to the top]

Categorized Index to Publications

Program Slicing, Differencing, Merging, etc.

Overview

The Wisconsin Program-Slicing Tool

CodeSurfer System

Slicing

Chopping

Differencing

Merging

Algebra of slices (and applications to program merging)

Semantics and slicing

Other applications of slicing

Implemented integration system (for a small Pascal subset)

Miscellaneous

Ph.D. Dissertations

[Back to the top]

Interprocedural Dataflow Analysis

Demand IDFA via bottom-up logic programming and the magic-sets transformation

Exhaustive and Demand IDFA via graph reachability

IDFA using more than graph reachability

PTIME completeness of IDFA

[Back to the top]

Alias Analysis, Pointer Analysis, and Shape Analysis

Ph.D. Dissertations

[Back to the top]

Analysis of Multi-Threaded Programs

Ph.D. Dissertations

[Back to the top]

Symbolic Abstraction and Decision Procedures

Ph.D. Dissertations

[Back to the top]

Other Program-Analysis Problems

Ph.D. Dissertations

[Back to the top]

Path Problems

Context-Free-Language Reachability

Other Path Problems

Ph.D. Dissertations

[Back to the top]

Model Checking

Software

Ph.D. Dissertations

[Back to the top]

Computer Security

Ph.D. Dissertations

[Back to the top]

Code Instrumentation

Ph.D. Dissertations

[Back to the top]

Computational Differentiation and Computational Divided Differencing

[Back to the top]

Program-Development Environments

Ph.D. Dissertations

[Back to the top]

Incremental Computing

Ph.D. Dissertations

[Back to the top]

Attribute Grammars

Ph.D. Dissertations

[Back to the top]

Miscellaneous

[Back to the top]


Disclaimer

This web page contains links to PostScript and PDF files of articles that may be covered by copyright. You may browse the articles at your convenience (in the same spirit that you read a journal article or an article from a conference proceedings in a public library). Retrieving, copying, or distributing these files may violate copyright law.

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 top]


List of Publications

See also Google Scholar, DBLP, Microsoft Academic Search, CiteSeerX, ACM Digital Library, and MathSciNet.

Books

[Back to the top]

Journal Publications

[Back to the top]

Invited Papers

[Back to the top]

Book Chapters

[Back to the top]

Reprinted in Collections

[Back to the top]

Edited Books

[Back to the top]

Conference and Refereed Workshop Publications

[Back to the top]

Tutorials

  • Tips on writing a research paper (video recording from PLMW@PLDI21)

  • Material from POPL 2018 tutorial ``Introduction to Algebraic Program Analysis'' (Z. Kincaid and T. Reps):

  • Material from CAV 2010 tutorial ``There's plenty of room at the bottom: Analyzing and verifying machine code'':
    • Reps, T., Lim, J., Thakur, A., Balakrishnan, G., and Lal, A., There's plenty of room at the bottom: Analyzing and verifying machine code (Invited tutorial). In Proc. Computer Aided Verification, July 2010. [abstract; PDF; (c) Springer-Verlag]
    • Slides: Powerpoint

  • Material from PLDI 2000 tutorial ``Program analysis via graph reachability'':
    • Reps, T., Program analysis via graph reachability. Information and Software Technology 40, 11-12 (November/December 1998), pp. 701-726. [abstract; tech. report version of the paper: PostScript; PDF]
    • Slides: Powerpoint

  • Material from POPL 1993 tutorial ``Incremental computation''
    • Ramalingam, G. and Reps, T., A categorized bibliography on incremental computation. In Conference Record of the Twentieth ACM Symposium on Principles of Programming Languages, (Charleston, SC, Jan. 11-13, 1993), ACM, New York, NY, 1993, pp. 502-510. (Tutorial paper.) [PDF; ACM Author-Izer Link.]
    • Reps, T., Incremental computation. Unpublished tutorial notes, 1993. (Presented at the Twentieth ACM Symposium on Principles of Programming Languages, (Charleston, SC, Jan. 11-13, 1993).) [PDF]

[Back to the top]

Patents

[Back to the top]

Magazine Articles

[Back to the top]

Other Publications and Reports

[Back to the top]


Software

[Back to the top]


Visitors, Post-Docs, and Students

Visitors and Post-Doctoral Associates

Former Students

Current Students

[Back to the top]

 
Computer Sciences | UW Home