Skip lists: a probabilistic alternative to balanced trees W Pugh Communications of the ACM 33 (6), 668-676, 1990 | 1534 | 1990 |

Finding bugs is easy D Hovemeyer, W Pugh Acm sigplan notices 39 (12), 92-106, 2004 | 1175 | 2004 |

The Omega test: a fast and practical integer programming algorithm for dependence analysis W Pugh Supercomputing'91: Proceedings of the 1991 ACM/IEEE conference on …, 1991 | 1174 | 1991 |

The Java memory model J Manson, W Pugh, SV Adve ACM SIGPLAN Notices 40 (1), 378-391, 2005 | 836 | 2005 |

A practical algorithm for exact array dependence analysis W Pugh Communications of the ACM 35 (8), 102-114, 1992 | 539 | 1992 |

Using static analysis to find bugs N Ayewah, W Pugh, D Hovemeyer, JD Morgenthaler, J Penix IEEE software 25 (5), 22-29, 2008 | 524 | 2008 |

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 | 266 | 2007 |

The omega library interface guide W Kelly, V Maslov, W Pugh, E Rosser, T Shpeisman, D Wonnacott University of Maryland at College Park, 1995 | 246 | 1995 |

Symbolic model checking of infinite state systems using Presburger arithmetic T Bultan, R Gerber, W Pugh International Conference on Computer Aided Verification, 400-411, 1997 | 237 | 1997 |

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 | 237 | 1993 |

Incremental computation via function caching W Pugh, T Teitelbaum Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of …, 1989 | 226 | 1989 |

Counting solutions to presburger formulas: How and why W Pugh ACM SIGPLAN Notices 29 (6), 121-134, 1994 | 197 | 1994 |

Skip lists: A probabilistic alternative to balanced trees W Pugh Workshop on Algorithms and Data Structures, 437-449, 1989 | 191 | 1989 |

Fixing the Java memory model W Pugh Proceedings of the ACM 1999 conference on Java Grande, 89-98, 1999 | 183 | 1999 |

Code generation for multiple mappings W Kelly, W Pugh, E Rosser Proceedings Frontiers' 95. The Fifth Symposium on the Frontiers of Massively …, 1995 | 178 | 1995 |

Eliminating false data dependences using the Omega test W Pugh, D Wonnacott ACM SIGPLAN Notices 27 (7), 140-151, 1992 | 177 | 1992 |

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 | 171 | 1999 |

A framework for unifying reordering transformations W Kelly, W Pugh | 161 | 1998 |

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 | 158 | 2006 |

Compressing Java class files W Pugh ACM SIGPLAN Notices 34 (5), 247-258, 1999 | 153 | 1999 |