Incremental Evaluation for Attribute Grammars with Application to Syntax-Directed Editors. - Alan J. Demers; Thomas W. Reps; Tim Teitelbaum (POPL, 1981)

The Cornell Program Synthesizer: A Syntax-Directed Programming Environment. - Tim Teitelbaum; Thomas W. Reps (Commun. ACM, 1981)

The why and wherefore of the Cornell Program Synthesizer. - Tim Teitelbaum; Thomas W. Reps; Susan Horwitz (SIGPLAN SIGOA Symposium on Text Manipulation, 1981)

Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors. - Thomas W. Reps (POPL, 1982)

Generating Language-Based Environments. - Thomas W. Reps (1982)

Incremental Context-Dependent Analysis for Language-Based Editors. - Thomas W. Reps; Tim Teitelbaum; Alan J. Demers (ACM Trans. Program. Lang. Syst., 1983)

Generating Language-Based Environments. - Thomas W. Reps (MIT Press, 1984)

Interactive Proof Checking. - Thomas W. Reps; Bowen Alpern (POPL, 1984)

The Synthesizer Generator. - Thomas W. Reps; Tim Teitelbaum (Software Development Environments (SDE), 1984)

Remote Attribute Updating for Language-Based Editors. - Thomas W. Reps; Carla Marceau; Tim Teitelbaum (POPL, 1986)

Language Processing in Program Editors. - Thomas W. Reps; Tim Teitelbaum (Computer, 1987)

Sublinear-Space Evaluation Algorithms for Attribute Grammars. - Thomas W. Reps; Alan J. Demers (ACM Trans. Program. Lang. Syst., 1987)

Semantics-Based Program Integration. - Thomas W. Reps; Susan Horwitz (ESOP, 1988)

Interprocedural slicing using dependence graphs (with retrospective) - Susan Horwitz; Thomas W. Reps; David W. Binkley (Best of PLDI, 1988)

Integrating Non-Interfering Versions of Programs. - Susan Horwitz; Jan F. Prins; Thomas W. Reps (POPL, 1988)

On the Adequacy of Program Dependence Graphs for Representing Programs. - Susan Horwitz; Jan F. Prins; Thomas W. Reps (POPL, 1988)

Support for Integrating Program Variants in an Environment for Programming in the Large. - Thomas W. Reps; Susan Horwitz; Jan F. Prins (SCM, 1988)

Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications. - Thomas W. Reps (Acta Informatica, 1988)

The Synthesizer Generator Reference Manual, Third Edition. - Thomas W. Reps; Tim Teitelbaum (Springer, 1989)

The Synthesizer Generator - A System for Constructing Language-Based Editors. - Thomas W. Reps; Tim Teitelbaum (Springer, 1989)

Dependence Analysis for Pointer Variables. - Susan Horwitz; Phil Pfeiffer; Thomas W. Reps (PLDI, 1989)

Illustrating Interference in Interfering Versions of Programs. - Thomas W. Reps; T. Bricker (SCM, 1989)

The Semantics of Program Slicing and Program Integration. - Thomas W. Reps; Wuu Yang (TAPSOFT, Vol.2, 1989)

Integrating Noninterfering Versions of Programs. - Susan Horwitz; Jan F. Prins; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 1989)

Interprocedural Slicing Using Dependence Graphs. - Susan Horwitz; Thomas W. Reps; David W. Binkley (ACM Trans. Program. Lang. Syst., 1990)

Modification Algebras. - G. Ramalingam; Thomas W. Reps (AMAST, 1991)

A Theory of Program Modifications. - G. Ramalingam; Thomas W. Reps (TAPSOFT, Vol.2, 1991)

Efficient Comparison of Program Slices. - Susan Horwitz; Thomas W. Reps (Acta Informatica, 1991)

Algebraic Properties of Program Integration. - Thomas W. Reps (Sci. Comput. Program., 1991)

The Use of Program Dependence Graphs in Software Engineering. - Susan Horwitz; Thomas W. Reps (ICSE, 1992)

Programming environments: report on an international workshop at Dagstuhl Castle. - Paul Klint; Thomas W. Reps; Gregor Snelting (ACM SIGPLAN Notices, 1992)

A Program Integration Algorithm that Accommodates Semantics-Preserving Transformations. - Wuu Yang; Susan Horwitz; Thomas W. Reps (ACM Trans. Softw. Eng. Methodol., 1992)

Demand Interprocedural Program Analysis Using Logic Databases. - Thomas W. Reps (Workshop on Programming with Logic Databases (Book), ILPS, 1993)

A Categorized Bibliography on Incremental Computation. - G. Ramalingam; Thomas W. Reps (POPL, 1993)

Scan Grammars: Parallel Attribute Evaluation via Data-Parallelism. - Thomas W. Reps (SPAA, 1993)

Solving Demand Versions of Interprocedural Analysis Problems. - Thomas W. Reps (CC, 1994)

An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph. - G. Ramalingam; Thomas W. Reps (POPL, 1994)

Speeding up Slicing. - Thomas W. Reps; Susan Horwitz; Shmuel Sagiv; Genevieve Rosay (SIGSOFT FSE, 1994)

On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. - G. Ramalingam; Thomas W. Reps (Inf. Process. Lett., 1994)

Semantic Foundations of Binding Time Analysis for Imperative Programs. - Manuvir Das; Thomas W. Reps; Pascal Van Hentenryck (PEPM, 1995)

