The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas W. Reps: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  129. Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis. [Citation Graph (, )][DBLP]


  130. Directed Proof Generation for Machine Code. [Citation Graph (, )][DBLP]


  131. There's Plenty of Room at the Bottom: Analyzing and Verifying Machine Code. [Citation Graph (, )][DBLP]


  132. Improved Memory-Access Analysis for x86 Executables. [Citation Graph (, )][DBLP]


  133. A System for Generating Static Analyzers for Machine Instructions. [Citation Graph (, )][DBLP]


  134. Verifying Information Flow Control over Unbounded Processes. [Citation Graph (, )][DBLP]


  135. Program Analysis Using Weighted Pushdown Systems. [Citation Graph (, )][DBLP]


  136. Statically Inferring Complex Heap, Array, and Numeric Invariants. [Citation Graph (, )][DBLP]


  137. Solving Multiple Dataflow Queries Using WPDSs. [Citation Graph (, )][DBLP]


  138. Language Strength Reduction. [Citation Graph (, )][DBLP]


  139. Symbolic Analysis via Semantic Reinterpretation. [Citation Graph (, )][DBLP]


  140. A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks. [Citation Graph (, )][DBLP]


  141. Interprocedural Analysis of Concurrent Programs Under a Context Bound. [Citation Graph (, )][DBLP]


  142. Analyzing Stripped Device-Driver Executables. [Citation Graph (, )][DBLP]


  143. DIVINE: DIscovering Variables IN Executables. [Citation Graph (, )][DBLP]


  144. Constructing Specialized Shape Analyses for Uniform Change. [Citation Graph (, )][DBLP]


  145. Finding Concurrency-Related Bugs Using Random Isolation. [Citation Graph (, )][DBLP]


  146. Automatic Verification of Strongly Dynamic Software Systems. [Citation Graph (, )][DBLP]


  147. WYSINWYX: What You See Is Not What You eXecute. [Citation Graph (, )][DBLP]


  148. Simulating reachability using first-order logic with applications to verification of linked data structures [Citation Graph (, )][DBLP]


Search in 0.150secs, Finished in 0.155secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002