| Year |
Citation |
Score |
| 2017 |
Reps T, Turetsky E, Prabhu P. Newtonian Program Analysis via Tensor Product Acm Transactions On Programming Languages and Systems. 39: 9. DOI: 10.1145/3024084 |
0.395 |
|
| 2015 |
Thakur A, Lal A, Lim J, Reps T. PostHat and All That Electronic Notes in Theoretical Computer Science. 311: 15-32. DOI: 10.1016/J.Entcs.2015.02.003 |
0.762 |
|
| 2014 |
Elder M, Lim J, Sharma T, Andersen T, Reps T. Abstract Domains of Affine Relations Acm Transactions On Programming Languages and Systems. 36: 11. DOI: 10.1145/2651361 |
0.646 |
|
| 2014 |
Aung M, Horwitz S, Joiner R, Reps T. Specialization Slicing Acm Transactions On Programming Languages and Systems. 36. DOI: 10.1145/2566620 |
0.488 |
|
| 2013 |
Lim J, Reps T. TSL: A System for Generating Abstract Interpreters and its Application to Machine-Code Analysis Acm Transactions On Programming Languages and Systems. 35: 4. DOI: 10.1145/2450136.2450139 |
0.621 |
|
| 2013 |
Zhang W, Sun C, Lim J, Lu S, Reps T. ConMem: Detecting Crash-Triggering Concurrency Bugs through an Effect-Oriented Approach Acm Transactions On Software Engineering and Methodology. 22: 10. DOI: 10.1145/2430545.2430546 |
0.626 |
|
| 2011 |
Kidd N, Reps T, Dolby J, Vaziri M. Finding concurrency-related bugs using random isolation International Journal On Software Tools For Technology Transfer. 13: 495-518. DOI: 10.1007/S10009-011-0197-7 |
0.736 |
|
| 2011 |
Kidd N, Lammich P, Touili T, Reps T. A decision procedure for detecting atomicity violations for communicating processes with locks International Journal On Software Tools For Technology Transfer. 13: 37-60. DOI: 10.1007/S10009-010-0159-5 |
0.727 |
|
| 2011 |
Lim J, Lal A, Reps T. Symbolic analysis via semantic reinterpretation International Journal On Software Tools For Technology Transfer. 13: 61-87. DOI: 10.1007/S10009-010-0158-6 |
0.738 |
|
| 2010 |
Reps T, Sagiv M, Loginov A. Finite differencing of logical formulas for static analysis Acm Transactions On Programming Languages and Systems. 32: 24. DOI: 10.1145/1749608.1749613 |
0.667 |
|
| 2010 |
Balakrishnan G, Reps T. WYSINWYX: What you see is not what you execute Acm Transactions On Programming Languages and Systems. 32. DOI: 10.1145/1749608.1749612 |
0.599 |
|
| 2010 |
Jeannet B, Loginov A, Reps T, Sagiv M. A relational approach to interprocedural shape analysis Acm Transactions On Programming Languages and Systems. 32: 5-52. DOI: 10.1145/1667048.1667050 |
0.696 |
|
| 2010 |
Elder M, Gopan D, Reps T. View-augmented abstractions Electronic Notes in Theoretical Computer Science. 267: 43-57. DOI: 10.1016/J.Entcs.2010.09.005 |
0.748 |
|
| 2007 |
Yorsh G, Reps T, Sagiv M, Wilhelm R. Logical characterizations of heap abstractions Acm Transactions On Computational Logic. 8: 5. DOI: 10.1145/1182613.1182618 |
0.431 |
|
| 2007 |
Reps T, Sagiv M, Bauer J. An appreciation of the work of Reinhard Wilhelm Lecture Notes in Computer Science. 4444: 1-11. DOI: 10.1007/978-3-540-71322-7_1 |
0.437 |
|
| 2006 |
Yahav E, Reps T, Sagiv M, Wilhelm R. Verifying Temporal Heap Properties Specified via Evolution Logic Logic Journal of the Igpl. 14: 755-783. DOI: 10.1093/Jigpal/Jzl009 |
0.467 |
|
| 2005 |
Alur R, Benedikt M, Etessami K, Godefroid P, Reps T, Yannakakis M. Analysis of recursive state machines Acm Transactions On Programming Languages and Systems. 27: 786-818. DOI: 10.1145/1075382.1075387 |
0.344 |
|
| 2005 |
Reps T, Schwoon S, Jha S, Melski D. Weighted pushdown systems and their application to interprocedural dataflow analysis Science of Computer Programming. 58: 206-263. DOI: 10.1016/J.Scico.2005.02.009 |
0.671 |
|
| 2005 |
Yorsh G, Skidanov A, Reps T, Sagiv M. Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs Electronic Notes in Theoretical Computer Science. 131: 125-138. DOI: 10.1016/J.Entcs.2005.01.028 |
0.433 |
|
| 2004 |
Jha S, Reps T. Model checking SPKI/SDSI Journal of Computer Security. 12: 317-353. DOI: 10.3233/Jcs-2004-123-402 |
0.394 |
|
| 2004 |
Horwitz S, Reps T, Binkley D. Interprocedural slicing using dependence graphs Acm Sigplan Notices. 39: 232-243. DOI: 10.1145/77606.77608 |
0.473 |
|
| 2003 |
Anderson P, Reps T, Teitelbaum T. Design and implementation of a fine-grained software inspection tool Ieee Transactions On Software Engineering. 29: 721-733. DOI: 10.1109/Tse.2003.1223646 |
0.4 |
|
| 2003 |
Anderson P, Reps T, Teitelbaum T, Zarins M. Tool support for fine-grained software inspection Ieee Software. 20: 42-50. DOI: 10.1109/Ms.2003.1207453 |
0.391 |
|
| 2002 |
Sagiv M, Reps T, Wilhelm R. Parametric shape analysis via 3-valued logic Acm Transactions On Programming Languages and Systems. 24: 217-298. DOI: 10.1145/514188.514190 |
0.51 |
|
| 2000 |
Reps T. Undecidability of context-sensitive data-dependence analysis Acm Transactions On Programming Languages and Systems. 22: 162-186. DOI: 10.1145/345099.345137 |
0.375 |
|
| 2000 |
Melski D, Reps T. Interconvertibility of a class of set constraints and context-free-language reachability Theoretical Computer Science. 248: 29-98. DOI: 10.1016/S0304-3975(00)00049-9 |
0.687 |
|
| 1999 |
Siff M, Reps T. Identifying modules via concept analysis Ieee Transactions On Software Engineering. 25: 749-768. DOI: 10.1109/32.824377 |
0.38 |
|
| 1998 |
Müller H, Reps T, Snelting G. Program comprehension and software reengineering Acm Sigsoft Software Engineering Notes. 23: 36-44. DOI: 10.1145/290249.290260 |
0.415 |
|
| 1998 |
Reps T. “Maximal-munch” tokenization in linear time Acm Transactions On Programming Languages and Systems. 20: 259-273. DOI: 10.1145/276393.276394 |
0.347 |
|
| 1998 |
Sagiv M, Reps T, Wilhelm R. Solving shape-analysis problems in languages with destructive updating Acm Transactions On Programming Languages and Systems. 20: 1-50. DOI: 10.1145/271510.271517 |
0.485 |
|
| 1996 |
Sagiv M, Reps T, Horwitz S. Precise interprocedural dataflow analysis with applications to constant propagation Theoretical Computer Science. 167: 131-170. DOI: 10.1016/0304-3975(96)00072-2 |
0.474 |
|
| 1996 |
Ramalingam G, Reps T. On the computational complexity of dynamic graph problems Theoretical Computer Science. 158: 233-277. DOI: 10.1016/0304-3975(95)00079-8 |
0.365 |
|
| 1996 |
Reps T. On the sequential nature of interprocedural program-analysis problems Acta Informatica. 33: 739-757. DOI: 10.1007/Bf03036473 |
0.461 |
|
| 1996 |
Ramalingam G, Reps T. An Incremental Algorithm for a Generalization of the Shortest-Path Problem Journal of Algorithms. 21: 267-305. DOI: 10.1006/Jagm.1996.0046 |
0.399 |
|
| 1995 |
Binkley D, Horwitz S, Reps T. Program Integration for Languages with Procedure Calls Acm Transactions On Software Engineering and Methodology (Tosem). 4: 3-35. DOI: 10.1145/201055.201056 |
0.466 |
|
| 1994 |
Ramalingam G, Reps T. On competitive on-line algorithms for the dynamic priority-ordering problem Information Processing Letters. 51: 155-161. DOI: 10.1016/0020-0190(94)00080-8 |
0.355 |
|
| 1992 |
Klint P, Reps T, Snelting G. Programming environments: report on an international workshop at Dagstuhl Castle Sigplan Notices. 27: 90-96. DOI: 10.1145/141018.141058 |
0.369 |
|
| 1992 |
Yang W, Horwitz S, Reps T. A Program Integration Algorithm that Accommodates Semantics-Preserving Transformations Acm Transactions On Software Engineering and Methodology (Tosem). 1: 310-354. DOI: 10.1145/131736.131756 |
0.426 |
|
| 1991 |
Horwitz S, Reps T. Efficient comparison of program slices Acta Informatica. 28: 713-732. DOI: 10.1007/Bf01261653 |
0.453 |
|
| 1990 |
Yang W, Horwitz S, Reps T. A program integration algorithm that accommodates semantics-preserving transformations Acm Sigsoft Software Engineering Notes. 15: 133-143. DOI: 10.1145/99278.99290 |
0.429 |
|
| 1989 |
Horwitz S, Prins J, Reps T. Integrating Noninterfering Versions of Programs Acm Transactions On Programming Languages and Systems (Toplas). 11: 345-387. DOI: 10.1145/65979.65980 |
0.463 |
|
| 1988 |
Reps T. Incremental evaluation for attribute grammars with unrestricted movement between tree modifications Acta Informatica. 25: 155-178. DOI: 10.1007/Bf00263583 |
0.444 |
|
| 1987 |
Reps T, Demers A. Sublinear-space evaluation algorithms for attribute grammars Acm Transactions On Programming Languages and Systems. 9: 408-440. DOI: 10.1145/24039.214529 |
0.319 |
|
| 1983 |
Reps T, Teitelbaum T, Demers A. Incremental Context-Dependent Analysis for Language-Based Editors Acm Transactions On Programming Languages and Systems. 5: 449-477. DOI: 10.1145/2166.357218 |
0.327 |
|
| 1981 |
Teitelbaum T, Reps T, Horwitz S. The why and wherefore of the Cornell Program Synthesizer Acm Sigplan Notices. 16: 8-16. DOI: 10.1145/872730.806448 |
0.421 |
|
| 1981 |
Teitelbaum T, Reps T. The Cornell program synthesizer: a syntax-directed programming environment Communications of the Acm. 24: 563-573. DOI: 10.1145/358746.358755 |
0.434 |
|
| Show low-probability matches. |