Shape Analysis as a Generalized Path Problem. - Thomas W. Reps (PEPM, 1995)

Precise Interprocedural Dataflow Analysis via Graph Reachability. - Thomas W. Reps; Susan Horwitz; Shmuel Sagiv (POPL, 1995)

Demand Interprocedural Dataflow Analysis. - Susan Horwitz; Thomas W. Reps; Shmuel Sagiv (SIGSOFT FSE, 1995)

Precise Interprocedural Chopping. - Thomas W. Reps; Genevieve Rosay (SIGSOFT FSE, 1995)

Program Integration for Languages with Procedure Calls. - David W. Binkley; Susan Horwitz; Thomas W. Reps (ACM Trans. Softw. Eng. Methodol., 1995)

Program Specialization via Program Slicing. - Thomas W. Reps; Todd Turnidge (Dagstuhl Seminar on Partial Evaluation, 1996)

Program Generalization for Software Reuse: From C to C++. - Michael Siff; Thomas W. Reps (SIGSOFT FSE, 1996)

On the Sequential Nature of Interprocedural Program-Analysis Problems. - Thomas W. Reps (Acta Informatica, 1996)

An Incremental Algorithm for a Generalization of the Shortest-Path Problem. - G. Ramalingam; Thomas W. Reps (J. Algorithms, 1996)

On the Computational Complexity of Dynamic Graph Problems. - G. Ramalingam; Thomas W. Reps (Theor. Comput. Sci., 1996)

Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. - Shmuel Sagiv; Thomas W. Reps; Susan Horwitz (Theor. Comput. Sci., 1996)

The Use of Program Profiling for Software Maintenance with Applications to the Year 2000 Problem. - Thomas W. Reps; Thomas Ball 001; Manuvir Das; James R. Larus (ESEC / SIGSOFT FSE, 1997)

The Use of Program Profiling for Software Testing. - Thomas W. Reps (GI Jahrestagung, 1997)

Interconveritibility of Set Constraints and Context-Free Language Reachability. - David Melski; Thomas W. Reps (PEPM, 1997)

Program analysis via graph reachability. - Thomas W. Reps (Inf. Softw. Technol., 1998)

Program comprehension and software reengineering. - Hausi A. Müller; Thomas W. Reps; Gregor Snelting (ACM SIGSOFT Softw. Eng. Notes, 1998)

"Maximal-munch" Tokenization in Linear Time. - Thomas W. Reps (ACM Trans. Program. Lang. Syst., 1998)

Solving Shape-Analysis Problems in Languages with Destructive Updating. - Shmuel Sagiv; Thomas W. Reps; Reinhard Wilhelm (ACM Trans. Program. Lang. Syst., 1998)

Interprocedural Path Profiling. - David Melski; Thomas W. Reps (CC, 1999)

Program Slicing of Hardware Description Languages. - Edmund M. Clarke; Masahiro Fujita; Sreeranga P. Rajan; Thomas W. Reps; Subash Shankar; Tim Teitelbaum (CHARME, 1999)

Coping with Type Casts in C. - Michael Siff; Satish Chandra 001; Thomas Ball 001; Krishna Kunchithapadam; Thomas W. Reps (ESEC / SIGSOFT FSE, 1999)

A Decidable Logic for Describing Linked Data Structures. - Michael Benedikt; Thomas W. Reps; Shmuel Sagiv (ESOP, 1999)

Pointer Analysis for Programs with Structures and Casting. - Suan Hsi Yong; Susan Horwitz; Thomas W. Reps (PLDI, 1999)

Physical type checking for C. - Satish Chandra 001; Thomas W. Reps (ACM SIGSOFT Softw. Eng. Notes, 1999)

Identifying Modules via Concept Analysis. - Michael Siff; Thomas W. Reps (IEEE Trans. Software Eng., 1999)

Shape Analysis. - Reinhard Wilhelm; Shmuel Sagiv; Thomas W. Reps (CC, 2000)

Putting static analysis to work for verification: A case study. - Tal Lev-Ami; Thomas W. Reps; Shmuel Sagiv; Reinhard Wilhelm (ISSTA, 2000)

Safety checking of machine code. - Zhichen Xu; Barton P. Miller; Thomas W. Reps (PLDI, 2000)

Interconvertibility of a class of set constraints and context-free-language reachability. - David Melski; Thomas W. Reps (Theor. Comput. Sci., 2000)

Undecidability of context-sensitive data-independence analysis. - Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2000)

Algorithmic Differencing. - Louis B. Rall; Thomas W. Reps (Perspectives on Enclosure Methods, 2001)

Typestate Checking of Machine Code. - Zhichen Xu; Thomas W. Reps; Barton P. Miller (ESOP, 2001)

Debugging via Run-Time Type Checking. - Alexey Loginov; Suan Hsi Yong; Susan Horwitz; Thomas W. Reps (FASE, 2001)

Model Checking of Unrestricted Hierarchical State Machines. - Michael Benedikt; Patrice Godefroid; Thomas W. Reps (ICALP, 2001)

Shape Analysis and Applications. - Reinhard Wilhelm; Thomas W. Reps; Shmuel Sagiv (The Compiler Design Handbook, 2002)

Static Program Analysis via 3-Valued Logic. - Thomas W. Reps (APPIA-GULP-PRODE, 2002)

