Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDThomas W. Reps
Person information
- affiliation: University of Wisconsin-Madison, Madison, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j59]Jinwoo Kim, Qinheping Hu, Loris D'Antoni, Thomas W. Reps:
Semantics-guided synthesis. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021)- [j58]Yuanbo Li, Qirun Zhang, Thomas W. Reps:
On the complexity of bidirected interleaved Dyck-reachability. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [j57]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) - [i18]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) - 2020
- [c157]Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas W. Reps:
Learning from, understanding, and supporting DevOps artifacts for docker. ICSE 2020: 38-49 - [c156]Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas W. Reps:
A Dataset of Dockerfiles. MSR 2020: 528-532 - [c155]Jason Breck, John Cyphert, Zachary Kincaid, Thomas W. Reps:
Templates and recurrences: better together. PLDI 2020: 688-702 - [c154]Yuanbo Li, Qirun Zhang, Thomas W. Reps:
Fast graph simplification for interleaved Dyck-reachability. PLDI 2020: 780-793 - [c153]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 - [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
- [j56]Tushar Sharma
, Thomas W. Reps:
A new abstraction framework for affine transformers. Formal Methods Syst. Des. 54(1): 110-143 (2019) - [j55]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) - [j54]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) - [c152]Qinheping Hu, Jason Breck, John Cyphert, Loris D'Antoni, Thomas W. Reps:
Proving Unrealizability for Syntax-Guided Synthesis. CAV (1) 2019: 335-352 - [c151]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
- [j53]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) - [c150]Thomas W. Reps:
Program Analyses Using Newton's Method (Invited Paper). NETYS 2018: 3-16 - [c149]Di Wang, Jan Hoffmann, Thomas W. Reps:
PMAF: an algebraic framework for static analysis of probabilistic programs. PLDI 2018: 513-528 - [c148]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 - [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
- [j52]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) - [j51]Venkatesh Srinivasan, Ara Vartanian, Thomas W. Reps:
Model-assisted machine-code synthesis. Proc. ACM Program. Lang. 1(OOPSLA): 61:1-61:26 (2017) - [j50]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) - [c147]Quentin Carbonneaux, Jan Hoffmann, Thomas W. Reps, Zhong Shao:
Automated Resource Analysis with Coq Proof Objects. CAV (2) 2017: 64-85 - [c146]Zachary Kincaid, Jason Breck, Ashkan Forouhi Boroujeni, Thomas W. Reps:
Compositional recurrence analysis revisited. PLDI 2017: 248-262 - [c145]Yu Feng, Ruben Martins, Yuepeng Wang, Isil Dillig, Thomas W. Reps:
Component-based synthesis for complex APIs. POPL 2017: 599-612 - [c144]Tushar Sharma, Thomas W. Reps:
A New Abstraction Framework for Affine Transformers. SAS 2017: 342-363 - [c143]David Bingham Brown, Michael Vaughn, Ben Liblit, Thomas W. Reps:
The care and feeding of wild-caught mutants. ESEC/SIGSOFT FSE 2017: 511-522 - [c142]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
- [c141]Antoine Miné, Jason Breck, Thomas W. Reps:
An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs. ESOP 2016: 560-588 - [c140]Venkatesh Srinivasan, Tushar Sharma, Thomas W. Reps:
Speeding up machine-code synthesis. OOPSLA 2016: 165-180 - [c139]Venkatesh Srinivasan, Thomas W. Reps:
An improved algorithm for slicing machine code. OOPSLA 2016: 378-393 - [c138]Thomas W. Reps, Emma Turetsky, Prathmesh Prabhu:
Newtonian program analysis via tensor product. POPL 2016: 663-677 - [c137]Thomas W. Reps, Aditya V. Thakur:
Automating Abstract Interpretation. VMCAI 2016: 3-40 - 2015
- [j49]Aditya V. Thakur, Akash Lal, Junghee Lim, Thomas W. Reps:
PostHat and All That: Automating Abstract Interpretation. Electron. Notes Theor. Comput. Sci. 311: 15-32 (2015) - [c136]Peter Ohmann, David Bingham Brown, Ben Liblit, Thomas W. Reps:
Recovering execution data from incomplete observations. WODA@SPLASH 2015: 19-24 - [c135]Venkatesh Srinivasan, Thomas W. Reps:
Partial evaluation of machine code. OOPSLA 2015: 860-879 - [c134]Venkatesh Srinivasan, Thomas W. Reps:
Synthesis of machine code from semantics. PLDI 2015: 596-607 - 2014
- [j48]Min Aung, Susan Horwitz, Richard Joiner, Thomas W. Reps:
Specialization Slicing. ACM Trans. Program. Lang. Syst. 36(2): 5:1-5:67 (2014) - [j47]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) - [c133]Shachar Itzhaky, Nikolaj Bjørner, Thomas W. Reps, Mooly Sagiv, Aditya V. Thakur:
Property-Directed Shape Analysis. CAV 2014: 35-51 - [c132]Venkatesh Srinivasan, Thomas W. Reps:
Recovery of Class Hierarchies and Composition Relationships from Machine Code. CC 2014: 61-84 - [c131]Min Aung, Susan Horwitz, Richard Joiner, Thomas W. Reps:
Specialization slicing. PLDI 2014: 167 - [c130]Richard Joiner, Thomas W. Reps, Somesh Jha, Mohan Dhawan, Vinod Ganapathy:
Efficient runtime-enforcement techniques for policy weaving. SIGSOFT FSE 2014: 224-234 - [c129]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
- [j46]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) - [j45]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) - [c128]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 - [c127]Somesh Jha, Thomas W. Reps, William R. Harris:
Secure programs via game-based synthesis. FMCAD 2013: 12-13 - [c126]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 - 2012
- [c125]Aditya V. Thakur, Thomas W. Reps:
A Method for Symbolic Computation of Abstract Operations. CAV 2012: 174-192 - [c124]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 - [c123]William R. Harris, Somesh Jha, Thomas W. Reps:
Secure Programming via Visibly Pushdown Safety Games. CAV 2012: 581-598 - [c122]Evan Driscoll, Aditya V. Thakur, Thomas W. Reps:
OpenNWA: A Nested-Word Automaton Library. CAV 2012: 665-671 - [c121]Aditya V. Thakur, Matt Elder, Thomas W. Reps:
Bilateral Algorithms for Symbolic Abstraction. SAS 2012: 111-128 - [c120]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
- [j44]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) - [j43]Junghee Lim, Akash Lal, Thomas W. Reps:
Symbolic analysis via semantic reinterpretation. Int. J. Softw. Tools Technol. Transf. 13(1): 61-87 (2011) - [j42]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) - [c119]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 - [c118]Matt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas W. Reps:
Abstract Domains of Affine Relations. SAS 2011: 198-215 - [c117]Evan Driscoll, Amanda Burton, Thomas W. Reps:
Checking conformance of a producer and a consumer. SIGSOFT FSE 2011: 113-123 - 2010
- [b4]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 - [j41]Matt Elder, Denis Gopan, Thomas W. Reps:
View-Augmented Abstractions. Electron. Notes Theor. Comput. Sci. 267(1): 43-57 (2010) - [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) - [c116]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 - [c115]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 - [c114]William R. Harris, Somesh Jha, Thomas W. Reps:
DIFC programs by automatic instrumentation. CCS 2010: 284-296 - [c113]Bill McCloskey, Thomas W. Reps, Mooly Sagiv:
Statically Inferring Complex Heap, Array, and Numeric Invariants. SAS 2010: 71-99
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) - [c112]William R. Harris, Nicholas Kidd, Sagar Chaki, Somesh Jha, Thomas W. Reps:
Verifying Information Flow Control over Unbounded Processes. FM 2009: 773-789 - [c111]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 - [c110]Junghee Lim, Akash Lal, Thomas W. Reps:
Symbolic Analysis via Semantic Reinterpretation. SPIN 2009: 148-168 - [c109]Nicholas Kidd, Thomas W. Reps, Julian Dolby, Mandana Vaziri:
Finding Concurrency-Related Bugs Using Random Isolation. VMCAI 2009: 198-213 - 2008
- [c108]Akash Lal, Thomas W. Reps:
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis. CAV 2008: 37-51 - [c107]Thomas W. Reps, Gogul Balakrishnan:
Improved Memory-Access Analysis for x86 Executables. CC 2008: 16-35 - [c106]Junghee Lim, Thomas W. Reps:
A System for Generating Static Analyzers for Machine Instructions. CC 2008: 36-52 - [c105]Akash Lal, Thomas W. Reps:
Solving Multiple Dataflow Queries Using WPDSs. SAS 2008: 93-109 - [c104]Nicholas Kidd, Akash Lal, Thomas W. Reps:
Language Strength Reduction. SAS 2008: 283-298 - [c103]Gogul Balakrishnan, Thomas W. Reps:
Analyzing Stripped Device-Driver Executables. TACAS 2008: 124-140 - [c102]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) - [c101]Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv:
Labelled Clauses. CADE 2007: 311-327 - [c100]Denis Gopan, Thomas W. Reps:
Low-Level Library Analysis and Summarization. CAV 2007: 68-81 - [c99]Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly Sagiv:
Revamping TVLA: Making Parametric Shape Analysis Competitive. CAV 2007: 221-225 - [c98]Daphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, Eran Yahav:
Comparison Under Abstraction for Verifying Linearizability. CAV 2007: 477-490 - [c97]Thomas W. Reps, Akash Lal, Nicholas Kidd:
Program Analysis Using Weighted Pushdown Systems. FSTTCS 2007: 23-51 - [c96]Akash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili:
Abstract Error Projection. SAS 2007: 200-217 - [c95]Denis Gopan, Thomas W. Reps:
Guided Static Analysis. SAS 2007: 349-365 - [c94]Gogul Balakrishnan, Thomas W. Reps:
DIVINE: DIscovering Variables IN Executables. VMCAI 2007: 1-28 - [c93]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) - [c92]Thomas W. Reps, Mooly Sagiv, Jörg Bauer:
An Appreciation of the Work of Reinhard Wilhelm. Program Analysis and Compilation 2006: 1-11 - [c91]Alexey Loginov, Thomas W. Reps, Mooly Sagiv:
Refinement-Based Verification for Possibly-Cyclic Lists. Program Analysis and Compilation 2006: 247-272 - [c90]Akash Lal, Thomas W. Reps:
Improving Pushdown System Model Checking. CAV 2006: 343-357 - [c89]Denis Gopan, Thomas W. Reps:
Lookahead Widening. CAV 2006: 452-466 - [c88]Hao Wang, Somesh Jha, Thomas W. Reps, Stefan Schwoon, Stuart G. Stubblebine:
Reducing the Dependence of SPKI/SDSI on PKI. ESORICS 2006: 156-173 - [c87]Thomas W. Reps, Gogul Balakrishnan, Junghee Lim:
Intermediate-representation recovery from low-level code. PEPM 2006: 100-111 - [c86]Gogul Balakrishnan, Thomas W. Reps:
Recency-Abstraction for Heap-Allocated Storage. SAS 2006: 221-239 - [c85]Alexey Loginov, Thomas W. Reps, Mooly Sagiv:
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm. SAS 2006: 261-279 - [c84]Somesh Jha, Stefan Schwoon, Hao Wang, Thomas W. Reps:
Weighted Pushdown Systems and Trust-Management Systems. TACAS 2006: 1-26 - [c83]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 - [c82]Junghee Lim, Thomas W. Reps, Ben Liblit:
Extracting Output Formats from Executables. WCRE 2006: 167-178 - 2005
- [j33]Greta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv:
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. Electron. Notes Theor. Comput. Sci. 131: 125-138 (2005) - [j32]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) - [j31]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) - [c81]Thomas W. Reps, Gogul Balakrishnan, Junghee Lim, Tim Teitelbaum:
A Next-Generation Platform for Analyzing Executables. APLAS 2005: 212-229 - [c80]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 - [c79]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 - [c78]Akash Lal, Thomas W. Reps, Gogul Balakrishnan:
Extended Weighted Pushdown Systems. CAV 2005: 434-448 - [c77]Alexey Loginov, Thomas W. Reps, Shmuel Sagiv:
Abstraction Refinement via Inductive Learning. CAV 2005: 519-533 - [c76]Gogul Balakrishnan, Radu Gruian, Thomas W. Reps, Tim Teitelbaum:
CodeSurfer/x86-A Platform for Analyzing x86 Executables. CC 2005: 250-254 - [c75]Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Thomas W. Reps, Randal E. Bryant:
Automatic discovery of API-level exploits. ICSE 2005: 312-321 - [c74]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 - [c73]Denis Gopan, Thomas W. Reps, Shmuel Sagiv:
A framework for numeric analysis of array operations. POPL 2005: 338-350 - [c72]Bertrand Jeannet, Denis Gopan, Thomas W. Reps:
A Relational Abstraction for Functions. SAS 2005: 186-202 - [c71]