William Pugh

According to our database1, William Pugh
  • authored at least 77 papers between 1988 and 2012.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2012
Static Analysis in Motion.
IEEE Security & Privacy, 2012

2010
Null dereference analysis in practice.
Proceedings of the 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, 2010

The Google FindBugs fixit.
Proceedings of the Nineteenth International Symposium on Software Testing and Analysis, 2010

2009
Learning from defect removals.
Proceedings of the 6th International Working Conference on Mining Software Repositories, 2009

2008
Two-dimensional bidirectional object layout.
ACM Trans. Program. Lang. Syst., 2008

Using Static Analysis to Find Bugs.
IEEE Software, 2008

A report on a survey and study of static analysis users.
Proceedings of the 2008 Workshop on Defects in Large Software Systems, 2008

2007
Finding more null pointer bugs, but not too many.
Proceedings of the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, 2007

Improving software quality with static analysis.
Proceedings of the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, 2007

Evaluating static analysis defect warnings on production software.
Proceedings of the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, 2007

Status report on JSR-305: annotations for software defect detection.
Proceedings of the Companion to the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2007

Using FindBugs on production software.
Proceedings of the Companion to the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2007

Unit testing concurrent software.
Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2007), 2007

2006
The Marmoset project: an automated snapshot, submission, and testing system.
Proceedings of the Companion to the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

Helping students appreciate test-driven development (TDD).
Proceedings of the Companion to the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

Improving your software using static analysis to find bugs.
Proceedings of the Companion to the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

Tracking defect warnings across versions.
Proceedings of the 2006 International Workshop on Mining Software Repositories, 2006

Experiences with marmoset: designing and using an advanced submission and testing system for programming courses.
Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006

What do high-level memory models mean for transactions?
Proceedings of the 2006 workshop on Memory System Performance and Correctness, 2006

2005
RUBiS Revisited: Why J2EE Benchmarking is Hard.
Stud. Inform. Univ., 2005

Software repository mining with Marmoset: an automated programming project snapshot and testing system.
ACM SIGSOFT Software Engineering Notes, 2005

The Java memory model.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

Evaluating and tuning a static analysis to find null pointer bugs.
Proceedings of the 2005 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, 2005

Software repository mining with Marmoset: an automated programming project snapshot and testing system.
Proceedings of the 2005 International Workshop on Mining Software Repositories, 2005

Keynote talk: Advice to bug hunters.
Proceedings of the Sixth International Workshop on Automated Debugging, 2005

2004
Finding bugs is easy.
SIGPLAN Notices, 2004

RUBiS revisited: why J2EE benchmarking is hard.
Proceedings of the Companion to the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2004

Finding bugs is easy.
Proceedings of the Companion to the 19th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2004

An Eclipse-based course project snapshot and submission system.
Proceedings of the 2004 OOPSLA workshop on Eclipse Technology eXchange, 2004

2003
MPJava: High-Performance Message Passing in Java Using Java.nio.
Proceedings of the Languages and Compilers for Parallel Computing, 2003

Evaluating the Impact of Programming Language Features on the Performance of Parallel Applications on Cluster Architectures.
Proceedings of the Languages and Compilers for Parallel Computing, 2003

2002
Atomic Instructions in Java.
Proceedings of the ECOOP 2002, 2002

2001
More Efficient Network Class Loading Through Bundling.
Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, 2001

Core semantics of multithreaded Java.
Proceedings of the ACM 2001 Java Grande Conference, Stanford University, California, USA, 2001

2000
The Java memory model is fatally flawed.
Concurrency - Practice and Experience, 2000

1999
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results.
ACM Trans. Program. Lang. Syst., 1999

Compressing Java Class Files.
Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1999

Iteration Space Slicing for Locality.
Proceedings of the Languages and Compilers for Parallel Computing, 1999

Fixing the Java Memory Model.
Proceedings of the ACM 1999 Conference on Java Grande, JAVA '99, San Francisco, CA, USA, 1999