Analysis of SPKI/SDSI Certificates Using Model Checking. - Somesh Jha; Thomas W. Reps (CSFW, 2002)

Semantic Minimization of 3-Valued Propositional Formulae. - Thomas W. Reps; Alexey Loginov; Shmuel Sagiv (LICS, 2002)

Program slicing for VHDL. - Edmund M. Clarke; Masahiro Fujita; Sreeranga P. Rajan; Thomas W. Reps; Subash Shankar; Tim Teitelbaum (Int. J. Softw. Tools Technol. Transf., 2002)

Parametric shape analysis via 3-valued logic. - Shmuel Sagiv; Thomas W. Reps; Reinhard Wilhelm (ACM Trans. Program. Lang. Syst., 2002)

The Interprocedural Express-Lane Transformation. - David Melski; Thomas W. Reps (CC, 2003)

On Generalized Authorization Problems. - Stefan Schwoon; Somesh Jha; Thomas W. Reps; Stuart G. Stubblebine (CSFW, 2003)

Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis. - Thomas W. Reps; Stefan Schwoon; Somesh Jha (SAS, 2003)

Computational Divided Differencing and Divided-Difference Arithmetics. - Thomas W. Reps; Louis B. Rall (High. Order Symb. Comput., 2003)

Tool Support for Fine-Grained Software Inspection. - Paul Anderson; Thomas W. Reps; Tim Teitelbaum; Mark Zarins (IEEE Softw., 2003)

Design and Implementation of a Fine-Grained Software Inspection Tool. - Paul Anderson; Thomas W. Reps; Tim Teitelbaum (IEEE Trans. Software Eng., 2003)

Verification via Structure Simulation. - Neil Immerman; Alexander Moshe Rabinovich; Thomas W. Reps; Shmuel Sagiv; Greta Yorsh (CAV, 2004)

Static Program Analysis via 3-Valued Logic. - Thomas W. Reps; Shmuel Sagiv; Reinhard Wilhelm (CAV, 2004)

Analyzing Memory Accesses in x86 Executables. - Gogul Balakrishnan; Thomas W. Reps (CC, 2004)

The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. - Neil Immerman; Alexander Moshe Rabinovich; Thomas W. Reps; Shmuel Sagiv; Greta Yorsh (CSL, 2004)

Numeric Domains with Summarized Dimensions. - Denis Gopan; Frank DiMaio; Nurit Dor; Thomas W. Reps; Shmuel Sagiv (TACAS, 2004)

Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. - Greta Yorsh; Thomas W. Reps; Shmuel Sagiv (TACAS, 2004)

Symbolic Implementation of the Best Transformer. - Thomas W. Reps; Shmuel Sagiv; Greta Yorsh (VMCAI, 2004)

Model checking SPKI/SDSI. - Somesh Jha; Thomas W. Reps (J. Comput. Secur., 2004)

A Next-Generation Platform for Analyzing Executables. - Thomas W. Reps; Gogul Balakrishnan; Junghee Lim; Tim Teitelbaum (APLAS, 2005)

Model Checking x86 Executables with CodeSurfer/x86 and WPDS++. - Gogul Balakrishnan; Thomas W. Reps; Nicholas Kidd; Akash Lal; Junghee Lim; David Melski; Radu Gruian; Suan Hsi Yong; Chi-Hua Chen; Tim Teitelbaum (CAV, 2005)

Extended Weighted Pushdown Systems. - Akash Lal; Thomas W. Reps; Gogul Balakrishnan (CAV, 2005)

Abstraction Refinement via Inductive Learning. - Alexey Loginov; Thomas W. Reps; Shmuel Sagiv (CAV, 2005)

CodeSurfer/x86-A Platform for Analyzing x86 Executables. - Gogul Balakrishnan; Radu Gruian; Thomas W. Reps; Tim Teitelbaum (CC, 2005)

Automatic discovery of API-level exploits. - Vinod Ganapathy; Sanjit A. Seshia; Somesh Jha; Thomas W. Reps; Randal E. Bryant (ICSE, 2005)

A framework for numeric analysis of array operations. - Denis Gopan; Thomas W. Reps; Shmuel Sagiv (POPL, 2005)

A semantics for procedure local heaps and its abstractions. - Noam Rinetzky; Jörg Bauer 001; Thomas W. Reps; Shmuel Sagiv; Reinhard Wilhelm (POPL, 2005)

A Relational Abstraction for Functions. - Bertrand Jeannet; Denis Gopan; Thomas W. Reps (SAS, 2005)

WYSINWYX: What You See Is Not What You eXecute. - Gogul Balakrishnan; Thomas W. Reps; David Melski; Tim Teitelbaum (VSTTE, 2005)

Automatic Verification of Strongly Dynamic Software Systems. - 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; et al. (VSTTE, 2005)

Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. - Greta Yorsh; Alexey Skidanov; Thomas W. Reps; Shmuel Sagiv (AIOOL@VMCAI, 2005)

Weighted pushdown systems and their application to interprocedural dataflow analysis. - Thomas W. Reps; Stefan Schwoon; Somesh Jha; David Melski (Sci. Comput. Program., 2005)

Analysis of recursive state machines. - Rajeev Alur; Michael Benedikt; Kousha Etessami; Patrice Godefroid; Thomas W. Reps; Mihalis Yannakakis (ACM Trans. Program. Lang. Syst., 2005)

