default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam W. Pugh
Person information
- affiliation: University of Maryland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j25]Brian Chess, Kris Britton, Chris Eng, Bill Pugh, Lakshmikanth Raghavan, Jacob West:
Static Analysis in Motion. IEEE Secur. Priv. 10(3): 53-56 (2012)- 2010
- [c56]Nathaniel Ayewah, William W. Pugh:
The Google FindBugs fixit. ISSTA 2010: 241-252 - [c55]Nathaniel Ayewah, William W. Pugh:
Null dereference analysis in practice. PASTE 2010: 65-72
2000 – 2009
- 2009
- [c54]Nathaniel Ayewah, William W. Pugh:
Learning from defect removals. MSR 2009: 179-182 - 2008
- [j24]Nathaniel Ayewah, David Hovemeyer, J. David Morgenthaler
, John Penix, William W. Pugh:
Using Static Analysis to Find Bugs. IEEE Softw. 25(5): 22-29 (2008) - [j23]Joseph Gil, William W. Pugh, Grant E. Weddell, Yoav Zibin:
Two-dimensional bidirectional object layout. ACM Trans. Program. Lang. Syst. 30(5): 28:1-28:38 (2008) - [c53]Nathaniel Ayewah, William W. Pugh:
A report on a survey and study of static analysis users. DEFECTS 2008: 1-5 - 2007
- [j22]Hans Boehm, Bill Pugh, Doug Lea:
Multithreading in C and C++. login Usenix Mag. 32(1) (2007) - [c52]William W. Pugh, Nathaniel Ayewah:
Unit testing concurrent software. ASE 2007: 513-516 - [c51]David Hovemeyer, William W. Pugh:
Status report on JSR-305: annotations for software defect detection. OOPSLA Companion 2007: 799-800 - [c50]Nathaniel Ayewah, William W. Pugh, J. David Morgenthaler, John Penix, YuQian Zhou:
Using FindBugs on production software. OOPSLA Companion 2007: 805-806 - [c49]William W. Pugh:
Finding bugs in eclipse. OOPSLA Companion 2007: 856-857 - [c48]Nathaniel Ayewah, William W. Pugh, J. David Morgenthaler, John Penix, YuQian Zhou:
Evaluating static analysis defect warnings on production software. PASTE 2007: 1-8 - [c47]David Hovemeyer, William W. Pugh:
Finding more null pointer bugs, but not too many. PASTE 2007: 9-14 - [c46]Jeffrey S. Foster, Michael W. Hicks, William W. Pugh:
Improving software quality with static analysis. PASTE 2007: 83-84 - 2006
- [c45]Dan Grossman, Jeremy Manson, William W. Pugh:
What do high-level memory models mean for transactions? Memory System Performance and Correctness 2006: 62-69 - [c44]Jaime Spacco, David Hovemeyer, William W. Pugh, Fawzi Emad, Jeffrey K. Hollingsworth, Nelson Padua-Perez:
Experiences with marmoset: designing and using an advanced submission and testing system for programming courses. ITiCSE 2006: 13-17 - [c43]Jaime Spacco, David Hovemeyer, William W. Pugh:
Tracking defect warnings across versions. MSR 2006: 133-136 - [c42]Jaime Spacco, William W. Pugh, Nathaniel Ayewah, David Hovemeyer:
The Marmoset project: an automated snapshot, submission, and testing system. OOPSLA Companion 2006: 669-670 - [c41]Brian Cole, Daniel Hakim, David Hovemeyer, Reuven Lazarus, William W. Pugh, Kristin Stephens:
Improving your software using static analysis to find bugs. OOPSLA Companion 2006: 673-674 - [c40]Jaime Spacco, William W. Pugh:
Helping students appreciate test-driven development (TDD). OOPSLA Companion 2006: 907-913 - 2005
- [j21]Jaime Spacco, Jaymie Strecker, David Hovemeyer, William W. Pugh:
Software repository mining with Marmoset: an automated programming project snapshot and testing system. ACM SIGSOFT Softw. Eng. Notes 30(4): 1-5 (2005) - [j20]Jaime Spacco, William W. Pugh:
RUBiS Revisited: Why J2EE Benchmarking is Hard. Stud. Inform. Univ. 4(1): 25-30 (2005) - [c39]William W. Pugh:
Keynote talk: Advice to bug hunters. AADEBUG 2005: 1-2 - [c38]Jaime Spacco, Jaymie Strecker, David Hovemeyer, William W. Pugh:
Software repository mining with Marmoset: an automated programming project snapshot and testing system. MSR 2005 - [c37]David Hovemeyer, Jaime Spacco, William W. Pugh:
Evaluating and tuning a static analysis to find null pointer bugs. PASTE 2005: 13-19 - [c36]Jeremy Manson, William W. Pugh, Sarita V. Adve:
The Java memory model. POPL 2005: 378-391 - [e3]William W. Pugh, Chau-Wen Tseng:
Languages and Compilers for Parallel Computing, 15th Workshop, LCPC 2002, College Park, MD, USA, July 25-27, 2002, Revised Papers. Lecture Notes in Computer Science 2481, Springer 2005, ISBN 3-540-30781-8 [contents] - 2004
- [j19]David Hovemeyer, William W. Pugh:
Finding bugs is easy. ACM SIGPLAN Notices 39(12): 92-106 (2004) - [c35]Jaime Spacco, David Hovemeyer, William W. Pugh:
An Eclipse-based course project snapshot and submission system. eTX 2004: 52-56 - [c34]David Hovemeyer, William W. Pugh:
Finding bugs is easy. OOPSLA Companion 2004: 132-136 - [c33]William W. Pugh, Jaime Spacco:
RUBiS revisited: why J2EE benchmarking is hard. OOPSLA Companion 2004: 204-205 - [e2]William W. Pugh, Craig Chambers:
Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004. ACM 2004, ISBN 1-58113-807-5 [contents] - 2003
- [c32]Konstantin Berlin, Jun Huan, Mary Jacob, Garima Kochhar, Jan F. Prins, William W. Pugh, P. Sadayappan, Jaime Spacco, Chau-Wen Tseng:
Evaluating the Impact of Programming Language Features on the Performance of Parallel Applications on Cluster Architectures. LCPC 2003: 194-208 - [c31]William W. Pugh, Jaime Spacco:
MPJava: High-Performance Message Passing in Java Using Java.nio. LCPC 2003: 323-339 - 2002
- [c30]David Hovemeyer, William W. Pugh, Jaime Spacco:
Atomic Instructions in Java. ECOOP 2002: 133-154 - 2001
- [c29]Jeremy Manson, William W. Pugh:
Core semantics of multithreaded Java. Java Grande 2001: 29-38 - [c28]David Hovemeyer, William W. Pugh:
More Efficient Network Class Loading Through Bundling. Java Virtual Machine Research and Technology Symposium 2001: 127-140 - [e1]Samuel P. Midkiff, José E. Moreira, Manish Gupta, Siddhartha Chatterjee, Jeanne Ferrante, Jan F. Prins, William W. Pugh, Chau-Wen Tseng:
Languages and Compilers for Parallel Computing, 13th International Workshop, LCPC 2000, Yorktown Heights, NY, USA, August 10-12, 2000, Revised Papers. Lecture Notes in Computer Science 2017, Springer 2001, ISBN 3-540-42862-3 [contents] - 2000
- [j18]William W. Pugh:
The Java memory model is fatally flawed. Concurr. Pract. Exp. 12(6): 445-455 (2000)
1990 – 1999
- 1999
- [j17]Tevfik Bultan, Richard Gerber, William W. Pugh:
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. ACM Trans. Program. Lang. Syst. 21(4): 747-789 (1999) - [c27]William W. Pugh:
Fixing the Java Memory Model. Java Grande 1999: 89-98 - [c26]William W. Pugh, Evan Rosser:
Iteration Space Slicing for Locality. LCPC 1999: 164-184 - [c25]William W. Pugh:
Compressing Java Class Files. PLDI 1999: 247-258 - 1998
- [j16]William W. Pugh, David Wonnacott:
Constraint-Based Array Dependence Analysis. ACM Trans. Program. Lang. Syst. 20(3): 635-678 (1998) - [c24]William W. Pugh, Tatiana Shpeisman:
SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations. LCPC 1998: 213-229 - 1997
- [c23]Tevfik Bultan, Richard Gerber, William W. Pugh:
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic. CAV 1997: 400-411 - [c22]William W. Pugh, Evan Rosser:
Iteration Space Slicing and Its Application to Communication Optimization. International Conference on Supercomputing 1997: 221-228 - 1996
- [j15]Wayne Kelly, William W. Pugh, Evan Rosser, Tatiana Shpeisman:
Transitive Closure of Infinite Graphs and its Applications. Int. J. Parallel Program. 24(6): 579-598 (1996) - [j14]Thomas J. Sheffler, Robert Schreiber, William W. Pugh, John R. Gilbert, Siddhartha Chatterjee:
Efficient Distribution Analysis via Graph Contraction. Int. J. Parallel Program. 24(6): 599-620 (1996) - [j13]William I. Gasarch, Wayne Kelly, William W. Pugh:
Finding the ith largest of n for small i, n. SIGACT News 27(2): 88-96 (1996) - [c21]Wayne Kelly, William W. Pugh:
Minimizing Communication While Preserving Parallelism. International Conference on Supercomputing 1996: 52-60 - [c20]William W. Pugh, Evan Rosser, Tatiana Shpeisman:
Exploiting Monotone Convergence Functions in Parallel Programs. LCPC 1996: 75-85 - 1995
- [j12]William W. Pugh, Gerald Boyer:
Broadband access: comparing alternatives. IEEE Commun. Mag. 33(8): 34-46 (1995) - [j11]Wayne Kelly, William W. Pugh:
Using affine closure to find legal reordering transformations. Int. J. Parallel Program. 23(4): 303-325 (1995) - [j10]Richard Gerber, William W. Pugh, Manas Saksena:
Parametric Dispatching of Hard Real-Time Tasks. IEEE Trans. Computers 44(3): 471-479 (1995) - [j9]William W. Pugh, David Wonnacott:
Going Beyond Integer Programming with the Omega Test to Eliminate False Data Dependences. IEEE Trans. Parallel Distributed Syst. 6(2): 204-211 (1995) - [c19]Wayne Kelly, William W. Pugh, Evan Rosser, Tatiana Shpeisman:
Transitive Closure of Infinite Graphs and Its Applications. LCPC 1995: 126-140 - [c18]Thomas J. Sheffler, Robert Schreiber, William W. Pugh, John R. Gilbert, Siddhartha Chatterjee:
Efficient Distribution Analysis via Graph Contraction. LCPC 1995: 377-391 - [c17]William W. Pugh, David Wonnacott:
Non-Linear Array Dependence Analysis. LCR 1995: 1-14 - 1994
- [j8]P. David Stotts, William W. Pugh:
Parallel finite automata for modeling concurrent software systems. J. Syst. Softw. 27(1): 27-43 (1994) - [j7]Wayne Kelly, William W. Pugh:
Selecting Affine Mappings Based on Performance Estimation. Parallel Process. Lett. 4: 205-219 (1994) - [j6]William W. Pugh, David Wonnacott:
Static Analysis of Upper and Lower Bounds on Dependences and Parallelism. ACM Trans. Program. Lang. Syst. 16(4): 1248-1278 (1994) - [c16]Vadim Maslov, William W. Pugh:
Simplifying Polynominal Constraints Over Integers to Make Dependence Analysis More Precise. CONPAR 1994: 737-748 - [c15]Wayne Kelly, William W. Pugh:
Finding Legal Reordering Transformations Using Mappings. LCPC 1994: 107-124 - [c14]William W. Pugh:
Counting Solutions to Presburger Formulas: How and Why. PLDI 1994: 121-134 - [c13]William W. Pugh, David Wonnacott:
Experiences with Constraint-based Array Dependence Analysis. PPCP 1994: 312-325 - 1993
- [j5]Vivek Nirkhe, William W. Pugh:
A Partial Evaluator for the Maruti Hard Real-Time System. Real Time Syst. 5(1): 13-30 (1993) - [c12]William W. Pugh, David Wonnacott:
An Exact Method for Analysis of Value-based Array Data Dependences. LCPC 1993: 546-566 - 1992
- [j4]William W. Pugh:
A Practical Algorithm for Exact Array Dependence Analysis. Commun. ACM 35(8): 102-114 (1992) - [j3]William W. Pugh:
Definitions of Dependence Distance. LOPLAS 1(3): 261-265 (1992) - [c11]William W. Pugh, David Wonnacott:
Eliminating False Data Dependences using the Omega Test. PLDI 1992: 140-151 - [c10]Vivek Nirkhe, William W. Pugh:
Partial Evaluation of High-Level Imperative Programming Languages, with Applications in Hard Real-Time Systems. POPL 1992: 269-280 - 1991
- [c9]William W. Pugh:
Uniform techniques for loop optimization. ICS 1991: 341-352 - [c8]William W. Pugh:
Advice to Authors of Extended Abstracts. PLDI 1991: 353-356 - [c7]Vivek Nirkhe, William W. Pugh:
A partial evaluator for the Maruti hard real-time system. RTSS 1991: 64-73 - [c6]William W. Pugh:
The Omega test: a fast and practical integer programming algorithm for dependence analysis. SC 1991: 4-13 - 1990
- [j2]William W. Pugh:
Skip Lists: A Probabilistic Alternative to Balanced Trees. Commun. ACM 33(6): 668-676 (1990) - [j1]William W. Pugh:
Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies. Inf. Process. Lett. 34(5): 251-254 (1990) - [c5]William W. Pugh:
Probabilistic Analysis of Set Operations with Constant-Time Set Equality Test. ICCI 1990: 62-71 - [c4]William W. Pugh, Grant E. Weddell:
Two-Directional Record Layout for Multiple Inheritance. PLDI 1990: 85-91
1980 – 1989
- 1989
- [c3]William W. Pugh, Tim Teitelbaum:
Incremental Computation via Function Caching. POPL 1989: 315-328 - [c2]William W. Pugh:
Skip Lists: A Probabilistic Alternative to Balanced Trees. WADS 1989: 437-449 - 1988
- [b1]William W. Pugh:
Incremental Computation and the Incremental Evaluation of Functional Programs. Cornell University, USA, 1988 - [c1]William W. Pugh:
An Improved Replacement Strategy for Function Aaching. LISP and Functional Programming 1988: 269-276
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
