 | 2010 |
|---|
| 149 |       | Bertrand Jeannet,
Alexey Loginov,
Thomas W. Reps,
Mooly Sagiv:
A relational approach to interprocedural shape analysis.
ACM Trans. Program. Lang. Syst. 32(2): (2010) |
| 2009 |
|---|
| 148 | | William R. Harris,
Nicholas Kidd,
Sagar Chaki,
Somesh Jha,
Thomas W. Reps:
Verifying Information Flow Control over Unbounded Processes.
FM 2009: 773-789 |
| 147 | | Nicholas Kidd,
Peter Lammich,
Tayssir Touili,
Thomas W. Reps:
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks.
SPIN 2009: 125-142 |
| 146 | | Junghee Lim,
Akash Lal,
Thomas W. Reps:
Symbolic Analysis via Semantic Reinterpretation.
SPIN 2009: 148-168 |
| 145 | | Nicholas Kidd,
Thomas W. Reps,
Julian Dolby,
Mandana Vaziri:
Finding Concurrency-Related Bugs Using Random Isolation.
VMCAI 2009: 198-213 |
| 144 | | Akash Lal,
Thomas W. Reps:
Reducing concurrent analysis under a context bound to sequential analysis.
Formal Methods in System Design 35(1): 73-97 (2009) |
| 143 | | Tal Lev-Ami,
Neil Immerman,
Thomas W. Reps,
Mooly Sagiv,
Siddharth Srivastava,
Greta Yorsh:
Simulating reachability using first-order logic with applications to verification of linked data structures
Logical Methods in Computer Science 5(2): (2009) |
| 2008 |
|---|
| 142 | | Akash Lal,
Thomas W. Reps:
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis.
CAV 2008: 37-51 |
| 141 | | Thomas W. Reps,
Gogul Balakrishnan:
Improved Memory-Access Analysis for x86 Executables.
CC 2008: 16-35 |
| 140 | | Junghee Lim,
Thomas W. Reps:
A System for Generating Static Analyzers for Machine Instructions.
CC 2008: 36-52 |
| 139 | | Nicholas Kidd,
Akash Lal,
Thomas W. Reps:
Language Strength Reduction.
SAS 2008: 283-298 |
| 138 | | Akash Lal,
Thomas W. Reps:
Solving Multiple Dataflow Queries Using WPDSs.
SAS 2008: 93-109 |
| 137 | | Gogul Balakrishnan,
Thomas W. Reps:
Analyzing Stripped Device-Driver Executables.
TACAS 2008: 124-140 |
| 136 | | Akash Lal,
Tayssir Touili,
Nicholas Kidd,
Thomas W. Reps:
Interprocedural Analysis of Concurrent Programs Under a Context Bound.
TACAS 2008: 282-298 |
| 2007 |
|---|
| 135 |  | Thomas W. Reps,
Mooly Sagiv,
Jörg Bauer:
Program Analysis and Compilation, Theory and Practice, Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday
Springer 2007 |
| 134 | | Tal Lev-Ami,
Christoph Weidenbach,
Thomas W. Reps,
Mooly Sagiv:
Labelled Clauses.
CADE 2007: 311-327 |
| 133 | | Igor Bogudlov,
Tal Lev-Ami,
Thomas W. Reps,
Mooly Sagiv:
Revamping TVLA: Making Parametric Shape Analysis Competitive.
CAV 2007: 221-225 |
| 132 | | Daphna Amit,
Noam Rinetzky,
Thomas W. Reps,
Mooly Sagiv,
Eran Yahav:
Comparison Under Abstraction for Verifying Linearizability.
CAV 2007: 477-490 |
| 131 | | Denis Gopan,
Thomas W. Reps:
Low-Level Library Analysis and Summarization.
CAV 2007: 68-81 |
| 130 | | Thomas W. Reps,
Akash Lal,
Nicholas Kidd:
Program Analysis Using Weighted Pushdown Systems.
FSTTCS 2007: 23-51 |
| 129 | | Akash Lal,
Nicholas Kidd,
Thomas W. Reps,
Tayssir Touili:
Abstract Error Projection.
SAS 2007: 200-217 |
| 128 | | Denis Gopan,
Thomas W. Reps:
Guided Static Analysis.
SAS 2007: 349-365 |
| 127 | | Gogul Balakrishnan,
Thomas W. Reps:
DIVINE: DIscovering Variables IN Executables.
VMCAI 2007: 1-28 |
| 126 | | Tal Lev-Ami,
Mooly Sagiv,
Neil Immerman,
Thomas W. Reps:
Constructing Specialized Shape Analyses for Uniform Change.
VMCAI 2007: 215-233 |
| 125 | | Greta Yorsh,
Thomas W. Reps,
Mooly Sagiv,
Reinhard Wilhelm:
Logical characterizations of heap abstractions.
ACM Trans. Comput. Log. 8(1): (2007) |
| 2006 |
|---|
| 124 | | Akash Lal,
Thomas W. Reps:
Improving Pushdown System Model Checking.
CAV 2006: 343-357 |
| 123 | | Denis Gopan,
Thomas W. Reps:
Lookahead Widening.
CAV 2006: 452-466 |
| 122 | | Hao Wang,
Somesh Jha,
Thomas W. Reps,
Stefan Schwoon,
Stuart G. Stubblebine:
Reducing the Dependence of SPKI/SDSI on PKI.
ESORICS 2006: 156-173 |
| 121 | | Thomas W. Reps,
Gogul Balakrishnan,
Junghee Lim:
Intermediate-representation recovery from low-level code.
PEPM 2006: 100-111 |
| 120 | | Thomas W. Reps,
Mooly Sagiv,
Jörg Bauer:
An Appreciation of the Work of Reinhard Wilhelm.
Program Analysis and Compilation 2006: 1-11 |
| 119 | | Alexey Loginov,
Thomas W. Reps,
Mooly Sagiv:
Refinement-Based Verification for Possibly-Cyclic Lists.
Program Analysis and Compilation 2006: 247-272 |
| 118 | | Gogul Balakrishnan,
Thomas W. Reps:
Recency-Abstraction for Heap-Allocated Storage.
SAS 2006: 221-239 |
| 117 | | Alexey Loginov,
Thomas W. Reps,
Mooly Sagiv:
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm.
SAS 2006: 261-279 |
| 116 | | Somesh Jha,
Stefan Schwoon,
Hao Wang,
Thomas W. Reps:
Weighted Pushdown Systems and Trust-Management Systems.
TACAS 2006: 1-26 |
| 115 | | Sagar Chaki,
Edmund M. Clarke,
Nicholas Kidd,
Thomas W. Reps,
Tayssir Touili:
Verifying Concurrent Message-Passing C Programs with Recursive Calls.
TACAS 2006: 334-349 |
| 114 | | Junghee Lim,
Thomas W. Reps,
Ben Liblit:
Extracting Output Formats from Executables.
WCRE 2006: 167-178 |
| 113 | | Eran Yahav,
Thomas W. Reps,
Shmuel Sagiv,
Reinhard Wilhelm:
Verifying Temporal Heap Properties Specified via Evolution Logic.
Logic Journal of the IGPL 14(5): 755-783 (2006) |
| 2005 |
|---|
| 112 | | Thomas W. Reps,
Gogul Balakrishnan,
Junghee Lim,
Tim Teitelbaum:
A Next-Generation Platform for Analyzing Executables.
APLAS 2005: 212-229 |
| 111 | | Tal Lev-Ami,
Neil Immerman,
Thomas W. Reps,
Shmuel Sagiv,
Siddharth Srivastava,
Greta Yorsh:
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures.
CADE 2005: 99-115 |
| 110 | | Gogul Balakrishnan,
Thomas W. Reps,
Nicholas Kidd,
Akash Lal,
Junghee Lim,
David Melski,
Radu Gruian,
Suan Hsi Yong,
Chi-Hua Chen,
Tim Teitelbaum:
Model Checking x86 Executables with CodeSurfer/x86 and WPDS++.
CAV 2005: 158-163 |
| 109 | | Akash Lal,
Thomas W. Reps,
Gogul Balakrishnan:
Extended Weighted Pushdown Systems.
CAV 2005: 434-448 |
| 108 | | Alexey Loginov,
Thomas W. Reps,
Shmuel Sagiv:
Abstraction Refinement via Inductive Learning.
CAV 2005: 519-533 |
| 107 | | Gogul Balakrishnan,
Radu Gruian,
Thomas W. Reps,
Tim Teitelbaum:
CodeSurfer/x86-A Platform for Analyzing x86 Executables.
CC 2005: 250-254 |
| 106 | | Vinod Ganapathy,
Sanjit A. Seshia,
Somesh Jha,
Thomas W. Reps,
Randal E. Bryant:
Automatic discovery of API-level exploits.
ICSE 2005: 312-321 |
| 105 | | Noam Rinetzky,
Jörg Bauer,
Thomas W. Reps,
Shmuel Sagiv,
Reinhard Wilhelm:
A semantics for procedure local heaps and its abstractions.
POPL 2005: 296-309 |
| 104 | | Denis Gopan,
Thomas W. Reps,
Shmuel Sagiv:
A framework for numeric analysis of array operations.
POPL 2005: 338-350 |
| 103 | | Bertrand Jeannet,
Denis Gopan,
Thomas W. Reps:
A Relational Abstraction for Functions.
SAS 2005: 186-202 |
| 102 | | Gogul Balakrishnan,
Thomas W. Reps,
David Melski,
Tim Teitelbaum:
WYSINWYX: What You See Is Not What You eXecute.
VSTTE 2005: 202-213 |
| 101 | | Nurit Dor,
John Field,
Denis Gopan,
Tal Lev-Ami,
Alexey Loginov,
Roman Manevich,
G. Ramalingam,
Thomas W. Reps,
Noam Rinetzky,
Mooly Sagiv,
Reinhard Wilhelm,
Eran Yahav,
Greta Yorsh:
Automatic Verification of Strongly Dynamic Software Systems.
VSTTE 2005: 82-92 |
| 100 | | Rajeev Alur,
Michael Benedikt,
Kousha Etessami,
Patrice Godefroid,
Thomas W. Reps,
Mihalis Yannakakis:
Analysis of recursive state machines.
ACM Trans. Program. Lang. Syst. 27(4): 786-818 (2005) |
| 99 | | Greta Yorsh,
Alexey Skidanov,
Thomas W. Reps,
Shmuel Sagiv:
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work.
Electr. Notes Theor. Comput. Sci. 131: 125-138 (2005) |
| 98 | | Thomas W. Reps,
Stefan Schwoon,
Somesh Jha,
David Melski:
Weighted pushdown systems and their application to interprocedural dataflow analysis.
Sci. Comput. Program. 58(1-2): 206-263 (2005) |
| 2004 |
|---|
| 97 | | Thomas W. Reps,
Shmuel Sagiv,
Reinhard Wilhelm:
Static Program Analysis via 3-Valued Logic.
CAV 2004: 15-30 |
| 96 | | Neil Immerman,
Alexander Moshe Rabinovich,
Thomas W. Reps,
Shmuel Sagiv,
Greta Yorsh:
Verification via Structure Simulation.
CAV 2004: 281-294 |
| 95 | | Gogul Balakrishnan,
Thomas W. Reps:
Analyzing Memory Accesses in x86 Executables.
CC 2004: 5-23 |
| 94 | | Neil Immerman,
Alexander Moshe Rabinovich,
Thomas W. Reps,
Shmuel Sagiv,
Greta Yorsh:
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics.
CSL 2004: 160-174 |
| 93 | | Bertrand Jeannet,
Alexey Loginov,
Thomas W. Reps,
Shmuel Sagiv:
A Relational Approach to Interprocedural Shape Analysis.
SAS 2004: 246-264 |
| 92 | | Denis Gopan,
Frank DiMaio,
Nurit Dor,
Thomas W. Reps,
Shmuel Sagiv:
Numeric Domains with Summarized Dimensions.
TACAS 2004: 512-529 |
| 91 | | Greta Yorsh,
Thomas W. Reps,
Shmuel Sagiv:
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis.
TACAS 2004: 530-545 |
| 90 | | Thomas W. Reps,
Shmuel Sagiv,
Greta Yorsh:
Symbolic Implementation of the Best Transformer.
VMCAI 2004: 252-266 |
| 89 | | Somesh Jha,
Thomas W. Reps:
Model checking SPKI/SDSI.
Journal of Computer Security 12(3-4): 317-353 (2004) |
| 2003 |
|---|
| 88 | | David Melski,
Thomas W. Reps:
The Interprocedural Express-Lane Transformation.
CC 2003: 200-216 |
| 87 | | Stefan Schwoon,
Somesh Jha,
Thomas W. Reps,
Stuart G. Stubblebine:
On Generalized Authorization Problems.
CSFW 2003: 202- |
| 86 | | Eran Yahav,
Thomas W. Reps,
Shmuel Sagiv,
Reinhard Wilhelm:
Verifying Temporal Heap Properties Specified via Evolution Logic.
ESOP 2003: 204-222 |
| 85 | | Thomas W. Reps,
Shmuel Sagiv,
Alexey Loginov:
Finite Differencing of Logical Formulas for Static Analysis.
ESOP 2003: 380-398 |
| 84 | | Thomas W. Reps,
Stefan Schwoon,
Somesh Jha:
Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis.
SAS 2003: 189-213 |
| 83 | | Greta Yorsh,
Thomas W. Reps,
Shmuel Sagiv,
Reinhard Wilhelm:
Logical Characterizations of Heap Abstractions
CoRR cs.LO/0312014: (2003) |
| 82 | | Thomas W. Reps,
Louis B. Rall:
Computational Divided Differencing and Divided-Difference Arithmetics.
Higher-Order and Symbolic Computation 16(1-2): 93-149 (2003) |
| 81 | | Paul Anderson,
Thomas W. Reps,
Tim Teitelbaum,
Mark Zarins:
Tool Support for Fine-Grained Software Inspection.
IEEE Software 20(4): 42-50 (2003) |
| 80 | | Paul Anderson,
Thomas W. Reps,
Tim Teitelbaum:
Design and Implementation of a Fine-Grained Software Inspection Tool.
IEEE Trans. Software Eng. 29(8): 721-733 (2003) |
| 2002 |
|---|
| 79 | | Somesh Jha,
Thomas W. Reps:
Analysis of SPKI/SDSI Certificates Using Model Checking.
CSFW 2002: 129- |
| 78 | | Thomas W. Reps,
Alexey Loginov,
Shmuel Sagiv:
Semantic Minimization of 3-Valued Propositional Formulae.
LICS 2002: 40- |
| 77 | | Thomas W. Reps:
Static Program Analysis via 3-Valued Logic.
SAS 2002: 1 |
| 76 | | Reinhard Wilhelm,
Thomas W. Reps,
Shmuel Sagiv:
Shape Analysis and Applications.
The Compiler Design Handbook 2002: 175-218 |
| 75 | | Shmuel Sagiv,
Thomas W. Reps,
Reinhard Wilhelm:
Parametric shape analysis via 3-valued logic.
ACM Trans. Program. Lang. Syst. 24(3): 217-298 (2002) |
| 74 | | Edmund M. Clarke,
Masahiro Fujita,
Sreeranga P. Rajan,
Thomas W. Reps,
Subash Shankar,
Tim Teitelbaum:
Program slicing for VHDL.
STTT 4(1): 125-137 (2002) |
| 2001 |
|---|
| 73 | | Zhichen Xu,
Thomas W. Reps,
Barton P. Miller:
Typestate Checking of Machine Code.
ESOP 2001: 335-351 |
| 72 | | Alexey Loginov,
Suan Hsi Yong,
Susan Horwitz,
Thomas W. Reps:
Debugging via Run-Time Type Checking.
FASE 2001: 217-232 |
| 71 | | Michael Benedikt,
Patrice Godefroid,
Thomas W. Reps:
Model Checking of Unrestricted Hierarchical State Machines.
ICALP 2001: 652-666 |
| 2000 |
|---|
| 70 | | Reinhard Wilhelm,
Shmuel Sagiv,
Thomas W. Reps:
Shape Analysis.
CC 2000: 1-17 |
| 69 | | Tal Lev-Ami,
Thomas W. Reps,
Shmuel Sagiv,
Reinhard Wilhelm:
Putting static analysis to work for verification: A case study.
ISSTA 2000: 26-38 |
| 68 | | Zhichen Xu,
Barton P. Miller,
Thomas W. Reps:
Safety checking of machine code.
PLDI 2000: 70-82 |
| 67 | | Thomas W. Reps:
Undecidability of context-sensitive data-independence analysis.
ACM Trans. Program. Lang. Syst. 22(1): 162-186 (2000) |
| 66 | | David Melski,
Thomas W. Reps:
Interconvertibility of a class of set constraints and context-free-language reachability.
Theor. Comput. Sci. 248(1-2): 29-98 (2000) |
| 1999 |
|---|
| 65 | | David Melski,
Thomas W. Reps:
Interprocedural Path Profiling.
CC 1999: 47-62 |
| 64 | | Edmund M. Clarke,
Masahiro Fujita,
Sreeranga P. Rajan,
Thomas W. Reps,
Subash Shankar,
Tim Teitelbaum:
Program Slicing of Hardware Description Languages.
CHARME 1999: 298-312 |
| 63 | | Michael Siff,
Satish Chandra,
Thomas Ball,
Krishna Kunchithapadam,
Thomas W. Reps:
Coping with Type Casts in C.
ESEC / SIGSOFT FSE 1999: 180-198 |
| 62 | | Michael Benedikt,
Thomas W. Reps,
Shmuel Sagiv:
A Decidable Logic for Describing Linked Data Structures.
ESOP 1999: 2-19 |
| 61 | | Satish Chandra,
Thomas W. Reps:
Physical Type Checking for C.
PASTE 1999: 66-75 |
| 60 | | Suan Hsi Yong,
Susan Horwitz,
Thomas W. Reps:
Pointer Analysis for Programs with Structures and Casting.
PLDI 1999: 91-103 |
| 59 | | Shmuel Sagiv,
Thomas W. Reps,
Reinhard Wilhelm:
Parametric Shape Analysis via 3-Valued Logic.
POPL 1999: 105-118 |
| 58 | | Michael Siff,
Thomas W. Reps:
Identifying Modules via Concept Analysis.
IEEE Trans. Software Eng. 25(6): 749-768 (1999) |
| 1998 |
|---|
| 57 | | Shmuel Sagiv,
Thomas W. Reps,
Reinhard Wilhelm:
Solving Shape-Analysis Problems in Languages with Destructive Updating.
ACM Trans. Program. Lang. Syst. 20(1): 1-50 (1998) |
| 56 | | Thomas W. Reps:
"Maximal-munch" Tokenization in Linear Time.
ACM Trans. Program. Lang. Syst. 20(2): 259-273 (1998) |
| 55 | | Thomas W. Reps:
Program analysis via graph reachability.
Information & Software Technology 40(11-12): 701-726 (1998) |
| 1997 |
|---|
| 54 | | Thomas W. Reps,
Thomas Ball,
Manuvir Das,
James R. Larus:
The Use of Program Profiling for Software Maintenance with Applications to the Year 2000 Problem.
ESEC / SIGSOFT FSE 1997: 432-449 |
| 53 | | Thomas W. Reps:
The Use of Program Profiling for Software Testing.
GI Jahrestagung 1997: 4-16 |
| 52 | | Michael Siff,
Thomas W. Reps:
Identifying modules via concept analysis.
ICSM 1997: 170-179 |
| 51 | | Thomas W. Reps:
Program Analysis via Graph Reachability.
ILPS 1997: 5-19 |
| 50 | | David Melski,
Thomas W. Reps:
Interconveritibility of Set Constraints and Context-Free Language Reachability.
PEPM 1997: 74-89 |
| 1996 |
|---|
| 49 | | Thomas W. Reps,
Todd Turnidge:
Program Specialization via Program Slicing.
Dagstuhl Seminar on Partial Evaluation 1996: 409-429 |
| 48 | | Shmuel Sagiv,
Thomas W. Reps,
Reinhard Wilhelm:
Solving Shape-Analysis Problems in Languages with Destructive Updating.
POPL 1996: 16-31 |
| 47 | | Michael Siff,
Thomas W. Reps:
Program Generalization for Software Reuse: From C to C++.
SIGSOFT FSE 1996: 135-146 |
| 46 | | Thomas W. Reps:
On the Sequential Nature of Interprocedural Program-Analysis Problems.
Acta Inf. 33(8): 739-757 (1996) |
| 45 | | G. Ramalingam,
Thomas W. Reps:
An Incremental Algorithm for a Generalization of the Shortest-Path Problem.
J. Algorithms 21(2): 267-305 (1996) |
| 44 | | G. Ramalingam,
Thomas W. Reps:
On the Computational Complexity of Dynamic Graph Problems.
Theor. Comput. Sci. 158(1&2): 233-277 (1996) |
| 43 | | Shmuel Sagiv,
Thomas W. Reps,
Susan Horwitz:
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation.
Theor. Comput. Sci. 167(1&2): 131-170 (1996) |
| 1995 |
|---|
| 42 | | Thomas W. Reps:
Shape Analysis as a Generalized Path Problem.
PEPM 1995: 1-11 |
| 41 | | Manuvir Das,
Thomas W. Reps,
Pascal Van Hentenryck:
Semantic Foundations of Binding Time Analysis for Imperative Programs.
PEPM 1995: 100-110 |
| 40 | | Thomas W. Reps,
Susan Horwitz,
Shmuel Sagiv:
Precise Interprocedural Dataflow Analysis via Graph Reachability.
POPL 1995: 49-61 |
| 39 | | Susan Horwitz,
Thomas W. Reps,
Shmuel Sagiv:
Demand Interprocedural Dataflow Analysis.
SIGSOFT FSE 1995: 104-115 |
| 38 | | Thomas W. Reps,
Genevieve Rosay:
Precise Interprocedural Chopping.
SIGSOFT FSE 1995: 41-52 |
| 37 | | Shmuel Sagiv,
Thomas W. Reps,
Susan Horwitz:
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation.
TAPSOFT 1995: 651-665 |
| 36 | | David Binkley,
Susan Horwitz,
Thomas W. Reps:
Program Integration for Languages with Procedure Calls.
ACM Trans. Softw. Eng. Methodol. 4(1): 3-35 (1995) |
| 1994 |
|---|
| 35 | | Thomas W. Reps:
Solving Demand Versions of Interprocedural Analysis Problems.
CC 1994: 389-403 |
| 34 | | G. Ramalingam,
Thomas W. Reps:
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph.
POPL 1994: 287-296 |
| 33 | | Thomas W. Reps,
Susan Horwitz,
Shmuel Sagiv,
Genevieve Rosay:
Speeding up Slicing.
SIGSOFT FSE 1994: 11-20 |
| 32 | | G. Ramalingam,
Thomas W. Reps:
On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem.
Inf. Process. Lett. 51(3): 155-161 (1994) |
| 1993 |
|---|
| 31 | | G. Ramalingam,
Thomas W. Reps:
A Categorized Bibliography on Incremental Computation.
POPL 1993: 502-510 |
| 30 | | Thomas W. Reps:
Scan Grammars: Parallel Attribute Evaluation via Data-Parallelism.
SPAA 1993: 367-376 |
| 29 | | Thomas W. Reps:
Demand Interprocedural Program Analysis Using Logic Databases.
Workshop on Programming with Logic Databases (Book), ILPS 1993: 163-196 |
| 1992 |
|---|
| 28 | | Susan Horwitz,
Thomas W. Reps:
The Use of Program Dependence Graphs in Software Engineering.
ICSE 1992: 392-411 |
| 27 | | Wuu Yang,
Susan Horwitz,
Thomas W. Reps:
A Program Integration Algorithm that Accommodates Semantics-Preserving Transformations.
ACM Trans. Softw. Eng. Methodol. 1(3): 310-354 (1992) |
| 26 | | Paul Klint,
Thomas W. Reps,
Gregor Snelting:
Programming environments: report on an international workshop at Dagstuhl Castle.
SIGPLAN Notices 27(11): 90-96 (1992) |
| 1991 |
|---|
| 25 | | G. Ramalingam,
Thomas W. Reps:
Modification Algebras.
AMAST 1991: 547-558 |
| 24 | | G. Ramalingam,
Thomas W. Reps:
A Theory of Program Modifications.
TAPSOFT, Vol.2 1991: 137-152 |
| 23 | | Susan Horwitz,
Thomas W. Reps:
Efficient Comparison of Program Slices.
Acta Inf. 28(8): 713-732 (1991) |
| 22 | | Thomas W. Reps:
Algebraic Properties of Program Integration.
Sci. Comput. Program. 17(1-3): 139-215 (1991) |
| 1990 |
|---|
| 21 | | Thomas W. Reps:
Algebraic Properties of Program Integration.
ESOP 1990: 326-340 |
| 20 | | Susan Horwitz,
Thomas W. Reps,
David Binkley:
Interprocedural Slicing Using Dependence Graphs.
ACM Trans. Program. Lang. Syst. 12(1): 26-60 (1990) |
| 1989 |
|---|
| 19 | | Susan Horwitz,
Phil Pfeiffer,
Thomas W. Reps:
Dependence Analysis for Pointer Variables.
PLDI 1989: 28-40 |
| 18 | | Thomas W. Reps,
T. Bricker:
Illustrating Interference in Interfering Versions of Programs.
SCM 1989: 46-55 |
| 17 | | Thomas W. Reps,
Wuu Yang:
The Semantics of Program Slicing and Program Integration.
TAPSOFT, Vol.2 1989: 360-374 |
| 16 | | Susan Horwitz,
Jan Prins,
Thomas W. Reps:
Integrating Noninterfering Versions of Programs.
ACM Trans. Program. Lang. Syst. 11(3): 345-387 (1989) |
| 1988 |
|---|
| 15 | | Susan Horwitz,
Thomas W. Reps,
David Binkley:
Interprocedural slicing using dependence graphs (with retrospective)
Best of PLDI 1988: 229-243 |
| 14 | | Thomas W. Reps,
Susan Horwitz:
Semantics-Based Program Integration.
ESOP 1988: 1-20 |
| 13 | | Susan Horwitz,
Thomas W. Reps,
David Binkley:
Interprocedural Slicing Using Dependence Graphs.
PLDI 1988: 35-46 |
| 12 | | Susan Horwitz,
Jan Prins,
Thomas W. Reps:
Integrating Non-Interfering Versions of Programs.
POPL 1988: 133-145 |
| 11 | | Susan Horwitz,
Jan Prins,
Thomas W. Reps:
On the Adequacy of Program Dependence Graphs for Representing Programs.
POPL 1988: 146-157 |
| 10 | | Thomas W. Reps,
Susan Horwitz,
Jan Prins:
Support for Integrating Program Variants in an Environment for Programming in the Large.
SCM 1988: 197-216 |
| 9 | | Thomas W. Reps:
Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications.
Acta Inf. 25(2): 155-178 (1988) |
| 1987 |
|---|
| 8 | | Thomas W. Reps,
Alan J. Demers:
Sublinear-Space Evaluation Algorithms for Attribute Grammars.
ACM Trans. Program. Lang. Syst. 9(3): 408-440 (1987) |
| 1986 |
|---|
| 7 | | Thomas W. Reps,
Carla Marceau,
Tim Teitelbaum:
Remote Attribute Updating for Language-Based Editors.
POPL 1986: 1-13 |
| 1984 |
|---|
| 6 | | Thomas W. Reps,
Bowen Alpern:
Interactive Proof Checking.
POPL 1984: 36-45 |
| 5 | | Thomas W. Reps,
Tim Teitelbaum:
The Synthesizer Generator.
Software Development Environments (SDE) 1984: 42-48 |
| 1983 |
|---|
| 4 | | Thomas W. Reps,
Tim Teitelbaum,
Alan J. Demers:
Incremental Context-Dependent Analysis for Language-Based Editors.
ACM Trans. Program. Lang. Syst. 5(3): 449-477 (1983) |
| 1982 |
|---|
| 3 | | Thomas W. Reps:
Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors.
POPL 1982: 169-176 |
| 1981 |
|---|
| 2 | | Alan J. Demers,
Thomas W. Reps,
Tim Teitelbaum:
Incremental Evaluation for Attribute Grammars with Application to Syntax-Directed Editors.
POPL 1981: 105-116 |
| 1 | | Tim Teitelbaum,
Thomas W. Reps:
The Cornell Program Synthesizer: A Syntax-Directed Programming Environment.
Commun. ACM 24(9): 563-573 (1981) |