Refinement-Based Verification for Possibly-Cyclic Lists. - Alexey Loginov; Thomas W. Reps; Mooly Sagiv (Program Analysis and Compilation, 2006)

An Appreciation of the Work of Reinhard Wilhelm. - Thomas W. Reps; Mooly Sagiv; Jörg Bauer 001 (Program Analysis and Compilation, 2006)

Lookahead Widening. - Denis Gopan; Thomas W. Reps (CAV, 2006)

Improving Pushdown System Model Checking. - Akash Lal; Thomas W. Reps (CAV, 2006)

Reducing the Dependence of SPKI/SDSI on PKI. - Hao Wang 112; Somesh Jha; Thomas W. Reps; Stefan Schwoon; Stuart G. Stubblebine (ESORICS, 2006)

Intermediate-representation recovery from low-level code. - Thomas W. Reps; Gogul Balakrishnan; Junghee Lim (PEPM, 2006)

Recency-Abstraction for Heap-Allocated Storage. - Gogul Balakrishnan; Thomas W. Reps (SAS, 2006)

Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm. - Alexey Loginov; Thomas W. Reps; Mooly Sagiv (SAS, 2006)

Verifying Concurrent Message-Passing C Programs with Recursive Calls. - Sagar Chaki; Edmund M. Clarke; Nicholas Kidd; Thomas W. Reps; Tayssir Touili (TACAS, 2006)

Weighted Pushdown Systems and Trust-Management Systems. - Somesh Jha; Stefan Schwoon; Hao Wang 112; Thomas W. Reps (TACAS, 2006)

Extracting Output Formats from Executables. - Junghee Lim; Thomas W. Reps; Ben Liblit (WCRE, 2006)

Verifying Temporal Heap Properties Specified via Evolution Logic. - Eran Yahav; Thomas W. Reps; Shmuel Sagiv; Reinhard Wilhelm (Log. J. IGPL, 2006)

Shape Analysis and Applications. - Thomas W. Reps; Mooly Sagiv; Reinhard Wilhelm (The Compiler Design Handbook, 2nd ed., 2007)

Labelled Clauses. - Tal Lev-Ami; Christoph Weidenbach; Thomas W. Reps; Mooly Sagiv (CADE, 2007)

Comparison Under Abstraction for Verifying Linearizability. - Daphna Amit; Noam Rinetzky; Thomas W. Reps; Mooly Sagiv; Eran Yahav (CAV, 2007)

Revamping TVLA: Making Parametric Shape Analysis Competitive. - Igor Bogudlov; Tal Lev-Ami; Thomas W. Reps; Mooly Sagiv (CAV, 2007)

Low-Level Library Analysis and Summarization. - Denis Gopan; Thomas W. Reps (CAV, 2007)

Program Analysis Using Weighted Pushdown Systems. - Thomas W. Reps; Akash Lal; Nicholas Kidd (FSTTCS, 2007)

Guided Static Analysis. - Denis Gopan; Thomas W. Reps (SAS, 2007)

Abstract Error Projection. - Akash Lal; Nicholas Kidd; Thomas W. Reps; Tayssir Touili (SAS, 2007)

DIVINE: DIscovering Variables IN Executables. - Gogul Balakrishnan; Thomas W. Reps (VMCAI, 2007)

Constructing Specialized Shape Analyses for Uniform Change. - Tal Lev-Ami; Mooly Sagiv; Neil Immerman; Thomas W. Reps (VMCAI, 2007)

Logical characterizations of heap abstractions. - Greta Yorsh; Thomas W. Reps; Mooly Sagiv; Reinhard Wilhelm (ACM Trans. Comput. Log., 2007)

A Next-Generation Platform for Analyzing Executables. - Thomas W. Reps; Gogul Balakrishnan; Junghee Lim; Tim Teitelbaum (Malware Detection, 2007)

A System for Generating Static Analyzers for Machine Instructions. - Junghee Lim; Thomas W. Reps (CC, 2008)

Improved Memory-Access Analysis for x86 Executables. - Thomas W. Reps; Gogul Balakrishnan (CC, 2008)

Language Strength Reduction. - Nicholas Kidd; Akash Lal; Thomas W. Reps (SAS, 2008)

Solving Multiple Dataflow Queries Using WPDSs. - Akash Lal; Thomas W. Reps (SAS, 2008)

Analyzing Stripped Device-Driver Executables. - Gogul Balakrishnan; Thomas W. Reps (TACAS, 2008)

Interprocedural Analysis of Concurrent Programs Under a Context Bound. - Akash Lal; Tayssir Touili; Nicholas Kidd; Thomas W. Reps (TACAS, 2008)

Verifying Information Flow Control over Unbounded Processes. - William R. Harris; Nicholas Kidd; Sagar Chaki; Somesh Jha; Thomas W. Reps (FM, 2009)

Simulating reachability using first-order logic with applications to verification of linked data structures - Tal Lev-Ami; Neil Immerman; Thomas W. Reps; Mooly Sagiv; Siddharth Srivastava 001; Greta Yorsh (Log. Methods Comput. Sci., 2009)

Reducing concurrent analysis under a context bound to sequential analysis. - Akash Lal; Thomas W. Reps (Formal Methods Syst. Des., 2009)

There's Plenty of Room at the Bottom: Analyzing and Verifying Machine Code. - Thomas W. Reps; Junghee Lim; Aditya V. Thakur; Gogul Balakrishnan; Akash Lal (CAV, 2010)

