default search action
Thomas W. Reps
Person information
- affiliation: University of Wisconsin-Madison, Madison, USA
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j68]Di Wang, Thomas W. Reps:
Newtonian Program Analysis of Probabilistic Programs. Proc. ACM Program. Lang. 8(OOPSLA1): 305-333 (2024) - [j67]Shaan Nagy, Jinwoo Kim, Thomas W. Reps, Loris D'Antoni:
Automating Unrealizability Logic: Hoare-Style Proof Synthesis for Infinite Sets of Programs. Proc. ACM Program. Lang. 8(OOPSLA2): 113-139 (2024) - [j66]Jiangyi Liu, Charlie Murphy, Anvay Grover, Keith J. C. Johnson, Thomas W. Reps, Loris D'Antoni:
Synthesizing Formal Semantics from Executable Interpreters. Proc. ACM Program. Lang. 8(OOPSLA2): 362-388 (2024) - [j65]Keith J. C. Johnson, Rahul Krishnan, Thomas W. Reps, Loris D'Antoni:
Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics. Proc. ACM Program. Lang. 8(OOPSLA2): 935-961 (2024) - [j64]Meghana Sistla, Swarat Chaudhuri, Thomas W. Reps:
Weighted Context-Free-Language Ordered Binary Decision Diagrams. Proc. ACM Program. Lang. 8(OOPSLA2): 1390-1419 (2024) - [j63]Meghana Aparna Sistla, Swarat Chaudhuri, Thomas W. Reps:
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams. ACM Trans. Program. Lang. Syst. 46(2): 7 (2024) - [c174]Keith J. C. Johnson, Andrew Reynolds, Thomas W. Reps, Loris D'Antoni:
The SemGuS Toolkit. CAV (3) 2024: 27-40 - [i43]Shaan Nagy, Jinwoo Kim, Loris D'Antoni, Thomas W. Reps:
Automating Unrealizability Logic: Hoare-style Proof Synthesis for Infinite Sets of Programs. CoRR abs/2401.13244 (2024) - [i42]Abhinav Jain, Swarat Chaudhuri, Thomas W. Reps, Chris Jermaine:
Prompt Tuning Strikes Back: Customizing Foundation Models with Low-Rank Prompt Adaptation. CoRR abs/2405.15282 (2024) - [i41]Xusheng Zhi, Thomas W. Reps:
Polynomial Bounds of CFLOBDDs against BDDs. CoRR abs/2406.01525 (2024) - [i40]Keith J. C. Johnson, Andrew Reynolds, Thomas W. Reps, Loris D'Antoni:
The SemGuS Toolkit. CoRR abs/2406.01792 (2024) - [i39]Pankaj Kumar Kalita, Thomas W. Reps, Subhajit Roy:
Synthesizing Abstract Transformers for Reduced-Product Domains. CoRR abs/2408.04040 (2024) - [i38]Jiangyi Liu, Charlie Murphy, Anvay Grover, Keith J. C. Johnson, Thomas W. Reps, Loris D'Antoni:
Synthesizing Formal Semantics from Executable Interpreters. CoRR abs/2408.14668 (2024) - [i37]Charlie Murphy, Keith J. C. Johnson, Thomas W. Reps, Loris D'Antoni:
Verifying Solutions to Semantics-Guided Synthesis Problems. CoRR abs/2408.15475 (2024) - [i36]Keith J. C. Johnson, Rahul Krishnan, Thomas W. Reps, Loris D'Antoni:
Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics. CoRR abs/2408.15822 (2024) - [i35]Jinwoo Kim, Shaan Nagy, Thomas W. Reps, Loris D'Antoni:
Semantics of Sets of Programs. CoRR abs/2410.16102 (2024) - 2023
- [j62]Kanghee Park, Loris D'Antoni, Thomas W. Reps:
Synthesizing Specifications. Proc. ACM Program. Lang. 7(OOPSLA2): 1787-1816 (2023) - [j61]Jinwoo Kim, Loris D'Antoni, Thomas W. Reps:
Unrealizability Logic. Proc. ACM Program. Lang. 7(POPL): 659-688 (2023) - [j60]Yuanbo Li, Qirun Zhang, Thomas W. Reps:
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming. Proc. ACM Program. Lang. 7(POPL): 1003-1026 (2023) - [c173]Meghana Sistla, Swarat Chaudhuri, Thomas W. Reps:
Symbolic Quantum Simulation with Quasimodo. CAV (3) 2023: 213-225 - [c172]Kanghee Park, Keith J. C. Johnson, Loris D'Antoni, Thomas W. Reps:
Modular System Synthesis. FMCAD 2023: 257-267 - [d9]Meghana Aparna Sistla, Swarat Chaudhuri, Thomas W. Reps:
Quasimodo. Version 1. Zenodo, 2023 [all versions] - [d8]Meghana Aparna Sistla, Swarat Chaudhuri, Thomas W. Reps:
Quasimodo. Version 2. Zenodo, 2023 [all versions] - [i34]Kanghee Park, Loris D'Antoni, Thomas W. Reps:
Synthesizing Specifications. CoRR abs/2301.11117 (2023) - [i33]Meghana Sistla, Swarat Chaudhuri, Thomas W. Reps:
Symbolic Quantum Simulation with Quasimodo. CoRR abs/2302.04349 (2023) - [i32]Meghana Sistla, Swarat Chaudhuri, Thomas W. Reps:
Weighted Context-Free-Language Ordered Binary Decision Diagrams. CoRR abs/2305.13610 (2023) - [i31]Abhinav Jain, Chima Adiole, Swarat Chaudhuri, Thomas W. Reps, Chris Jermaine:
Tuning Models of Code with Compiler-Generated Reinforcement Learning Feedback. CoRR abs/2305.18341 (2023) - [i30]Di Wang, Thomas W. Reps:
Newtonian Program Analysis of Probabilistic Programs. CoRR abs/2307.09064 (2023) - [i29]Kanghee Park, Keith J. C. Johnson, Loris D'Antoni, Thomas W. Reps:
Modular System Synthesis. CoRR abs/2308.06956 (2023) - [i28]Mohannad Alhanahnah, Philipp Dominik Schubert, Thomas W. Reps, Somesh Jha, Eric Bodden:
slash: A Technique for Static Configuration-Logic Identification. CoRR abs/2310.06758 (2023) - [i27]John Cyphert, Yotam Feldman, Zachary Kincaid, Thomas W. Reps:
Optimal Symbolic Bound Synthesis. CoRR abs/2310.13144 (2023) - 2022
- [j59]Pankaj Kumar Kalita, Sujit Kumar Muduli, Loris D'Antoni, Thomas W. Reps, Subhajit Roy:
Synthesizing abstract transformers. Proc. ACM Program. Lang. 6(OOPSLA2): 1291-1319 (2022) - [j58]Yuanbo Li, Qirun Zhang, Thomas W. Reps:
Fast Graph Simplification for Interleaved-Dyck Reachability. ACM Trans. Program. Lang. Syst. 44(2): 11:1-11:28 (2022) - [c171]Mohannad Alhanahnah, Rithik Jain, Vaibhav Rastogi, Somesh Jha, Thomas W. Reps:
Lightweight, Multi-Stage, Compiler-Assisted Application Specialization. EuroS&P 2022: 251-269 - [c170]Jordan Henkel, Goutham Ramakrishnan, Zi Wang, Aws Albarghouthi, Somesh Jha, Thomas W. Reps:
Semantic Robustness of Models of Source Code. SANER 2022: 526-537 - [d7]Pankaj Kumar Kalita, Sujit Kumar Muduli, Loris D'Antoni, Thomas W. Reps, Subhajit Roy:
Synthesizing Abstract Transformers. Version 1.0. Zenodo, 2022 [all versions] - [d6]Pankaj Kumar Kalita, Sujit Kumar Muduli, Loris D'Antoni, Thomas W. Reps, Subhajit Roy:
Synthesizing Abstract Transformers. Version 1.0. Zenodo, 2022 [all versions] - [i26]Meghana Sistla, Swarat Chaudhuri, Thomas W. Reps:
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams. CoRR abs/2211.06818 (2022) - [i25]Jinwoo Kim, Loris D'Antoni, Thomas W. Reps:
Unrealizability Logic. CoRR abs/2211.07117 (2022) - 2021
- [j57]Jinwoo Kim, Qinheping Hu, Loris D'Antoni, Thomas W. Reps:
Semantics-guided synthesis. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - [j56]Yuanbo Li, Qirun Zhang, Thomas W. Reps:
On the complexity of bidirected interleaved Dyck-reachability. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [j55]Peizun Liu, Thomas Wahl, Thomas W. Reps:
Interprocedural Context-Unbounded Program Analysis Using Observation Sequences. ACM Trans. Program. Lang. Syst. 42(4): 16:1-16:34 (2021) - [c169]Zachary Kincaid, Thomas W. Reps, John Cyphert:
Algebraic Program Analysis. CAV (1) 2021: 46-83 - [c168]Loris D'Antoni, Qinheping Hu, Jinwoo Kim, Thomas W. Reps:
Programmable Program Synthesis. CAV (1) 2021: 84-109 - [c167]Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Synthesis with Asymptotic Resource Bounds. CAV (1) 2021: 783-807 - [c166]Jordan Henkel, Denini Silva, Leopoldo Teixeira, Marcelo d'Amorim, Thomas W. Reps:
Shipwright: A Human-in-the-Loop System for Dockerfile Repair. ICSE (Companion Volume) 2021: 198-199 - [c165]Jordan Henkel, Denini Silva, Leopoldo Teixeira, Marcelo d'Amorim, Thomas W. Reps:
Shipwright: A Human-in-the-Loop System for Dockerfile Repair. ICSE 2021: 1148-1160 - [c164]Rohan Mukherjee, Yeming Wen, Dipak Chaudhari, Thomas W. Reps, Swarat Chaudhuri, Christopher M. Jermaine:
Neural Program Generation Modulo Static Analysis. NeurIPS 2021: 18984-18996 - [c163]Di Wang, Jan Hoffmann, Thomas W. Reps:
Central moment analysis for cost accumulators in probabilistic programs. PLDI 2021: 559-573 - [c162]Di Wang, Jan Hoffmann, Thomas W. Reps:
Sound probabilistic inference via guide types. PLDI 2021: 788-803 - [d5]Jordan Henkel, Denini Silva, Leopoldo Teixeira, Marcelo d'Amorim, Thomas W. Reps:
ICSE'21 Artifact for the paper Shipwright: A Human-in-the-Loop System for Dockerfile Repair. Zenodo, 2021 - [i24]Jordan Henkel, Denini Silva, Leopoldo Teixeira, Marcelo d'Amorim, Thomas W. Reps:
Shipwright: A Human-in-the-Loop System for Dockerfile Repair. CoRR abs/2103.02591 (2021) - [i23]Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Synthesis with Asymptotic Resource Bounds. CoRR abs/2103.04188 (2021) - [i22]Di Wang, Jan Hoffmann, Thomas W. Reps:
Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems. CoRR abs/2103.16105 (2021) - [i21]Di Wang, Jan Hoffmann, Thomas W. Reps:
Sound Probabilistic Inference via Guide Types. CoRR abs/2104.03598 (2021) - [i20]Pankaj Kumar Kalita, Sujit Kumar Muduli, Loris D'Antoni, Thomas W. Reps, Subhajit Roy:
Synthesizing Abstract Transformers. CoRR abs/2105.00493 (2021) - [i19]Mohannad Alhanahnah, Rithik Jain, Vaibhav Rastogi, Somesh Jha, Thomas W. Reps:
Lightweight, Multi-Stage, Compiler-Assisted Application Specialization. CoRR abs/2109.02775 (2021) - [i18]Rohan Mukherjee, Yeming Wen, Dipak Chaudhari, Thomas W. Reps, Swarat Chaudhuri, Chris Jermaine:
Neural Program Generation Modulo Static Analysis. CoRR abs/2111.01633 (2021) - 2020
- [c161]Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas W. Reps:
Learning from, understanding, and supporting DevOps artifacts for docker. ICSE 2020: 38-49 - [c160]Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas W. Reps:
A Dataset of Dockerfiles. MSR 2020: 528-532 - [c159]Jason Breck, John Cyphert, Zachary Kincaid, Thomas W. Reps:
Templates and recurrences: better together. PLDI 2020: 688-702 - [c158]Yuanbo Li, Qirun Zhang, Thomas W. Reps:
Fast graph simplification for interleaved Dyck-reachability. PLDI 2020: 780-793 - [c157]Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems. PLDI 2020: 1128-1142 - [d4]Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas W. Reps:
ICSE 2020 Artifact for: Learning from, Understanding, and Supporting DevOps Artifacts for Docker. Zenodo, 2020 - [i17]Di Wang, Jan Hoffmann, Thomas W. Reps:
Tail Bound Analysis for Probabilistic Programs via Central Moments. CoRR abs/2001.10150 (2020) - [i16]Goutham Ramakrishnan, Jordan Henkel, Zi Wang, Aws Albarghouthi, Somesh Jha, Thomas W. Reps:
Semantic Robustness of Models of Source Code. CoRR abs/2002.03043 (2020) - [i15]Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas W. Reps:
Learning from, Understanding, and Supporting DevOps Artifacts for Docker. CoRR abs/2002.03064 (2020) - [i14]Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas W. Reps:
A Dataset of Dockerfiles. CoRR abs/2003.12912 (2020) - [i13]Jason Breck, John Cyphert, Zachary Kincaid, Thomas W. Reps:
Templates and Recurrences: Better Together. CoRR abs/2003.13515 (2020) - [i12]Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Exact and Approximate Methods for Proving Unrealizability of Syntax-Guided Synthesis Problems. CoRR abs/2004.00878 (2020) - [i11]Zi Wang, Ben Liblit, Thomas W. Reps:
TOFU: Target-Orienter FUzzer. CoRR abs/2004.14375 (2020) - [i10]Michael Vaughn, Thomas W. Reps:
A Generating-Extension-Generator for Machine Code. CoRR abs/2005.06645 (2020) - [i9]Jinwoo Kim, Qinheping Hu, Loris D'Antoni, Thomas W. Reps:
Semantics-Guided Synthesis. CoRR abs/2008.09836 (2020)
2010 – 2019
- 2019
- [j54]Tushar Sharma, Thomas W. Reps:
A new abstraction framework for affine transformers. Formal Methods Syst. Des. 54(1): 110-143 (2019) - [j53]John Cyphert, Jason Breck, Zachary Kincaid, Thomas W. Reps:
Refinement of path expressions for static analysis. Proc. ACM Program. Lang. 3(POPL): 45:1-45:29 (2019) - [j52]Zachary Kincaid, Jason Breck, John Cyphert, Thomas W. Reps:
Closed forms for numerical loops. Proc. ACM Program. Lang. 3(POPL): 55:1-55:29 (2019) - [c156]Qinheping Hu, Jason Breck, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Proving Unrealizability for Syntax-Guided Synthesis. CAV (1) 2019: 335-352 - [c155]Di Wang, Jan Hoffmann, Thomas W. Reps:
A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism. MFPS 2019: 303-324 - [i8]Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit, Thomas W. Reps:
Enabling Open-World Specification Mining via Unsupervised Learning. CoRR abs/1904.12098 (2019) - [i7]Qinheping Hu, Jason Breck, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Proving Unrealizability for Syntax-Guided Synthesis. CoRR abs/1905.05800 (2019) - 2018
- [j51]Zachary Kincaid, John Cyphert, Jason Breck, Thomas W. Reps:
Non-linear reasoning for invariant synthesis. Proc. ACM Program. Lang. 2(POPL): 54:1-54:33 (2018) - [c154]Thomas W. Reps:
Program Analyses Using Newton's Method (Invited Paper). NETYS 2018: 3-16 - [c153]Di Wang, Jan Hoffmann, Thomas W. Reps:
PMAF: an algebraic framework for static analysis of probabilistic programs. PLDI 2018: 513-528 - [c152]Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit, Thomas W. Reps:
Code vectors: understanding programs through embedded abstracted symbolic traces. ESEC/SIGSOFT FSE 2018: 163-174 - [d3]Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit, Thomas W. Reps:
Artifact for Code Vectors: Understanding Programs Through Embedded Abstracted Symbolic Traces. Version v1.0.0. Zenodo, 2018 [all versions] - [d2]Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit, Thomas W. Reps:
Artifact for Code Vectors: Understanding Programs Through Embedded Abstracted Symbolic Traces. Version v1.0.1. Zenodo, 2018 [all versions] - [d1]Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit, Thomas W. Reps:
Artifact for Code Vectors: Understanding Programs Through Embedded Abstracted Symbolic Traces. Version v1.1.1. Zenodo, 2018 [all versions] - [i6]Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit, Thomas W. Reps:
Code Vectors: Understanding Programs Through Embedded Abstracted Symbolic Traces. CoRR abs/1803.06686 (2018) - 2017
- [j50]William R. Harris, Somesh Jha, Thomas W. Reps, Sanjit A. Seshia:
Program synthesis for interactive-security systems. Formal Methods Syst. Des. 51(2): 362-394 (2017) - [j49]Venkatesh Srinivasan, Ara Vartanian, Thomas W. Reps:
Model-assisted machine-code synthesis. Proc. ACM Program. Lang. 1(OOPSLA): 61:1-61:26 (2017) - [j48]Thomas W. Reps, Emma Turetsky, Prathmesh Prabhu:
Newtonian Program Analysis via Tensor Product. ACM Trans. Program. Lang. Syst. 39(2): 9:1-9:72 (2017) - [c151]Quentin Carbonneaux, Jan Hoffmann, Thomas W. Reps, Zhong Shao:
Automated Resource Analysis with Coq Proof Objects. CAV (2) 2017: 64-85 - [c150]Zachary Kincaid, Jason Breck, Ashkan Forouhi Boroujeni, Thomas W. Reps:
Compositional recurrence analysis revisited. PLDI 2017: 248-262 - [c149]Yu Feng, Ruben Martins, Yuepeng Wang, Isil Dillig, Thomas W. Reps:
Component-based synthesis for complex APIs. POPL 2017: 599-612 - [c148]Tushar Sharma, Thomas W. Reps:
A New Abstraction Framework for Affine Transformers. SAS 2017: 342-363 - [c147]David Bingham Brown, Michael Vaughn, Ben Liblit, Thomas W. Reps:
The care and feeding of wild-caught mutants. ESEC/SIGSOFT FSE 2017: 511-522 - [c146]Tushar Sharma, Thomas W. Reps:
Sound Bit-Precise Numerical Domains. VMCAI 2017: 500-520 - [i5]Matthew Amodio, Swarat Chaudhuri, Thomas W. Reps:
Neural Attribute Machines for Program Generation. CoRR abs/1705.09231 (2017) - [i4]Vineeth Kashyap, David Bingham Brown, Ben Liblit, David Melski, Thomas W. Reps:
Source Forager: A Search Engine for Similar Source Code. CoRR abs/1706.02769 (2017) - 2016
- [c145]Antoine Miné, Jason Breck, Thomas W. Reps:
An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs. ESOP 2016: 560-588 - [c144]Venkatesh Srinivasan, Tushar Sharma, Thomas W. Reps:
Speeding up machine-code synthesis. OOPSLA 2016: 165-180 - [c143]Venkatesh Srinivasan, Thomas W. Reps:
An improved algorithm for slicing machine code. OOPSLA 2016: 378-393 - [c142]Thomas W. Reps, Emma Turetsky, Prathmesh Prabhu:
Newtonian program analysis via tensor product. POPL 2016: 663-677 - [c141]Thomas W. Reps, Aditya V. Thakur:
Automating Abstract Interpretation. VMCAI 2016: 3-40 - 2015
- [c140]Peter Ohmann, David Bingham Brown, Ben Liblit, Thomas W. Reps:
Recovering execution data from incomplete observations. WODA@SPLASH 2015: 19-24 - [c139]Venkatesh Srinivasan, Thomas W. Reps:
Partial evaluation of machine code. OOPSLA 2015: 860-879 - [c138]Venkatesh Srinivasan, Thomas W. Reps:
Synthesis of machine code from semantics. PLDI 2015: 596-607 - 2014
- [j47]Min Aung, Susan Horwitz, Richard Joiner, Thomas W. Reps:
Specialization Slicing. ACM Trans. Program. Lang. Syst. 36(2): 5:1-5:67 (2014) - [j46]Matt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas W. Reps:
Abstract Domains of Affine Relations. ACM Trans. Program. Lang. Syst. 36(4): 11:1-11:73 (2014) - [c137]Shachar Itzhaky, Nikolaj S. Bjørner, Thomas W. Reps, Mooly Sagiv, Aditya V. Thakur:
Property-Directed Shape Analysis. CAV 2014: 35-51 - [c136]Venkatesh Srinivasan, Thomas W. Reps:
Recovery of Class Hierarchies and Composition Relationships from Machine Code. CC 2014: 61-84 - [c135]Min Aung, Susan Horwitz, Richard Joiner, Thomas W. Reps:
Specialization slicing. PLDI 2014: 167 - [c134]Richard Joiner, Thomas W. Reps, Somesh Jha, Mohan Dhawan, Vinod Ganapathy:
Efficient runtime-enforcement techniques for policy weaving. SIGSOFT FSE 2014: 224-234 - [c133]Aditya V. Thakur, Jason Breck, Thomas W. Reps:
Satisfiability modulo abstraction for separation logic with linked lists. SPIN 2014: 58-67 - [i3]Daniel Kroening, Thomas W. Reps, Sanjit A. Seshia, Aditya V. Thakur:
Decision Procedures and Abstract Interpretation (Dagstuhl Seminar 14351). Dagstuhl Reports 4(8): 89-106 (2014) - 2013
- [j45]Junghee Lim, Thomas W. Reps:
TSL: A System for Generating Abstract Interpreters and its Application to Machine-Code Analysis. ACM Trans. Program. Lang. Syst. 35(1): 4:1-4:59 (2013) - [j44]Wei Zhang, Chong Sun, Junghee Lim, Shan Lu, Thomas W. Reps:
ConMem: Detecting Crash-Triggering Concurrency Bugs through an Effect-Oriented Approach. ACM Trans. Softw. Eng. Methodol. 22(2): 10:1-10:33 (2013) - [c132]Jörg Kreiker, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav:
Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs. Programming Logics 2013: 414-445 - [c131]Somesh Jha, Thomas W. Reps, William R. Harris:
Secure programs via game-based synthesis. FMCAD 2013: 12-13 - [c130]William R. Harris, Somesh Jha, Thomas W. Reps, Jonathan Anderson, Robert N. M. Watson:
Declarative, Temporal, and Practical Programming with Capabilities. IEEE Symposium on Security and Privacy 2013: 18-32 - [c129]Aditya V. Thakur, Akash Lal, Junghee Lim, Thomas W. Reps:
PostHat and All That: Automating Abstract Interpretation. TAPAS@SAS 2013: 15-32 - 2012
- [c128]Aditya V. Thakur, Thomas W. Reps:
A Method for Symbolic Computation of Abstract Operations. CAV 2012: 174-192 - [c127]Matthew Fredrikson, Richard Joiner, Somesh Jha, Thomas W. Reps, Phillip A. Porras, Hassen Saïdi, Vinod Yegneswaran:
Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement. CAV 2012: 548-563 - [c126]William R. Harris, Somesh Jha, Thomas W. Reps:
Secure Programming via Visibly Pushdown Safety Games. CAV 2012: 581-598 - [c125]Evan Driscoll, Aditya V. Thakur, Thomas W. Reps:
OpenNWA: A Nested-Word Automaton Library. CAV 2012: 665-671 - [c124]Aditya V. Thakur, Matt Elder, Thomas W. Reps:
Bilateral Algorithms for Symbolic Abstraction. SAS 2012: 111-128 - [c123]Aditya V. Thakur, Thomas W. Reps:
A Generalization of Stålmarck's Method. SAS 2012: 334-351 - [i2]Andy King, Alan Mycroft, Thomas W. Reps, Axel Simon:
Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051). Dagstuhl Reports 2(1): 100-116 (2012) - 2011
- [j43]Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps:
A decision procedure for detecting atomicity violations for communicating processes with locks. Int. J. Softw. Tools Technol. Transf. 13(1): 37-60 (2011) - [j42]Junghee Lim, Akash Lal, Thomas W. Reps:
Symbolic analysis via semantic reinterpretation. Int. J. Softw. Tools Technol. Transf. 13(1): 61-87 (2011) - [j41]Nicholas Kidd, Thomas W. Reps, Julian Dolby, Mandana Vaziri:
Finding concurrency-related bugs using random isolation. Int. J. Softw. Tools Technol. Transf. 13(6): 495-518 (2011) - [c122]Wei Zhang, Junghee Lim, Ramya Olichandran, Joel Scherpelz, Guoliang Jin, Shan Lu, Thomas W. Reps:
ConSeq: detecting concurrency bugs through sequential errors. ASPLOS 2011: 251-264 - [c121]Matt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas W. Reps:
Abstract Domains of Affine Relations. SAS 2011: 198-215 - [c120]Evan Driscoll, Amanda Burton, Thomas W. Reps:
Checking conformance of a producer and a consumer. SIGSOFT FSE 2011: 113-123 - 2010
- [b5]Anupam Datta, Somesh Jha, Ninghui Li, David Melski, Thomas W. Reps:
Analysis Techniques for Information Security. Synthesis Lectures on Information Security, Privacy, and Trust, Morgan & Claypool Publishers 2010, ISBN 978-3-031-01206-8 - [j40]Bertrand Jeannet, Alexey Loginov, Thomas W. Reps, Mooly Sagiv:
A relational approach to interprocedural shape analysis. ACM Trans. Program. Lang. Syst. 32(2): 5:1-5:52 (2010) - [j39]Gogul Balakrishnan, Thomas W. Reps:
WYSINWYX: What you see is not what you eXecute. ACM Trans. Program. Lang. Syst. 32(6): 23:1-23:84 (2010) - [j38]Thomas W. Reps, Mooly Sagiv, Alexey Loginov:
Finite differencing of logical formulas for static analysis. ACM Trans. Program. Lang. Syst. 32(6): 24:1-24:55 (2010) - [c119]Thomas W. Reps, Junghee Lim, Aditya V. Thakur, Gogul Balakrishnan, Akash Lal:
There's Plenty of Room at the Bottom: Analyzing and Verifying Machine Code. CAV 2010: 41-56 - [c118]Aditya V. Thakur, Junghee Lim, Akash Lal, Amanda Burton, Evan Driscoll, Matt Elder, Tycho Andersen, Thomas W. Reps:
Directed Proof Generation for Machine Code. CAV 2010: 288-305 - [c117]William R. Harris, Somesh Jha, Thomas W. Reps:
DIFC programs by automatic instrumentation. CCS 2010: 284-296 - [c116]Bill McCloskey, Thomas W. Reps, Mooly Sagiv:
Statically Inferring Complex Heap, Array, and Numeric Invariants. SAS 2010: 71-99 - [c115]Matt Elder, Denis Gopan, Thomas W. Reps:
View-Augmented Abstractions. NSAD@SAS 2010: 43-57
2000 – 2009
- 2009
- [j37]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. Log. Methods Comput. Sci. 5(2) (2009) - [j36]Akash Lal, Thomas W. Reps:
Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods Syst. Des. 35(1): 73-97 (2009) - [c114]William R. Harris, Nicholas Kidd, Sagar Chaki, Somesh Jha, Thomas W. Reps:
Verifying Information Flow Control over Unbounded Processes. FM 2009: 773-789 - [c113]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 - [c112]Junghee Lim, Akash Lal, Thomas W. Reps:
Symbolic Analysis via Semantic Reinterpretation. SPIN 2009: 148-168 - [c111]Nicholas Kidd, Thomas W. Reps, Julian Dolby, Mandana Vaziri:
Finding Concurrency-Related Bugs Using Random Isolation. VMCAI 2009: 198-213 - 2008
- [c110]Akash Lal, Thomas W. Reps:
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis. CAV 2008: 37-51 - [c109]Thomas W. Reps, Gogul Balakrishnan:
Improved Memory-Access Analysis for x86 Executables. CC 2008: 16-35 - [c108]Junghee Lim, Thomas W. Reps:
A System for Generating Static Analyzers for Machine Instructions. CC 2008: 36-52 - [c107]Akash Lal, Thomas W. Reps:
Solving Multiple Dataflow Queries Using WPDSs. SAS 2008: 93-109 - [c106]Nicholas Kidd, Akash Lal, Thomas W. Reps:
Language Strength Reduction. SAS 2008: 283-298 - [c105]Gogul Balakrishnan, Thomas W. Reps:
Analyzing Stripped Device-Driver Executables. TACAS 2008: 124-140 - [c104]Akash Lal, Tayssir Touili, Nicholas Kidd, Thomas W. Reps:
Interprocedural Analysis of Concurrent Programs Under a Context Bound. TACAS 2008: 282-298 - 2007
- [j35]Greta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm:
Logical characterizations of heap abstractions. ACM Trans. Comput. Log. 8(1): 5 (2007) - [c103]Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv:
Labelled Clauses. CADE 2007: 311-327 - [c102]Denis Gopan, Thomas W. Reps:
Low-Level Library Analysis and Summarization. CAV 2007: 68-81 - [c101]Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly Sagiv:
Revamping TVLA: Making Parametric Shape Analysis Competitive. CAV 2007: 221-225 - [c100]Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, Eran Yahav:
Comparison Under Abstraction for Verifying Linearizability. CAV 2007: 477-490 - [c99]Thomas W. Reps, Akash Lal, Nicholas Kidd:
Program Analysis Using Weighted Pushdown Systems. FSTTCS 2007: 23-51 - [c98]Akash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili:
Abstract Error Projection. SAS 2007: 200-217 - [c97]Denis Gopan, Thomas W. Reps:
Guided Static Analysis. SAS 2007: 349-365 - [c96]Gogul Balakrishnan, Thomas W. Reps:
DIVINE: DIscovering Variables IN Executables. VMCAI 2007: 1-28 - [c95]Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps:
Constructing Specialized Shape Analyses for Uniform Change. VMCAI 2007: 215-233 - [p4]Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm:
Shape Analysis and Applications. The Compiler Design Handbook, 2nd ed. 2007: 12 - [p3]Thomas W. Reps, Gogul Balakrishnan, Junghee Lim, Tim Teitelbaum:
A Next-Generation Platform for Analyzing Executables. Malware Detection 2007: 43-61 - [e2]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. Lecture Notes in Computer Science 4444, Springer 2007, ISBN 978-3-540-71315-9 [contents] - 2006
- [j34]Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
Verifying Temporal Heap Properties Specified via Evolution Logic. Log. J. IGPL 14(5): 755-783 (2006) - [c94]Thomas W. Reps, Mooly Sagiv, Jörg Bauer:
An Appreciation of the Work of Reinhard Wilhelm. Program Analysis and Compilation 2006: 1-11 - [c93]Alexey Loginov, Thomas W. Reps, Mooly Sagiv:
Refinement-Based Verification for Possibly-Cyclic Lists. Program Analysis and Compilation 2006: 247-272 - [c92]Akash Lal, Thomas W. Reps:
Improving Pushdown System Model Checking. CAV 2006: 343-357 - [c91]Denis Gopan, Thomas W. Reps:
Lookahead Widening. CAV 2006: 452-466 - [c90]Hao Wang, Somesh Jha, Thomas W. Reps, Stefan Schwoon, Stuart G. Stubblebine:
Reducing the Dependence of SPKI/SDSI on PKI. ESORICS 2006: 156-173 - [c89]Thomas W. Reps, Gogul Balakrishnan, Junghee Lim:
Intermediate-representation recovery from low-level code. PEPM 2006: 100-111 - [c88]Gogul Balakrishnan, Thomas W. Reps:
Recency-Abstraction for Heap-Allocated Storage. SAS 2006: 221-239 - [c87]Alexey Loginov, Thomas W. Reps, Mooly Sagiv:
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm. SAS 2006: 261-279 - [c86]Somesh Jha, Stefan Schwoon, Hao Wang, Thomas W. Reps:
Weighted Pushdown Systems and Trust-Management Systems. TACAS 2006: 1-26 - [c85]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 - [c84]Junghee Lim, Thomas W. Reps, Ben Liblit:
Extracting Output Formats from Executables. WCRE 2006: 167-178 - 2005
- [j33]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) - [j32]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) - [c83]Thomas W. Reps, Gogul Balakrishnan, Junghee Lim, Tim Teitelbaum:
A Next-Generation Platform for Analyzing Executables. APLAS 2005: 212-229 - [c82]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 - [c81]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 - [c80]Akash Lal, Thomas W. Reps, Gogul Balakrishnan:
Extended Weighted Pushdown Systems. CAV 2005: 434-448 - [c79]Alexey Loginov, Thomas W. Reps, Shmuel Sagiv:
Abstraction Refinement via Inductive Learning. CAV 2005: 519-533 - [c78]Gogul Balakrishnan, Radu Gruian, Thomas W. Reps, Tim Teitelbaum:
CodeSurfer/x86-A Platform for Analyzing x86 Executables. CC 2005: 250-254 - [c77]Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Thomas W. Reps, Randal E. Bryant:
Automatic discovery of API-level exploits. ICSE 2005: 312-321 - [c76]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 - [c75]Denis Gopan, Thomas W. Reps, Shmuel Sagiv:
A framework for numeric analysis of array operations. POPL 2005: 338-350 - [c74]Bertrand Jeannet, Denis Gopan, Thomas W. Reps:
A Relational Abstraction for Functions. SAS 2005: 186-202 - [c73]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 - [c72]Gogul Balakrishnan, Thomas W. Reps, David Melski, Tim Teitelbaum:
WYSINWYX: What You See Is Not What You eXecute. VSTTE 2005: 202-213 - [c71]Greta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv:
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. AIOOL@VMCAI 2005: 125-138 - 2004
- [j31]Somesh Jha, Thomas W. Reps:
Model checking SPKI/SDSI. J. Comput. Secur. 12(3-4): 317-353 (2004) - [c70]Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
Static Program Analysis via 3-Valued Logic. CAV 2004: 15-30 - [c69]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
Verification via Structure Simulation. CAV 2004: 281-294 - [c68]Gogul Balakrishnan, Thomas W. Reps:
Analyzing Memory Accesses in x86 Executables. CC 2004: 5-23 - [c67]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 - [c66]Bertrand Jeannet, Alexey Loginov, Thomas W. Reps, Shmuel Sagiv:
A Relational Approach to Interprocedural Shape Analysis. SAS 2004: 246-264 - [c65]Denis Gopan, Frank DiMaio, Nurit Dor, Thomas W. Reps, Shmuel Sagiv:
Numeric Domains with Summarized Dimensions. TACAS 2004: 512-529 - [c64]Greta Yorsh, Thomas W. Reps, Shmuel Sagiv:
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. TACAS 2004: 530-545 - [c63]Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
Symbolic Implementation of the Best Transformer. VMCAI 2004: 252-266 - 2003
- [j30]Thomas W. Reps, Louis B. Rall:
Computational Divided Differencing and Divided-Difference Arithmetics. High. Order Symb. Comput. 16(1-2): 93-149 (2003) - [j29]Paul Anderson, Thomas W. Reps, Tim Teitelbaum, Mark Zarins:
Tool Support for Fine-Grained Software Inspection. IEEE Softw. 20(4): 42-50 (2003) - [j28]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) - [c62]David Melski, Thomas W. Reps:
The Interprocedural Express-Lane Transformation. CC 2003: 200-216 - [c61]Stefan Schwoon, Somesh Jha, Thomas W. Reps, Stuart G. Stubblebine:
On Generalized Authorization Problems. CSFW 2003: 202- - [c60]Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
Verifying Temporal Heap Properties Specified via Evolution Logic. ESOP 2003: 204-222 - [c59]Thomas W. Reps, Shmuel Sagiv, Alexey Loginov:
Finite Differencing of Logical Formulas for Static Analysis. ESOP 2003: 380-398 - [c58]Thomas W. Reps, Stefan Schwoon, Somesh Jha:
Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis. SAS 2003: 189-213 - [i1]Greta Yorsh, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
Logical Characterizations of Heap Abstractions. CoRR cs.LO/0312014 (2003) - 2002
- [j27]Edmund M. Clarke, Masahiro Fujita, Sreeranga P. Rajan, Thomas W. Reps, Subash Shankar, Tim Teitelbaum:
Program slicing for VHDL. Int. J. Softw. Tools Technol. Transf. 4(1): 125-137 (2002) - [j26]Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm:
Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst. 24(3): 217-298 (2002) - [c57]Thomas W. Reps:
Static Program Analysis via 3-Valued Logic. APPIA-GULP-PRODE 2002: 5 - [c56]Somesh Jha, Thomas W. Reps:
Analysis of SPKI/SDSI Certificates Using Model Checking. CSFW 2002: 129- - [c55]Thomas W. Reps, Alexey Loginov, Shmuel Sagiv:
Semantic Minimization of 3-Valued Propositional Formulae. LICS 2002: 40- - [c54]Thomas W. Reps:
Static Program Analysis via 3-Valued Logic. SAS 2002: 1 - [p2]Reinhard Wilhelm, Thomas W. Reps, Shmuel Sagiv:
Shape Analysis and Applications. The Compiler Design Handbook 2002: 175-218 - 2001
- [c53]Zhichen Xu, Thomas W. Reps, Barton P. Miller:
Typestate Checking of Machine Code. ESOP 2001: 335-351 - [c52]Alexey Loginov, Suan Hsi Yong, Susan Horwitz, Thomas W. Reps:
Debugging via Run-Time Type Checking. FASE 2001: 217-232 - [c51]Michael Benedikt, Patrice Godefroid, Thomas W. Reps:
Model Checking of Unrestricted Hierarchical State Machines. ICALP 2001: 652-666 - [p1]Louis B. Rall, Thomas W. Reps:
Algorithmic Differencing. Perspectives on Enclosure Methods 2001: 133-146 - 2000
- [j25]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) - [j24]Thomas W. Reps:
Undecidability of context-sensitive data-independence analysis. ACM Trans. Program. Lang. Syst. 22(1): 162-186 (2000) - [c50]Reinhard Wilhelm, Shmuel Sagiv, Thomas W. Reps:
Shape Analysis. CC 2000: 1-17 - [c49]Tal Lev-Ami, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm:
Putting static analysis to work for verification: A case study. ISSTA 2000: 26-38 - [c48]Zhichen Xu, Barton P. Miller, Thomas W. Reps:
Safety checking of machine code. PLDI 2000: 70-82 - [e1]Mark N. Wegman, Thomas W. Reps:
POPL 2000, Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, January 19-21, 2000. ACM 2000, ISBN 1-58113-125-9 [contents]
1990 – 1999
- 1999
- [j23]Satish Chandra, Thomas W. Reps:
Physical type checking for C. ACM SIGSOFT Softw. Eng. Notes 24(5): 66-75 (1999) - [j22]Michael Siff, Thomas W. Reps:
Identifying Modules via Concept Analysis. IEEE Trans. Software Eng. 25(6): 749-768 (1999) - [c47]David Melski, Thomas W. Reps:
Interprocedural Path Profiling. CC 1999: 47-62 - [c46]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 - [c45]Michael Siff, Satish Chandra, Thomas Ball, Krishna Kunchithapadam, Thomas W. Reps:
Coping with Type Casts in C. ESEC / SIGSOFT FSE 1999: 180-198 - [c44]Michael Benedikt, Thomas W. Reps, Shmuel Sagiv:
A Decidable Logic for Describing Linked Data Structures. ESOP 1999: 2-19 - [c43]Satish Chandra, Thomas W. Reps:
Physical Type Checking for C. PASTE 1999: 66-75 - [c42]Suan Hsi Yong, Susan Horwitz, Thomas W. Reps:
Pointer Analysis for Programs with Structures and Casting. PLDI 1999: 91-103 - [c41]Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm:
Parametric Shape Analysis via 3-Valued Logic. POPL 1999: 105-118 - 1998
- [j21]Thomas W. Reps:
Program analysis via graph reachability. Inf. Softw. Technol. 40(11-12): 701-726 (1998) - [j20]Hausi A. Müller, Thomas W. Reps, Gregor Snelting:
Program comprehension and software reengineering. ACM SIGSOFT Softw. Eng. Notes 23(5): 36-44 (1998) - [j19]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) - [j18]Thomas W. Reps:
"Maximal-munch" Tokenization in Linear Time. ACM Trans. Program. Lang. Syst. 20(2): 259-273 (1998) - 1997
- [c40]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 - [c39]Thomas W. Reps:
The Use of Program Profiling for Software Testing. GI Jahrestagung 1997: 4-16 - [c38]Michael Siff, Thomas W. Reps:
Identifying modules via concept analysis. ICSM 1997: 170-179 - [c37]David Melski, Thomas W. Reps:
Interconveritibility of Set Constraints and Context-Free Language Reachability. PEPM 1997: 74-89 - [c36]Thomas W. Reps:
Program Analysis via Graph Reachability. ILPS 1997: 5-19 - 1996
- [j17]Thomas W. Reps:
On the Sequential Nature of Interprocedural Program-Analysis Problems. Acta Informatica 33(8): 739-757 (1996) - [j16]G. Ramalingam, Thomas W. Reps:
An Incremental Algorithm for a Generalization of the Shortest-Path Problem. J. Algorithms 21(2): 267-305 (1996) - [j15]G. Ramalingam, Thomas W. Reps:
On the Computational Complexity of Dynamic Graph Problems. Theor. Comput. Sci. 158(1&2): 233-277 (1996) - [j14]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) - [c35]Thomas W. Reps, Todd Turnidge:
Program Specialization via Program Slicing. Dagstuhl Seminar on Partial Evaluation 1996: 409-429 - [c34]Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm:
Solving Shape-Analysis Problems in Languages with Destructive Updating. POPL 1996: 16-31 - [c33]Michael Siff, Thomas W. Reps:
Program Generalization for Software Reuse: From C to C++. SIGSOFT FSE 1996: 135-146 - 1995
- [j13]David W. Binkley, Susan Horwitz, Thomas W. Reps:
Program Integration for Languages with Procedure Calls. ACM Trans. Softw. Eng. Methodol. 4(1): 3-35 (1995) - [c32]Thomas W. Reps:
Shape Analysis as a Generalized Path Problem. PEPM 1995: 1-11 - [c31]Manuvir Das, Thomas W. Reps, Pascal Van Hentenryck:
Semantic Foundations of Binding Time Analysis for Imperative Programs. PEPM 1995: 100-110 - [c30]Thomas W. Reps, Susan Horwitz, Shmuel Sagiv:
Precise Interprocedural Dataflow Analysis via Graph Reachability. POPL 1995: 49-61 - [c29]Thomas W. Reps, Genevieve Rosay:
Precise Interprocedural Chopping. SIGSOFT FSE 1995: 41-52 - [c28]Susan Horwitz, Thomas W. Reps, Shmuel Sagiv:
Demand Interprocedural Dataflow Analysis. SIGSOFT FSE 1995: 104-115 - [c27]Shmuel Sagiv, Thomas W. Reps, Susan Horwitz:
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. TAPSOFT 1995: 651-665 - 1994
- [j12]G. Ramalingam, Thomas W. Reps:
On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. Inf. Process. Lett. 51(3): 155-161 (1994) - [c26]Thomas W. Reps:
Solving Demand Versions of Interprocedural Analysis Problems. CC 1994: 389-403 - [c25]G. Ramalingam, Thomas W. Reps:
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph. POPL 1994: 287-296 - [c24]Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genevieve Rosay:
Speeding up Slicing. SIGSOFT FSE 1994: 11-20 - 1993
- [c23]Thomas W. Reps:
Demand Interprocedural Program Analysis Using Logic Databases. Workshop on Programming with Logic Databases (Book), ILPS 1993: 163-196 - [c22]G. Ramalingam, Thomas W. Reps:
A Categorized Bibliography on Incremental Computation. POPL 1993: 502-510 - [c21]Thomas W. Reps:
Scan Grammars: Parallel Attribute Evaluation via Data-Parallelism. SPAA 1993: 367-376 - 1992
- [j11]Paul Klint, Thomas W. Reps, Gregor Snelting:
Programming environments: report on an international workshop at Dagstuhl Castle. ACM SIGPLAN Notices 27(11): 90-96 (1992) - [j10]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) - [c20]Susan Horwitz, Thomas W. Reps:
The Use of Program Dependence Graphs in Software Engineering. ICSE 1992: 392-411 - 1991
- [j9]Susan Horwitz, Thomas W. Reps:
Efficient Comparison of Program Slices. Acta Informatica 28(8): 713-732 (1991) - [j8]Thomas W. Reps:
Algebraic Properties of Program Integration. Sci. Comput. Program. 17(1-3): 139-215 (1991) - [c19]G. Ramalingam, Thomas W. Reps:
Modification Algebras. AMAST 1991: 547-558 - [c18]G. Ramalingam, Thomas W. Reps:
A Theory of Program Modifications. TAPSOFT, Vol.2 1991: 137-152 - 1990
- [j7]Susan Horwitz, Thomas W. Reps, David W. Binkley:
Interprocedural Slicing Using Dependence Graphs. ACM Trans. Program. Lang. Syst. 12(1): 26-60 (1990) - [c17]Thomas W. Reps:
Algebraic Properties of Program Integration. ESOP 1990: 326-340 - [c16]Wuu Yang, Susan Horwitz, Thomas W. Reps:
A program integration algorithm that accommodates semantics-preserving transformations. SDE 1990: 133-143
1980 – 1989
- 1989
- [b4]Thomas W. Reps, Tim Teitelbaum:
The Synthesizer Generator Reference Manual, Third Edition. Texts and Monographs in Computer Science, Springer 1989, ISBN 978-3-540-96910-5, pp. I-XI, 1-171 - [b3]Thomas W. Reps, Tim Teitelbaum:
The Synthesizer Generator - A System for Constructing Language-Based Editors. Texts and Monographs in Computer Science, Springer 1989, ISBN 978-0-387-96857-5, pp. I-XIII, 1-317 - [j6]Susan Horwitz, Jan F. Prins, Thomas W. Reps:
Integrating Noninterfering Versions of Programs. ACM Trans. Program. Lang. Syst. 11(3): 345-387 (1989) - [c15]Susan Horwitz, Phil Pfeiffer, Thomas W. Reps:
Dependence Analysis for Pointer Variables. PLDI 1989: 28-40 - [c14]Thomas W. Reps, T. Bricker:
Illustrating Interference in Interfering Versions of Programs. SCM 1989: 46-55 - [c13]Thomas W. Reps, Wuu Yang:
The Semantics of Program Slicing and Program Integration. TAPSOFT, Vol.2 1989: 360-374 - 1988
- [j5]Thomas W. Reps:
Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications. Acta Informatica 25(2): 155-178 (1988) - [c12]Thomas W. Reps, Susan Horwitz:
Semantics-Based Program Integration. ESOP 1988: 1-20 - [c11]Susan Horwitz, Thomas W. Reps, David W. Binkley:
Interprocedural Slicing Using Dependence Graphs. PLDI 1988: 35-46 - [c10]Susan Horwitz, Thomas W. Reps, David W. Binkley:
Interprocedural slicing using dependence graphs (with retrospective). Best of PLDI 1988: 229-243 - [c9]Susan Horwitz, Jan F. Prins, Thomas W. Reps:
Integrating Non-Interfering Versions of Programs. POPL 1988: 133-145 - [c8]Susan Horwitz, Jan F. Prins, Thomas W. Reps:
On the Adequacy of Program Dependence Graphs for Representing Programs. POPL 1988: 146-157 - [c7]Thomas W. Reps, Susan Horwitz, Jan F. Prins:
Support for Integrating Program Variants in an Environment for Programming in the Large. SCM 1988: 197-216 - 1987
- [j4]Thomas W. Reps, Tim Teitelbaum:
Language Processing in Program Editors. Computer 20(11): 29-40 (1987) - [j3]Thomas W. Reps, Alan J. Demers:
Sublinear-Space Evaluation Algorithms for Attribute Grammars. ACM Trans. Program. Lang. Syst. 9(3): 408-440 (1987) - 1986
- [c6]Thomas W. Reps, Carla Marceau, Tim Teitelbaum:
Remote Attribute Updating for Language-Based Editors. POPL 1986: 1-13 - 1984
- [b2]Thomas W. Reps:
Generating Language-Based Environments. MIT Press 1984, ISBN 978-0-262-68146-9, pp. 1-138 - [c5]Thomas W. Reps, Bowen Alpern:
Interactive Proof Checking. POPL 1984: 36-45 - [c4]Thomas W. Reps, Tim Teitelbaum:
The Synthesizer Generator. Software Development Environments (SDE) 1984: 42-48 - 1983
- [j2]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
- [b1]Thomas W. Reps:
Generating Language-Based Environments. Cornell University, USA, 1982 - [c3]Thomas W. Reps:
Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors. POPL 1982: 169-176 - 1981
- [j1]Tim Teitelbaum, Thomas W. Reps:
The Cornell Program Synthesizer: A Syntax-Directed Programming Environment. Commun. ACM 24(9): 563-573 (1981) - [c2]Alan J. Demers, Thomas W. Reps, Tim Teitelbaum:
Incremental Evaluation for Attribute Grammars with Application to Syntax-Directed Editors. POPL 1981: 105-116 - [c1]Tim Teitelbaum, Thomas W. Reps, Susan Horwitz:
The why and wherefore of the Cornell Program Synthesizer. SIGPLAN SIGOA Symposium on Text Manipulation 1981: 8-16
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint