Thomas W. Reps - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

2010

A relational approach to interprocedural shape analysisBertrand Jeannet, Alexey Loginov, Thomas W. Reps, Mooly Sagiv. TOPLAS, 32(2), 2010. [doi]

2009

2008

2007

Comparison Under Abstraction for Verifying LinearizabilityDaphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, Eran Yahav. cav 2007: 477-490 [doi]

DIVINE: DIscovering Variables IN ExecutablesGogul Balakrishnan, Thomas W. Reps. vmcai 2007: 1-28 [doi]

Revamping TVLA: Making Parametric Shape Analysis CompetitiveIgor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly Sagiv. cav 2007: 221-225 [doi]

Low-Level Library Analysis and SummarizationDenis Gopan, Thomas W. Reps. cav 2007: 68-81 [doi]

Guided Static AnalysisDenis Gopan, Thomas W. Reps. SAS 2007: 349-365 [doi]

Abstract Error ProjectionAkash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili. SAS 2007: 200-217 [doi]

Constructing Specialized Shape Analyses for Uniform ChangeTal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps. vmcai 2007: 215-233 [doi]

Labelled ClausesTal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv. cade 2007: 311-327 [doi]

Program Analysis Using Weighted Pushdown SystemsThomas W. Reps, Akash Lal, Nicholas Kidd. fsttcs 2007: 23-51 [doi]

Logical characterizations of heap abstractionsGreta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm. tocl, 8(1), 2007. [doi]

2006

Recency-Abstraction for Heap-Allocated StorageGogul Balakrishnan, Thomas W. Reps. SAS 2006: 221-239 [doi]

Verifying Concurrent Message-Passing C Programs with Recursive CallsSagar Chaki, Edmund M. Clarke, Nicholas Kidd, Thomas W. Reps, Tayssir Touili. TACAS 2006: 334-349 [doi]

Lookahead WideningDenis Gopan, Thomas W. Reps. cav 2006: 452-466 [doi]

Weighted Pushdown Systems and Trust-Management SystemsSomesh Jha, Stefan Schwoon, Hao Wang, Thomas W. Reps. TACAS 2006: 1-26 [doi]

Improving Pushdown System Model CheckingAkash Lal, Thomas W. Reps. cav 2006: 343-357 [doi]

Extracting Output Formats from ExecutablesJunghee Lim, Thomas W. Reps, Ben Liblit. wcre 2006: 167-178 [doi]

Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal AlgorithmAlexey Loginov, Thomas W. Reps, Mooly Sagiv. SAS 2006: 261-279 [doi]

Refinement-Based Verification for Possibly-Cyclic ListsAlexey Loginov, Thomas W. Reps, Mooly Sagiv. birthday 2007: 247-272 [doi]

An Appreciation of the Work of Reinhard WilhelmThomas W. Reps, Mooly Sagiv, Jörg Bauer. birthday 2007: 1-11 [doi]

Intermediate-representation recovery from low-level codeThomas W. Reps, Gogul Balakrishnan, Junghee Lim. PEPM 2006: 100-111 [doi]

Reducing the Dependence of SPKI/SDSI on PKIHao Wang, Somesh Jha, Thomas W. Reps, Stefan Schwoon, Stuart G. Stubblebine. esorics 2006: 156-173 [doi]

Verifying Temporal Heap Properties Specified via Evolution LogicEran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. igpl, 14(5):755-783, 2006. [doi]

2005

Analysis of recursive state machinesRajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis. TOPLAS, 27(4):786-818, 2005. [doi]

CodeSurfer/x86-A Platform for Analyzing x86 ExecutablesGogul Balakrishnan, Radu Gruian, Thomas W. Reps, Tim Teitelbaum. CC 2005: 250-254 [doi]

WYSINWYX: What You See Is Not What You eXecuteGogul Balakrishnan, Thomas W. Reps, David Melski, Tim Teitelbaum. vstte 2008: 202-213 [doi]

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: 158-163 [doi]

Automatic Verification of Strongly Dynamic Software SystemsNurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, Ganesan Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh. vstte 2008: 82-92 [doi]

Automatic discovery of API-level exploitsVinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Thomas W. Reps, Randal E. Bryant. ICSE 2005: 312-321 [doi]

A framework for numeric analysis of array operationsDenis Gopan, Thomas W. Reps, Shmuel Sagiv. POPL 2005: 338-350 [doi]

A Relational Abstraction for FunctionsBertrand Jeannet, Denis Gopan, Thomas W. Reps. SAS 2005: 186-202 [doi]

Extended Weighted Pushdown SystemsAkash Lal, Thomas W. Reps, Gogul Balakrishnan. cav 2005: 434-448 [doi]

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data StructuresTal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, S. Srivastava, Greta Yorsh. cade 2005: 99-115 [doi]

Abstraction Refinement via Inductive LearningAlexey Loginov, Thomas W. Reps, Shmuel Sagiv. cav 2005: 519-533 [doi]

A Next-Generation Platform for Analyzing ExecutablesThomas W. Reps, Gogul Balakrishnan, Junghee Lim, Tim Teitelbaum. aplas 2005: 212-229 [doi]

Weighted pushdown systems and their application to interprocedural dataflow analysisThomas W. Reps, Stefan Schwoon, Somesh Jha, David Melski. SCP, 58(1-2):206-263, 2005. [doi]

A semantics for procedure local heaps and its abstractionsNoam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. POPL 2005: 296-309 [doi]

Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing WorkGreta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv. ENTCS, 131:125-138, 2005. [doi]

2004

Analyzing Memory Accesses in x86 ExecutablesGogul Balakrishnan, Thomas W. Reps. CC 2004: 5-23 [doi]

Numeric Domains with Summarized DimensionsDenis Gopan, Frank DiMaio, Nurit Dor, Thomas W. Reps, Shmuel Sagiv. TACAS 2004: 512-529 [doi]

Verification via Structure SimulationNeil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh. cav 2004: 281-294 [doi]

The Boundary Between Decidability and Undecidability for Transitive-Closure LogicsNeil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh. csl 2004: 160-174 [doi]

A Relational Approach to Interprocedural Shape AnalysisBertrand Jeannet, Alexey Loginov, Thomas W. Reps, Shmuel Sagiv. SAS 2004: 246-264 [doi]

Model checking SPKI/SDSISomesh Jha, Thomas W. Reps. jcs, 12(3-4):317-353, 2004.

Symbolic Implementation of the Best TransformerThomas W. Reps, Shmuel Sagiv, Greta Yorsh. vmcai 2004: 252-266 [doi]

Static Program Analysis via 3-Valued LogicThomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. cav 2004: 15-30 [doi]

Symbolically Computing Most-Precise Abstract Operations for Shape AnalysisGreta Yorsh, Thomas W. Reps, Shmuel Sagiv. TACAS 2004: 530-545 [doi]

2003

Tool Support for Fine-Grained Software InspectionPaul Anderson, Thomas W. Reps, Tim Teitelbaum, Mark Zarins. IEEE Software, 20(4):42-50, 2003. [doi]

Design and Implementation of a Fine-Grained Software Inspection ToolPaul Anderson, Thomas W. Reps, Tim Teitelbaum. TSE, 29(8):721-733, 2003. [doi]

The Interprocedural Express-Lane TransformationDavid Melski, Thomas W. Reps. cc 2003: 200-216 [doi]

Computational Divided Differencing and Divided-Difference ArithmeticsThomas W. Reps, Louis B. Rall. lisp, 16(1-2):93-149, 2003. [doi]

Finite Differencing of Logical Formulas for Static AnalysisThomas W. Reps, Shmuel Sagiv, Alexey Loginov. ESOP 2003: 380-398 [doi]

Weighted Pushdown Systems and Their Application to Interprocedural Dataflow AnalysisThomas W. Reps, Stefan Schwoon, Somesh Jha. SAS 2003: 189-213 [doi]

On Generalized Authorization ProblemsStefan Schwoon, Somesh Jha, Thomas W. Reps, Stuart G. Stubblebine. csfw 2003: 202 [doi]

Verifying Temporal Heap Properties Specified via Evolution LogicEran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. ESOP 2003: 204-222 [doi]

2002

2001

Model Checking of Unrestricted Hierarchical State MachinesMichael Benedikt, Patrice Godefroid, Thomas W. Reps. icalp 2001: 652-666 [doi]

Debugging via Run-Time Type CheckingAlexey Loginov, Suan Hsi Yong, Susan Horwitz, Thomas W. Reps. FASE 2001: 217-232 [doi]

Typestate Checking of Machine CodeZhichen Xu, Thomas W. Reps, Barton P. Miller. ESOP 2001: 335-351 [doi]

2000

1999

A Decidable Logic for Describing Linked Data StructuresMichael Benedikt, Thomas W. Reps, Shmuel Sagiv. ESOP 1999: 2-19 [doi]

Physical Type Checking for CSatish Chandra, Thomas W. Reps. PASTE 1999: 66-75 [doi]

Program Slicing of Hardware Description LanguagesEdmund M. Clarke, Masahiro Fujita, Sreeranga P. Rajan, Thomas W. Reps, Subash Shankar, Tim Teitelbaum. charme 1999: 298-312 [doi]

Parametric Shape Analysis via 3-Valued LogicShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm. POPL 1999: 105-118 [doi]

Identifying Modules via Concept AnalysisMichael Siff, Thomas W. Reps. TSE, 25(6):749-768, 1999. [doi]

Coping with Type Casts in CMichael Siff, Satish Chandra, Thomas Ball, Krishna Kunchithapadam, Thomas W. Reps. ESEC/FSE 1999: 180-198 [doi]

Pointer Analysis for Programs with Structures and CastingSuan Hsi Yong, Susan Horwitz, Thomas W. Reps. PLDI 1999: 91-103 [doi]

1998

Maximal-munch Tokenization in Linear TimeThomas W. Reps. TOPLAS, 20(2):259-273, 1998. [doi]

Program analysis via graph reachabilityThomas W. Reps. INFSOF, 40(11-12):701-726, 1998. [doi]

Solving Shape-Analysis Problems in Languages with Destructive UpdatingShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm. TOPLAS, 20(1):1-50, 1998. [doi]

1997

1996

An Incremental Algorithm for a Generalization of the Shortest-Path ProblemGanesan Ramalingam, Thomas W. Reps. jal, 21(2):267-305, 1996.

Program Specialization via Program SlicingThomas W. Reps, Todd Turnidge. dagstuhl 1996: 409-429

Solving Shape-Analysis Problems in Languages with Destructive UpdatingShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm. POPL 1996: 16-31 [doi]

PreviousNext