Directed Proof Generation for Machine Code. - Aditya V. Thakur; Junghee Lim; Akash Lal; Amanda Burton; Evan Driscoll; Matt Elder; Tycho Andersen; Thomas W. Reps (CAV, 2010)

DIFC programs by automatic instrumentation. - William R. Harris; Somesh Jha; Thomas W. Reps (CCS, 2010)

Statically Inferring Complex Heap, Array, and Numeric Invariants. - Bill McCloskey; Thomas W. Reps; Mooly Sagiv (SAS, 2010)

View-Augmented Abstractions. - Matt Elder; Denis Gopan; Thomas W. Reps (NSAD@SAS, 2010)

WYSINWYX: What you see is not what you eXecute. - Gogul Balakrishnan; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2010)

A relational approach to interprocedural shape analysis. - Bertrand Jeannet; Alexey Loginov; Thomas W. Reps; Mooly Sagiv (ACM Trans. Program. Lang. Syst., 2010)

Finite differencing of logical formulas for static analysis. - Thomas W. Reps; Mooly Sagiv; Alexey Loginov (ACM Trans. Program. Lang. Syst., 2010)

Analysis Techniques for Information Security - Anupam Datta; Somesh Jha; Ninghui Li; David Melski; Thomas W. Reps (Morgan & Claypool Publishers, 2010)

ConSeq: detecting concurrency bugs through sequential errors. - Wei Zhang 022; Junghee Lim; Ramya Olichandran; Joel Scherpelz; Guoliang Jin; Shan Lu 001; Thomas W. Reps (ASPLOS, 2011)

Checking conformance of a producer and a consumer. - Evan Driscoll; Amanda Burton; Thomas W. Reps (SIGSOFT FSE, 2011)

A decision procedure for detecting atomicity violations for communicating processes with locks. - Nicholas Kidd; Peter Lammich; Tayssir Touili; Thomas W. Reps (Int. J. Softw. Tools Technol. Transf., 2011)

Finding concurrency-related bugs using random isolation. - Nicholas Kidd; Thomas W. Reps; Julian Dolby; Mandana Vaziri (Int. J. Softw. Tools Technol. Transf., 2011)

Symbolic analysis via semantic reinterpretation. - Junghee Lim; Akash Lal; Thomas W. Reps (Int. J. Softw. Tools Technol. Transf., 2011)

OpenNWA: A Nested-Word Automaton Library. - Evan Driscoll; Aditya V. Thakur; Thomas W. Reps (CAV, 2012)

Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement. - Matthew Fredrikson; Richard Joiner; Somesh Jha; Thomas W. Reps; Phillip A. Porras; Hassen Saïdi; Vinod Yegneswaran (CAV, 2012)

Secure Programming via Visibly Pushdown Safety Games. - William R. Harris; Somesh Jha; Thomas W. Reps (CAV, 2012)

A Method for Symbolic Computation of Abstract Operations. - Aditya V. Thakur; Thomas W. Reps (CAV, 2012)

Bilateral Algorithms for Symbolic Abstraction. - Aditya V. Thakur; Matt Elder; Thomas W. Reps (SAS, 2012)

A Generalization of Stålmarck's Method. - Aditya V. Thakur; Thomas W. Reps (SAS, 2012)

Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051). - Andy King; Alan Mycroft; Thomas W. Reps; Axel Simon (Dagstuhl Reports, 2012)

Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs. - Jörg Kreiker; Thomas W. Reps; Noam Rinetzky; Mooly Sagiv; Reinhard Wilhelm; Eran Yahav (Programming Logics, 2013)

Secure programs via game-based synthesis. - Somesh Jha; Thomas W. Reps; William R. Harris (FMCAD, 2013)

Declarative, Temporal, and Practical Programming with Capabilities. - William R. Harris; Somesh Jha; Thomas W. Reps; Jonathan Anderson; Robert N. M. Watson (IEEE Symposium on Security and Privacy, 2013)

PostHat and All That: Automating Abstract Interpretation. - Aditya V. Thakur; Akash Lal; Junghee Lim; Thomas W. Reps (TAPAS@SAS, 2013)

TSL: A System for Generating Abstract Interpreters and its Application to Machine-Code Analysis. - Junghee Lim; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2013)

ConMem: Detecting Crash-Triggering Concurrency Bugs through an Effect-Oriented Approach. - Wei Zhang 022; Chong Sun; Junghee Lim; Shan Lu 001; Thomas W. Reps (ACM Trans. Softw. Eng. Methodol., 2013)

Property-Directed Shape Analysis. - Shachar Itzhaky; Nikolaj S. Bjørner; Thomas W. Reps; Mooly Sagiv; Aditya V. Thakur (CAV, 2014)

Recovery of Class Hierarchies and Composition Relationships from Machine Code. - Venkatesh Srinivasan; Thomas W. Reps (CC, 2014)

Efficient runtime-enforcement techniques for policy weaving. - Richard Joiner; Thomas W. Reps; Somesh Jha; Mohan Dhawan; Vinod Ganapathy (SIGSOFT FSE, 2014)

Satisfiability modulo abstraction for separation logic with linked lists. - Aditya V. Thakur; Jason Breck; Thomas W. Reps (SPIN, 2014)