1998
Constraint-Based Array Dependence Analysis.
ACM Trans. Program. Lang. Syst., 1998

SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations.
Proceedings of the Languages and Compilers for Parallel Computing, 1998

1997
Iteration Space Slicing and Its Application to Communication Optimization.
Proceedings of the 11th international conference on Supercomputing, 1997

Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic.
Proceedings of the Computer Aided Verification, 9th International Conference, 1997

1996
Finding the ith largest of n for small i, n.
SIGACT News, 1996

Efficient Distribution Analysis via Graph Contraction.
International Journal of Parallel Programming, 1996

Transitive Closure of Infinite Graphs and its Applications.
International Journal of Parallel Programming, 1996

Exploiting Monotone Convergence Functions in Parallel Programs.
Proceedings of the Languages and Compilers for Parallel Computing, 1996

Minimizing Communication While Preserving Parallelism.
Proceedings of the 10th international conference on Supercomputing, 1996

1995
Going Beyond Integer Programming with the Omega Test to Eliminate False Data Dependences.
IEEE Trans. Parallel Distrib. Syst., 1995

Parametric Dispatching of Hard Real-Time Tasks.
IEEE Trans. Computers, 1995

Using affine closure to find legal reordering transformations.
International Journal of Parallel Programming, 1995

Efficient Distribution Analysis via Graph Contraction.
Proceedings of the Languages and Compilers for Parallel Computing, 1995

Transitive Closure of Infinite Graphs and Its Applications.
Proceedings of the Languages and Compilers for Parallel Computing, 1995

1994
Static Analysis of Upper and Lower Bounds on Dependences and Parallelism.
ACM Trans. Program. Lang. Syst., 1994

Selecting Affine Mappings Based on Performance Estimation.
Parallel Processing Letters, 1994

Parallel finite automata for modeling concurrent software systems.
Journal of Systems and Software, 1994

Experiences with Constraint-based Array Dependence Analysis.
Proceedings of the Principles and Practice of Constraint Programming, 1994

Counting Solutions to Presburger Formulas: How and Why.
Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), 1994

Finding Legal Reordering Transformations Using Mappings.
Proceedings of the Languages and Compilers for Parallel Computing, 1994

Simplifying Polynominal Constraints Over Integers to Make Dependence Analysis More Precise.
Proceedings of the Parallel Processing: CONPAR 94, 1994

1993
A Partial Evaluator for the Maruti Hard Real-Time System.
Real-Time Systems, 1993

An Exact Method for Analysis of Value-based Array Data Dependences.
Proceedings of the Languages and Compilers for Parallel Computing, 1993

1992
Definitions of Dependence Distance.
LOPLAS, 1992

A Practical Algorithm for Exact Array Dependence Analysis.
Commun. ACM, 1992

Partial Evaluation of High-Level Imperative Programming Languages, with Applications in Hard Real-Time Systems.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

Eliminating False Data Dependences using the Omega Test.
Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation (PLDI), 1992

1991
The Omega test: a fast and practical integer programming algorithm for dependence analysis.
Proceedings of the Proceedings Supercomputing '91, 1991

A partial evaluator for the Maruti hard real-time system.
Proceedings of the Real-Time Systems Symposium, 1991

Advice to Authors of Extended Abstracts.
Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), 1991

Uniform techniques for loop optimization.
Proceedings of the 5th international conference on Supercomputing, 1991

1990
Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies.
Inf. Process. Lett., 1990

Skip Lists: A Probabilistic Alternative to Balanced Trees.
Commun. ACM, 1990

Two-Directional Record Layout for Multiple Inheritance.
Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), 1990

Probabilistic Analysis of Set Operations with Constant-Time Set Equality Test.
Proceedings of the Advances in Computing and Information, 1990

1989
Skip Lists: A Probabilistic Alternative to Balanced Trees.
Proceedings of the Algorithms and Data Structures, 1989

Incremental Computation via Function Caching.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

1988
An Improved Replacement Strategy for Function Aaching.
LISP and Functional Programming, 1988


  Loading...