Institution · GrammaTech (United States)
Most cited papers from GrammaTech (United States)
What are the most cited papers from GrammaTech (United States)?
The most cited paper from GrammaTech (United States) is "WYSINWYX" (Gogul Balakrishnan, Thomas Reps, 2010), with 277 citations. Next come "Local versus Global Lessons for Defect Prediction and Effort Estimation" (262) and "Reducing concurrent analysis under a context bound to sequential analysis" (192).
Showing 50 of 57 papers. Every paper with more than 22 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | WYSINWYX Gogul Balakrishnan, Thomas Reps · ACM Transactions on Programming Languages and Systems | Aug 2010 | 277 |
| 2 | Local versus Global Lessons for Defect Prediction and Effort Estimation Tim Menzies, Andrew R. Butcher, David R. Cok et al. · IEEE Transactions on Software Engineering | 31 May 2013 | 262 |
| 3 | Reducing concurrent analysis under a context bound to sequential analysis Akash Lal, Thomas Reps · Formal Methods in System Design | 6 Jul 2009 | 192 |
| 4 | The Surprising Creativity of Digital Evolution: A Collection of Anecdotes from the Evolutionary Computation and Artificial Life Research Communities Joel Lehman et al. · Artificial Life | 9 Apr 2020 | 185 |
| 5 | Local vs. global models for effort estimation and defect prediction Tim Menzies, Andrew R. Butcher, Andrian Marcus et al. | Nov 2011 | 171 |
| 6 | Weighted pushdown systems and their application to interprocedural dataflow analysis Thomas Reps, Stefan Schwoon, Somesh Jha et al. · Science of Computer Programming | 25 May 2005 | 160 |
| 7 | WYSINWYX: What You See Is Not What You eXecute Gogul Balakrishnan, Thomas Reps, David Melski et al. · Lecture notes in computer science | 2008 | 154 |
| 8 | CodeSurfer/x86—A Platform for Analyzing x86 Executables Gogul Balakrishnan, Radu Gruian, Thomas Reps et al. · Lecture notes in computer science | 2005 | 144 |
| 9 | ConSeq Wei Zhang, Junghee Lim, Ramya Olichandran et al. | 5 Mar 2011 | 131 |
| 10 | OpenJML: JML for Java 7 by Extending OpenJDK David R. Cok · Lecture notes in computer science | 2011 | 111 |
| 11 | Active learning and effort estimation: Finding the essential content of software effort estimation data Ekrem Kocagüneli, Tim Menzies, Jacky Keung et al. · IEEE Transactions on Software Engineering | 25 Jul 2013 | 99 |
| 12 | Buffer overrun detection using linear programming and static analysis Vinod Ganapathy, Somesh Jha, David Chandler et al. | 27 Oct 2003 | 92 |
| 13 | Lookahead Widening Denis Gopan, Thomas Reps · Lecture notes in computer science | 2006 | 89 |
| 14 | Interprocedural Analysis of Concurrent Programs Under a Context Bound Akash Lal, Tayssir Touili, Nicholas Kidd et al. · Lecture notes in computer science | 2 Apr 2008 | 87 |
| 15 | Program Slicing of Hardware Description Languages E. M. Clarke, M. Fujita, Sreeranga P. Rajan et al. · Lecture notes in computer science | 1999 | 80 |
| 16 | Non-linear reasoning for invariant synthesis Zachary A. Kincaid, John Cyphert, Jason Breck et al. · Proceedings of the ACM on Programming Languages | 27 Dec 2017 | 79 |
| 17 | Things You May Not Know About Android (Un)Packers: A Systematic Study based on Whole-System Emulation Yue Duan, Mu Zhang, Abhishek Vasisht Bhaskar et al. | 2018 | 77 |
| 18 | Design and implementation of a fine-grained software inspection tool Paul Anderson, Thomas Reps, Tim Teitelbaum · IEEE Transactions on Software Engineering | Aug 2003 | 77 |
| 19 | Using recurrent neural networks for decompilation Deborah Katz, Jason Ruchti, Eric Schulte | Mar 2018 | 70 |
| 20 | Guided Static Analysis Denis Gopan, Thomas Reps · Lecture notes in computer science | 21 Aug 2007 | 70 |
| 21 | Improved Memory-Access Analysis for x86 Executables Thomas Reps, Gogul Balakrishnan · Lecture notes in computer science | Apr 2008 | 70 |
| 22 | Improving optimistic concurrency control through transaction batching and operation reordering Bailu Ding, Łucja Kot, Johannes E. Gehrke · Proceedings of the VLDB Endowment | Oct 2018 | 65 |
| 23 | OpenJML: Software verification for Java 7 using JML, OpenJDK, and Eclipse David R. Cok · Electronic Proceedings in Theoretical Computer Science | 23 Apr 2014 | 62 |
| 24 | Directed Proof Generation for Machine Code Aditya Thakur, Junghee Lim, Akash Lal et al. · Lecture notes in computer science | 2010 | 61 |
| 25 | A Method for Symbolic Computation of Abstract Operations Aditya Thakur, Thomas Reps · Lecture notes in computer science | 2012 | 59 |
| 26 | Model Checking x86 Executables with CodeSurfer/x86 and WPDS++ Gogul Balakrishnan, Thomas Reps, Nick Kidd et al. · Lecture notes in computer science | 2005 | 55 |
| 27 | Code vectors: understanding programs through embedded abstracted symbolic traces Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit et al. | 26 Oct 2018 | 51 |
| 28 | Compositional recurrence analysis revisited Zachary A. Kincaid, Jason Breck, Ashkan Forouhi Boroujeni et al. | 14 Jun 2017 | 49 |
| 29 | Verifying dereference safety via expanding-scope analysis Alexey A. Loginov, Eran Yahav, Satish Chandra et al. | 20 Jul 2008 | 47 |
| 30 | TSL Junghee Lim, Thomas Reps · ACM Transactions on Programming Languages and Systems | Apr 2013 | 46 |
| 31 | Automated Resource Analysis with Coq Proof Objects Quentin Carbonneaux, Jan Hoffmann, Thomas Reps et al. · Lecture notes in computer science | 2017 | 45 |
| 32 | Low-Level Library Analysis and Summarization Denis Gopan, Thomas Reps · Lecture notes in computer science | 29 Aug 2007 | 43 |
| 33 | Tool support for fine-grained software inspection Paul Anderson, Thomas Reps, Tim Teitelbaum et al. · IEEE Software | 23 Jun 2003 | 42 |
| 34 | When Idling is Ideal Henri Maxime Demoulin, Joshua Fried, Isaac Pedisich et al. | 19 Oct 2021 | 41 |
| 35 | Property-Directed Shape Analysis Shachar Itzhaky, Nikolaj Bjørner, Thomas Reps et al. · Lecture notes in computer science | 2014 | 41 |
| 36 | Improving Pushdown System Model Checking Akash Lal, Thomas Reps · Lecture notes in computer science | 2006 | 41 |
| 37 | Bilateral Algorithms for Symbolic Abstraction Aditya Thakur, Matt Elder, Thomas Reps · Lecture notes in computer science | 2012 | 39 |
| 38 | A Next-Generation Platform for Analyzing Executables Thomas Reps, Gogul Balakrishnan, Joon Seo Lim et al. · Lecture notes in computer science | 2005 | 37 |
| 39 | Polymorphic type inference for machine code Matt Noonan, Alexey A. Loginov, David R. Cok | 2 Jun 2016 | 36 |
| 40 | A relational approach to interprocedural shape analysis Bertrand Jeannet, Alexey A. Loginov, Thomas Reps et al. · ACM Transactions on Programming Languages and Systems | 2010 | 35 |
| 41 | Statically Inferring Complex Heap, Array, and Numeric Invariants Bill McCloskey, Thomas Reps, Mooly Sagiv · Lecture notes in computer science | 2010 | 35 |
| 42 | Closed forms for numerical loops Zachary A. Kincaid, Jason Breck, John Cyphert et al. · Proceedings of the ACM on Programming Languages | 2 Jan 2019 | 34 |
| 43 | PMAF: an algebraic framework for static analysis of probabilistic programs Di Wang, Jan Hoffmann, Thomas Reps | 11 Jun 2018 | 33 |
| 44 | A System for Generating Static Analyzers for Machine Instructions Junghee Lim, Thomas Reps · Lecture notes in computer science | Apr 2008 | 33 |
| 45 | Better Slicing of Programs with Jumps and Switches Sumit Kumar, Susan B. Horwitz · Lecture notes in computer science | 2002 | 33 |
| 46 | Synthesis of machine code from semantics Venkatesh Srinivasan, Thomas Reps | 3 Jun 2015 | 30 |
| 47 | Analyzing Stripped Device-Driver Executables Gogul Balakrishnan, Thomas Reps · Lecture notes in computer science | 2 Apr 2008 | 30 |
| 48 | PostHat and All That: Automating Abstract Interpretation Aditya Thakur, Akash Lal, Joon Seo Lim et al. · Electronic Notes in Theoretical Computer Science | Feb 2015 | 29 |
| 49 | Repairing COTS Router Firmware without Access to Source Code or Test Suites Eric Schulte, Westley R. Weimer, Stephanie Forrest | 10 Jul 2015 | 28 |
| 50 | Static analysis of medical device software using CodeSonar Raoul Praful Jetley, Paul L. Jones, Paul Anderson | 12 Jun 2008 | 27 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for an institution when any of its authors gave it as an affiliation; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.