Decision Procedures and Abstract Interpretation (Dagstuhl Seminar 14351). - Daniel Kroening; Thomas W. Reps; Sanjit A. Seshia; Aditya V. Thakur (Dagstuhl Reports, 2014)

Specialization Slicing. - Min Aung; Susan Horwitz; Richard Joiner; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2014)

Abstract Domains of Affine Relations. - Matt Elder; Junghee Lim; Tushar Sharma 003; Tycho Andersen; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2014)

Recovering execution data from incomplete observations. - Peter Ohmann; David Bingham Brown; Ben Liblit; Thomas W. Reps (WODA@SPLASH, 2015)

Partial evaluation of machine code. - Venkatesh Srinivasan; Thomas W. Reps (OOPSLA, 2015)

Synthesis of machine code from semantics. - Venkatesh Srinivasan; Thomas W. Reps (PLDI, 2015)

An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs. - Antoine Miné; Jason Breck; Thomas W. Reps (ESOP, 2016)

An improved algorithm for slicing machine code. - Venkatesh Srinivasan; Thomas W. Reps (OOPSLA, 2016)

Speeding up machine-code synthesis. - Venkatesh Srinivasan; Tushar Sharma 003; Thomas W. Reps (OOPSLA, 2016)

Automating Abstract Interpretation. - Thomas W. Reps; Aditya V. Thakur (VMCAI, 2016)

Automated Resource Analysis with Coq Proof Objects. - Quentin Carbonneaux; Jan Hoffmann 002; Thomas W. Reps; Zhong Shao 001 (CAV (2), 2017)

Compositional recurrence analysis revisited. - Zachary Kincaid; Jason Breck; Ashkan Forouhi Boroujeni; Thomas W. Reps (PLDI, 2017)

Component-based synthesis for complex APIs. - Yu Feng 001; Ruben Martins; Yuepeng Wang 001; Isil Dillig; Thomas W. Reps (POPL, 2017)

The care and feeding of wild-caught mutants. - David Bingham Brown; Michael Vaughn; Ben Liblit; Thomas W. Reps (ESEC/SIGSOFT FSE, 2017)

Sound Bit-Precise Numerical Domains. - Tushar Sharma 003; Thomas W. Reps (VMCAI, 2017)

Neural Attribute Machines for Program Generation. - Matthew Amodio; Swarat Chaudhuri; Thomas W. Reps (CoRR, 2017)

Source Forager: A Search Engine for Similar Source Code. - Vineeth Kashyap; David Bingham Brown; Ben Liblit; David Melski; Thomas W. Reps (CoRR, 2017)

Program synthesis for interactive-security systems. - William R. Harris; Somesh Jha; Thomas W. Reps; Sanjit A. Seshia (Formal Methods Syst. Des., 2017)

Model-assisted machine-code synthesis. - Venkatesh Srinivasan; Ara Vartanian; Thomas W. Reps (Proc. ACM Program. Lang., 2017)

Newtonian Program Analysis via Tensor Product. - Thomas W. Reps; Emma Turetsky; Prathmesh Prabhu (ACM Trans. Program. Lang. Syst., 2017)

Program Analyses Using Newton's Method (Invited Paper). - Thomas W. Reps (NETYS, 2018)

PMAF: an algebraic framework for static analysis of probabilistic programs. - Di Wang 017; Jan Hoffmann 002; Thomas W. Reps (PLDI, 2018)

Code vectors: understanding programs through embedded abstracted symbolic traces. - Jordan Henkel; Shuvendu K. Lahiri; Ben Liblit; Thomas W. Reps (ESEC/SIGSOFT FSE, 2018)

Non-linear reasoning for invariant synthesis. - Zachary Kincaid; John Cyphert; Jason Breck; Thomas W. Reps (Proc. ACM Program. Lang., 2018)

Artifact for Code Vectors: Understanding Programs Through Embedded Abstracted Symbolic Traces. - Jordan Henkel; Shuvendu K. Lahiri; Ben Liblit; Thomas W. Reps (Zenodo, 2018)

Artifact for Code Vectors: Understanding Programs Through Embedded Abstracted Symbolic Traces. - Jordan Henkel; Shuvendu K. Lahiri; Ben Liblit; Thomas W. Reps (Zenodo, 2018)

Artifact for Code Vectors: Understanding Programs Through Embedded Abstracted Symbolic Traces. - Jordan Henkel; Shuvendu K. Lahiri; Ben Liblit; Thomas W. Reps (Zenodo, 2018)

Proving Unrealizability for Syntax-Guided Synthesis. - Qinheping Hu; Jason Breck; John Cyphert; Loris D'Antoni; Thomas W. Reps (CAV (1), 2019)

Enabling Open-World Specification Mining via Unsupervised Learning. - Jordan Henkel; Shuvendu K. Lahiri; Ben Liblit; Thomas W. Reps (CoRR, 2019)

A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism. - Di Wang 017; Jan Hoffmann 002; Thomas W. Reps (MFPS, 2019)

A new abstraction framework for affine transformers. - Tushar Sharma 003; Thomas W. Reps (Formal Methods Syst. Des., 2019)

Refinement of path expressions for static analysis. - John Cyphert; Jason Breck; Zachary Kincaid; Thomas W. Reps (Proc. ACM Program. Lang., 2019)

Closed forms for numerical loops. - Zachary Kincaid; Jason Breck; John Cyphert; Thomas W. Reps (Proc. ACM Program. Lang., 2019)

