Search the dblp DataBase
William Pugh :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
William Pugh Skip Lists: A Probabilistic Alternative to Balanced Trees. [Citation Graph (2, 0)][DBLP ] Commun. ACM, 1990, v:33, n:6, pp:668-676 [Journal ] William Pugh Keynote talk: Advice to bug hunters. [Citation Graph (0, 0)][DBLP ] AADEBUG, 2005, pp:1-2 [Conf ] Tevfik Bultan , Richard Gerber , William Pugh Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic. [Citation Graph (0, 0)][DBLP ] CAV, 1997, pp:400-411 [Conf ] Vadim Maslov , William Pugh Simplifying Polynominal Constraints Over Integers to Make Dependence Analysis More Precise. [Citation Graph (0, 0)][DBLP ] CONPAR, 1994, pp:737-748 [Conf ] David Hovemeyer , William Pugh , Jaime Spacco Atomic Instructions in Java. [Citation Graph (0, 0)][DBLP ] ECOOP, 2002, pp:133-154 [Conf ] William Pugh Probabilistic Analysis of Set Operations with Constant-Time Set Equality Test. [Citation Graph (0, 0)][DBLP ] ICCI, 1990, pp:62-71 [Conf ] Wayne Kelly , William Pugh Minimizing Communication While Preserving Parallelism. [Citation Graph (0, 0)][DBLP ] International Conference on Supercomputing, 1996, pp:52-60 [Conf ] William Pugh Uniform techniques for loop optimization. [Citation Graph (0, 0)][DBLP ] ICS, 1991, pp:341-352 [Conf ] William Pugh , Evan Rosser Iteration Space Slicing and Its Application to Communication Optimization. [Citation Graph (0, 0)][DBLP ] International Conference on Supercomputing, 1997, pp:221-228 [Conf ] William Pugh Fixing the Java Memory Model. [Citation Graph (0, 0)][DBLP ] Java Grande, 1999, pp:89-98 [Conf ] Jeremy Manson , William Pugh Core semantics of multithreaded Java. [Citation Graph (0, 0)][DBLP ] Java Grande, 2001, pp:29-38 [Conf ] David Hovemeyer , William Pugh More Efficient Network Class Loading Through Bundling. [Citation Graph (0, 0)][DBLP ] Java Virtual Machine Research and Technology Symposium, 2001, pp:127-140 [Conf ] Wayne Kelly , William Pugh , Evan Rosser , Tatiana Shpeisman Transitive Closure of Infinite Graphs and Its Applications. [Citation Graph (0, 0)][DBLP ] LCPC, 1995, pp:126-140 [Conf ] Wayne Kelly , William Pugh Finding Legal Reordering Transformations Using Mappings. [Citation Graph (0, 0)][DBLP ] LCPC, 1994, pp:107-124 [Conf ] Konstantin Berlin , Jun Huan , Mary Jacob , Garima Kochhar , Jan Prins , William Pugh , P. Sadayappan , Jaime Spacco , Chau-Wen Tseng Evaluating the Impact of Programming Language Features on the Performance of Parallel Applications on Cluster Architectures. [Citation Graph (0, 0)][DBLP ] LCPC, 2003, pp:194-208 [Conf ] Thomas J. Sheffler , Robert Schreiber , William Pugh , John R. Gilbert , Siddhartha Chatterjee Efficient Distribution Analysis via Graph Contraction. [Citation Graph (0, 0)][DBLP ] LCPC, 1995, pp:377-391 [Conf ] William Pugh , Evan Rosser Iteration Space Slicing for Locality. [Citation Graph (0, 0)][DBLP ] LCPC, 1999, pp:164-184 [Conf ] William Pugh , Evan Rosser , Tatiana Shpeisman Exploiting Monotone Convergence Functions in Parallel Programs. [Citation Graph (0, 0)][DBLP ] LCPC, 1996, pp:75-85 [Conf ] William Pugh , Jaime Spacco MPJava: High-Performance Message Passing in Java Using Java.nio. [Citation Graph (0, 0)][DBLP ] LCPC, 2003, pp:323-339 [Conf ] William Pugh , Tatiana Shpeisman SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations. [Citation Graph (0, 0)][DBLP ] LCPC, 1998, pp:213-229 [Conf ] William Pugh , David Wonnacott An Exact Method for Analysis of Value-based Array Data Dependences. [Citation Graph (0, 0)][DBLP ] LCPC, 1993, pp:546-566 [Conf ] William Pugh An Improved Replacement Strategy for Function Aaching. [Citation Graph (0, 0)][DBLP ] LISP and Functional Programming, 1988, pp:269-276 [Conf ] Jaime Spacco , David Hovemeyer , William Pugh Tracking defect warnings across versions. [Citation Graph (0, 0)][DBLP ] MSR, 2006, pp:133-136 [Conf ] Jaime Spacco , Jaymie Strecker , David Hovemeyer , William Pugh Software repository mining with Marmoset: an automated programming project snapshot and testing system. [Citation Graph (0, 0)][DBLP ] MSR, 2005, pp:- [Conf ] Brian Cole , Daniel Hakim , David Hovemeyer , Reuven Lazarus , William Pugh , Kristin Stephens Improving your software using static analysis to find bugs. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2006, pp:673-674 [Conf ] David Hovemeyer , William Pugh Finding bugs is easy. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2004, pp:132-136 [Conf ] William Pugh , Jaime Spacco RUBiS revisited: why J2EE benchmarking is hard. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2004, pp:204-205 [Conf ] Jaime Spacco , William Pugh Helping students appreciate test-driven development (TDD). [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2006, pp:907-913 [Conf ] Jaime Spacco , William Pugh , Nathaniel Ayewah , David Hovemeyer The Marmoset project: an automated snapshot, submission, and testing system. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2006, pp:669-670 [Conf ] David Hovemeyer , Jaime Spacco , William Pugh Evaluating and tuning a static analysis to find null pointer bugs. [Citation Graph (0, 0)][DBLP ] PASTE, 2005, pp:13-19 [Conf ] William Pugh Advice to Authors of Extended Abstracts. [Citation Graph (0, 0)][DBLP ] PLDI, 1991, pp:353-356 [Conf ] William Pugh Counting Solutions to Presburger Formulas: How and Why. [Citation Graph (0, 0)][DBLP ] PLDI, 1994, pp:121-134 [Conf ] William Pugh Compressing Java Class Files. [Citation Graph (0, 0)][DBLP ] PLDI, 1999, pp:247-258 [Conf ] William Pugh , Grant E. Weddell Two-Directional Record Layout for Multiple Inheritance. [Citation Graph (0, 0)][DBLP ] PLDI, 1990, pp:85-91 [Conf ] William Pugh , David Wonnacott Eliminating False Data Dependences using the Omega Test. [Citation Graph (0, 0)][DBLP ] PLDI, 1992, pp:140-151 [Conf ] Jeremy Manson , William Pugh , Sarita V. Adve The Java memory model. [Citation Graph (0, 0)][DBLP ] POPL, 2005, pp:378-391 [Conf ] Vivek Nirkhe , William Pugh Partial Evaluation of High-Level Imperative Programming Languages, with Applications in Hard Real-Time Systems. [Citation Graph (0, 0)][DBLP ] POPL, 1992, pp:269-280 [Conf ] William Pugh , Tim Teitelbaum Incremental Computation via Function Caching. [Citation Graph (0, 0)][DBLP ] POPL, 1989, pp:315-328 [Conf ] William Pugh , David Wonnacott Experiences with Constraint-based Array Dependence Analysis. [Citation Graph (0, 0)][DBLP ] PPCP, 1994, pp:312-325 [Conf ] William Pugh The Omega test: a fast and practical integer programming algorithm for dependence analysis. [Citation Graph (0, 0)][DBLP ] SC, 1991, pp:4-13 [Conf ] William Pugh Skip Lists: A Probabilistic Alternative to Balanced Trees. [Citation Graph (0, 0)][DBLP ] WADS, 1989, pp:437-449 [Conf ] William Pugh A Practical Algorithm for Exact Array Dependence Analysis. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1992, v:35, n:8, pp:102-114 [Journal ] William Pugh The Java memory model is fatally flawed. [Citation Graph (0, 0)][DBLP ] Concurrency - Practice and Experience, 2000, v:12, n:6, pp:445-455 [Journal ] William Pugh Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:34, n:5, pp:251-254 [Journal ] P. David Stotts , William Pugh Parallel finite automata for modeling concurrent software systems. [Citation Graph (0, 0)][DBLP ] Journal of Systems and Software, 1994, v:27, n:1, pp:27-43 [Journal ] William Pugh Definitions of Dependence Distance. [Citation Graph (0, 0)][DBLP ] LOPLAS, 1992, v:1, n:3, pp:261-265 [Journal ] Wayne Kelly , William Pugh Selecting Affine Mappings Based on Performance Estimation. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1994, v:4, n:, pp:205-219 [Journal ] Vivek Nirkhe , William Pugh A Partial Evaluator for the Maruti Hard Real-Time System. [Citation Graph (0, 0)][DBLP ] Real-Time Systems, 1993, v:5, n:1, pp:13-30 [Journal ] David Hovemeyer , William Pugh Finding bugs is easy. [Citation Graph (0, 0)][DBLP ] SIGPLAN Notices, 2004, v:39, n:12, pp:92-106 [Journal ] Richard Gerber , William Pugh , Manas Saksena Parametric Dispatching of Hard Real-Time Tasks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1995, v:44, n:3, pp:471-479 [Journal ] Tevfik Bultan , Richard Gerber , William Pugh Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1999, v:21, n:4, pp:747-789 [Journal ] William Pugh , David Wonnacott Static Analysis of Upper and Lower Bounds on Dependences and Parallelism. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1994, v:16, n:4, pp:1248-1278 [Journal ] William Pugh , David Wonnacott Constraint-Based Array Dependence Analysis. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1998, v:20, n:3, pp:635-678 [Journal ] William Pugh , David Wonnacott Going Beyond Integer Programming with the Omega Test to Eliminate False Data Dependences. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:2, pp:204-211 [Journal ] David Hovemeyer , William Pugh Status report on JSR-305: annotations for software defect detection. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2007, pp:799-800 [Conf ] Nathaniel Ayewah , William Pugh , J. David Morgenthaler , John Penix , Yuqian Zhou Using FindBugs on production software. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2007, pp:805-806 [Conf ] Nathaniel Ayewah , William Pugh , J. David Morgenthaler , John Penix , Yuqian Zhou Evaluating static analysis defect warnings on production software. [Citation Graph (0, 0)][DBLP ] PASTE, 2007, pp:1-8 [Conf ] David Hovemeyer , William Pugh Finding more null pointer bugs, but not too many. [Citation Graph (0, 0)][DBLP ] PASTE, 2007, pp:9-14 [Conf ] Jeffrey S. Foster , Michael W. Hicks , William Pugh Improving software quality with static analysis. [Citation Graph (0, 0)][DBLP ] PASTE, 2007, pp:83-84 [Conf ] Jaime Spacco , David Hovemeyer , William Pugh , Fawzi Emad , Jeffrey K. Hollingsworth , Nelson Padua-Perez Experiences with marmoset: designing and using an advanced submission and testing system for programming courses. [Citation Graph (0, 0)][DBLP ] ITiCSE, 2006, pp:13-17 [Conf ] What do high-level memory models mean for transactions? [Citation Graph (, )][DBLP ] A report on a survey and study of static analysis users. [Citation Graph (, )][DBLP ] The Google FindBugs fixit. [Citation Graph (, )][DBLP ] Unit testing concurrent software. [Citation Graph (, )][DBLP ] Learning from defect removals. [Citation Graph (, )][DBLP ] Null dereference analysis in practice. [Citation Graph (, )][DBLP ] An Eclipse-based course project snapshot and submission system. [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.009secs