| Skip lists: a probabilistic alternative to balanced trees W Pugh Communications of the ACM 33 (6), 668-676, 1990 | 1848 | 1990 |
| Finding bugs is easy D Hovemeyer, W Pugh Acm sigplan notices 39 (12), 92-106, 2004 | 1366 | 2004 |
| The Omega test: a fast and practical integer programming algorithm for dependence analysis W Pugh Proceedings of the 1991 ACM/IEEE conference on Supercomputing, 4-13, 1991 | 1275 | 1991 |
| The Java memory model J Manson, W Pugh, SV Adve ACM SIGPLAN Notices 40 (1), 378-391, 2005 | 941 | 2005 |
| Using static analysis to find bugs N Ayewah, W Pugh, D Hovemeyer, JD Morgenthaler, J Penix IEEE software 25 (5), 22-29, 2008 | 811 | 2008 |
| A practical algorithm for exact array dependence analysis W Pugh Communications of the ACM 35 (8), 102-114, 1992 | 564 | 1992 |
| Evaluating static analysis defect warnings on production software N Ayewah, W Pugh, JD Morgenthaler, J Penix, YQ Zhou Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for …, 2007 | 326 | 2007 |
| Incremental computation via function caching W Pugh, T Teitelbaum Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of …, 1989 | 265 | 1989 |
| The omega library interface guide W Kelly, V Maslov, W Pugh, E Rosser, T Shpeisman, D Wonnacott University of Maryland at College Park, 1995 | 263 | 1995 |
| An exact method for analysis of value-based array data dependences W Pugh, D Wonnacott International Workshop on Languages and Compilers for Parallel Computing …, 1993 | 253 | 1993 |
| Symbolic model checking of infinite state systems using Presburger arithmetic T Bultan, R Gerber, W Pugh Computer Aided Verification: 9th International Conference, CAV'97 Haifa …, 1997 | 233 | 1997 |
| Experiences with marmoset: designing and using an advanced submission and testing system for programming courses J Spacco, D Hovemeyer, W Pugh, F Emad, JK Hollingsworth, ... ACM Sigcse Bulletin 38 (3), 13-17, 2006 | 211 | 2006 |
| Counting solutions to presburger formulas: How and why W Pugh ACM SIGPLAN Notices 29 (6), 121-134, 1994 | 209 | 1994 |
| Skip lists: A probabilistic alternative to balanced trees W Pugh Workshop on Algorithms and Data Structures, 437-449, 1989 | 206 | 1989 |
| Fixing the Java memory model W Pugh Proceedings of the ACM 1999 conference on Java Grande, 89-98, 1999 | 205 | 1999 |
| Code generation for multiple mappings W Kelly, W Pugh, E Rosser Proceedings Frontiers' 95. The Fifth Symposium on the Frontiers of Massively …, 1995 | 186 | 1995 |
| Eliminating false data dependences using the Omega test W Pugh, D Wonnacott Acm Sigplan Notices 27 (7), 140-151, 1992 | 186 | 1992 |
| Finding more null pointer bugs, but not too many D Hovemeyer, W Pugh Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for …, 2007 | 181 | 2007 |
| Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results T Bultan, R Gerber, W Pugh ACM Transactions on Programming Languages and Systems (TOPLAS) 21 (4), 747-789, 1999 | 178 | 1999 |
| The google findbugs fixit N Ayewah, W Pugh Proceedings of the 19th international symposium on Software testing and …, 2010 | 173 | 2010 |