Learning from, understanding, and supporting DevOps artifacts for docker. - Jordan Henkel; Christian Bird; Shuvendu K. Lahiri; Thomas W. Reps (ICSE, 2020)

A Dataset of Dockerfiles. - Jordan Henkel; Christian Bird; Shuvendu K. Lahiri; Thomas W. Reps (MSR, 2020)

Templates and recurrences: better together. - Jason Breck; John Cyphert; Zachary Kincaid; Thomas W. Reps (PLDI, 2020)

Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems. - Qinheping Hu; John Cyphert; Loris D'Antoni; Thomas W. Reps (PLDI, 2020)

Tail Bound Analysis for Probabilistic Programs via Central Moments. - Di Wang 017; Jan Hoffmann 002; Thomas W. Reps (CoRR, 2020)

TOFU: Target-Orienter FUzzer. - Zi Wang; Ben Liblit; Thomas W. Reps (CoRR, 2020)

A Generating-Extension-Generator for Machine Code. - Michael Vaughn; Thomas W. Reps (CoRR, 2020)

ICSE 2020 Artifact for: Learning from, Understanding, and Supporting DevOps Artifacts for Docker. - Jordan Henkel; Christian Bird; Shuvendu K. Lahiri; Thomas W. Reps (Zenodo, 2020)

Programmable Program Synthesis. - Loris D'Antoni; Qinheping Hu; Jinwoo Kim; Thomas W. Reps (CAV (1), 2021)

Synthesis with Asymptotic Resource Bounds. - Qinheping Hu; John Cyphert; Loris D'Antoni; Thomas W. Reps (CAV (1), 2021)

Algebraic Program Analysis. - Zachary Kincaid; Thomas W. Reps; John Cyphert (CAV (1), 2021)

Shipwright: A Human-in-the-Loop System for Dockerfile Repair. - Jordan Henkel; Denini Silva; Leopoldo Teixeira; Marcelo d'Amorim; Thomas W. Reps (ICSE, 2021)

Neural Program Generation Modulo Static Analysis. - Rohan Mukherjee 001; Yeming Wen; Dipak Chaudhari; Thomas W. Reps; Swarat Chaudhuri; Christopher M. Jermaine (NeurIPS, 2021)

Central moment analysis for cost accumulators in probabilistic programs. - Di Wang 017; Jan Hoffmann 002; Thomas W. Reps (PLDI, 2021)

Sound probabilistic inference via guide types. - Di Wang 017; Jan Hoffmann 002; Thomas W. Reps (PLDI, 2021)

Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems. - Di Wang 017; Jan Hoffmann 002; Thomas W. Reps (CoRR, 2021)

Semantics-guided synthesis. - Jinwoo Kim; Qinheping Hu; Loris D'Antoni; Thomas W. Reps (Proc. ACM Program. Lang., 2021)

On the complexity of bidirected interleaved Dyck-reachability. - Yuanbo Li; Qirun Zhang; Thomas W. Reps (Proc. ACM Program. Lang., 2021)

Interprocedural Context-Unbounded Program Analysis Using Observation Sequences. - Peizun Liu; Thomas Wahl; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2021)

ICSE'21 Artifact for the paper Shipwright: A Human-in-the-Loop System for Dockerfile Repair. - Jordan Henkel; Denini Silva; Leopoldo Teixeira; Marcelo d'Amorim; Thomas W. Reps (Zenodo, 2021)

Lightweight, Multi-Stage, Compiler-Assisted Application Specialization. - Mohannad Alhanahnah; Rithik Jain; Vaibhav Rastogi; Somesh Jha; Thomas W. Reps (EuroS&P, 2022)

Semantic Robustness of Models of Source Code. - Jordan Henkel; Goutham Ramakrishnan; Zi Wang; Aws Albarghouthi; Somesh Jha; Thomas W. Reps (SANER, 2022)

Synthesizing abstract transformers. - Pankaj Kumar Kalita; Sujit Kumar Muduli; Loris D'Antoni; Thomas W. Reps; Subhajit Roy 001 (Proc. ACM Program. Lang., 2022)

Fast Graph Simplification for Interleaved-Dyck Reachability. - Yuanbo Li; Qirun Zhang; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2022)

Synthesizing Abstract Transformers. - Pankaj Kumar Kalita; Sujit Kumar Muduli; Loris D'Antoni; Thomas W. Reps; Subhajit Roy 001 (Zenodo, 2022)

Synthesizing Abstract Transformers. - Pankaj Kumar Kalita; Sujit Kumar Muduli; Loris D'Antoni; Thomas W. Reps; Subhajit Roy 001 (Zenodo, 2022)

Symbolic Quantum Simulation with Quasimodo. - Meghana Sistla; Swarat Chaudhuri; Thomas W. Reps (CAV (3), 2023)

Modular System Synthesis. - Kanghee Park; Keith J. C. Johnson; Loris D'Antoni; Thomas W. Reps (FMCAD, 2023)

Tuning Models of Code with Compiler-Generated Reinforcement Learning Feedback. - Abhinav Jain 001; Chima Adiole; Swarat Chaudhuri; Thomas W. Reps; Chris Jermaine (CoRR, 2023)

slash: A Technique for Static Configuration-Logic Identification. - Mohannad Alhanahnah; Philipp Dominik Schubert; Thomas W. Reps; Somesh Jha; Eric Bodden (CoRR, 2023)

