David G. Wonnacott

Orcid: 0000-0002-7595-2458

According to our database1, David G. Wonnacott authored at least 26 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Purpose of Proof.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

2019
A Bridge Anchored on Both Sides: Formal Deduction in Introductory CS, and Code Proofs in Discrete Math.
CoRR, 2019

2018
Iterator-Based Optimization of Imperfectly-Nested Loops.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

2016
Hybrid Static/Dynamic Schedules for Tiled Polyhedral Programs.
CoRR, 2016

2015
Parameterized Diamond Tiling for Stencil Computations with Chapel parallel iterators.
Proceedings of the 29th ACM on International Conference on Supercomputing, 2015

2012
Distributed Shared Memory and Compiler-Induced Scalable Locality for Scalable Cluster Performance.
Proceedings of the 12th IEEE/ACM International Symposium on Cluster, 2012

2011
Omega Test.
Proceedings of the Encyclopedia of Parallel Computing, 2011

ompVerify: Polyhedral Analysis for the OpenMP Programmer.
Proceedings of the OpenMP in the Petascale Era - 7th International Workshop on OpenMP, 2011

2005
Robustness Testing of Java Server Applications.
IEEE Trans. Software Eng., 2005

Use and assessment of a rigorous approach to CS1.
Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

2004
Testing of java web services for robustness.
Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, 2004

2003
Compiler-Directed Program-Fault Coverage for Highly Available Java Internet Services.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

2002
Achieving Scalable Locality with Time Skewing.
Int. J. Parallel Program., 2002

Efficient Manipulation of Disequalities During Dependence Analysis.
Proceedings of the Languages and Compilers for Parallel Computing, 15th Workshop, 2002

2001
Polynomial Time Array Dataflow Analysis.
Proceedings of the Languages and Compilers for Parallel Computing, 2001

Using Accessory Functions to Generalize Dynamic Dispatch in Single-Dispatch Object-Oriented Languages.
Proceedings of the 6th USENIX Conference on Object-Oriented Technologies and Systems, January 29, 2001

2000
Extending Scalar Optimizations for Arrays.
Proceedings of the Languages and Compilers for Parallel Computing, 2000

Using Time Skewing to Eliminate Idle Time due to Memory Bandwidth and Network Limitations.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Time Skewing for Parallel Computers.
Proceedings of the Languages and Compilers for Parallel Computing, 1999

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

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

Non-Linear Array Dependence Analysis.
Proceedings of the Languages, 1995

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

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

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

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


  Loading...