Optimal Symbolic Bound Synthesis. - John Cyphert; Yotam Feldman; Zachary Kincaid; Thomas W. Reps (CoRR, 2023)

Unrealizability Logic. - Jinwoo Kim; Loris D'Antoni; Thomas W. Reps (Proc. ACM Program. Lang., 2023)

Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming. - Yuanbo Li; Qirun Zhang; Thomas W. Reps (Proc. ACM Program. Lang., 2023)

Quasimodo. - Meghana Aparna Sistla; Swarat Chaudhuri; Thomas W. Reps (Zenodo, 2023)

Quasimodo. - Meghana Aparna Sistla; Swarat Chaudhuri; Thomas W. Reps (Zenodo, 2023)

Synthesizing Specifications. - Kanghee Park; Loris D'Antoni; Thomas W. Reps (Proc. ACM Program. Lang., 2023)

The SemGuS Toolkit. - Keith J. C. Johnson; Andrew Reynolds 001; Thomas W. Reps; Loris D'Antoni (CAV (3), 2024)

Prompt Tuning Strikes Back: Customizing Foundation Models with Low-Rank Prompt Adaptation. - Abhinav Jain 001; Swarat Chaudhuri; Thomas W. Reps; Christopher M. Jermaine (NeurIPS, 2024)

Synthesizing Abstract Transformers for Reduced-Product Domains. - Pankaj Kumar Kalita; Thomas W. Reps; Subhajit Roy 001 (SAS, 2024)

Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics. - Keith J. C. Johnson; Rahul Krishnan; Thomas W. Reps; Loris D'Antoni (Proc. ACM Program. Lang., 2024)

Synthesizing Formal Semantics from Executable Interpreters. - Jiangyi Liu; Charlie Murphy; Anvay Grover; Keith J. C. Johnson; Thomas W. Reps; Loris D'Antoni (Proc. ACM Program. Lang., 2024)

Automating Unrealizability Logic: Hoare-Style Proof Synthesis for Infinite Sets of Programs. - Shaan Nagy; Jinwoo Kim; Thomas W. Reps; Loris D'Antoni (Proc. ACM Program. Lang., 2024)

Weighted Context-Free-Language Ordered Binary Decision Diagrams. - Meghana Sistla; Swarat Chaudhuri; Thomas W. Reps (Proc. ACM Program. Lang., 2024)

Newtonian Program Analysis of Probabilistic Programs. - Di Wang 017; Thomas W. Reps (Proc. ACM Program. Lang., 2024)

Newtonian Program Analysis of Probabilistic Programs (Artifact). - Di Wang 017; Thomas W. Reps (Zenodo, 2024)

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams. - Meghana Aparna Sistla; Swarat Chaudhuri; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2024)

Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics. - Keith J. C. Johnson; Rahul Krishnan; Thomas W. Reps; Loris D'Antoni (Zenodo, 2024)

Synthesizing Abstract Transformers for Reduced-Product Domains. - Pankaj Kumar Kalita; Thomas W. Reps; Subhajit Roy 001 (Zenodo, 2024)

Artifact of paper "Synthesizing Formal Semantics from Executable Interpreters". - Jiangyi Liu; Charlie Murphy; Anvay Grover; Keith J. C. Johnson; Thomas W. Reps; Loris D'Antoni (Zenodo, 2024)

Artifact of paper "Synthesizing Formal Semantics from Executable Interpreters". - Jiangyi Liu; Charlie Murphy; Anvay Grover; Keith J. C. Johnson; Thomas W. Reps; Loris D'Antoni (Zenodo, 2024)

Artifact of paper "Synthesizing Formal Semantics from Executable Interpreters". - Jiangyi Liu; Charlie Murphy; Anvay Grover; Keith J. C. Johnson; Thomas W. Reps; Loris D'Antoni (Zenodo, 2024)

Artifact of paper "Synthesizing Formal Semantics from Executable Interpreters". - Jiangyi Liu; Charlie Murphy; Anvay Grover; Keith J. C. Johnson; Thomas W. Reps; Loris D'Antoni (Zenodo, 2024)

Semantics of Sets of Programs. - Jinwoo Kim; Shaan Nagy; Thomas Reps; Loris D'Antoni (Proc. ACM Program. Lang., 2025)

Verifying Solutions to Semantics-Guided Synthesis Problems. - Charlie Murphy; Keith J. C. Johnson; Thomas Reps; Loris D'Antoni (Proc. ACM Program. Lang., 2025)

PEA: Enhancing LLM Performance on Computational-Reasoning Tasks. - Zi Wang; Shiwei Weng; Mohannad Alhanahnah; Somesh Jha; Thomas W. Reps (CoRR, 2025)

Scalable Equivalence Checking and Verification of Shallow Quantum Circuits. - Nengkun Yu; Xuan Du Trinh; Thomas Reps (CoRR, 2025)

Polynomial Bounds of CFLOBDDs against BDDs. - Xusheng Zhi; Thomas Reps (ACM Trans. Program. Lang. Syst., 2025)

SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits. - Nengkun Yu; Jens Palsberg; Thomas Reps (CoRR, 2025)

Software Model Checking via Summary-Guided Search (Extended Version). - Ruijie Fang; Zachary Kincaid; Thomas Reps (CoRR, 2025)