Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

William Dickinson

dblp:12/2793 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Software testing · 77% Debugging and program repair · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing › test optimization
test case selection
0.122001
Pursuing failure: the distribution of program failures in a profile space · ESEC / SIGSOFT FSE 2001
Finding Failures by Cluster Analysis of Execution Profiles · ICSE 2001
Debugging and program repair › failure analysis
failure clustering
0.012001
Pursuing failure: the distribution of program failures in a profile space · ESEC / SIGSOFT FSE 2001
Software testing
failure detection
0.012001
Finding Failures by Cluster Analysis of Execution Profiles · ICSE 2001
Software testing
test oracle
0.012001
Finding Failures by Cluster Analysis of Execution Profiles · ICSE 2001

Methods — techniques the papers use, named apart from their topics

cluster analysis · 0.1adaptive sampling · 0.1multidimensional scaling · 0.0failure-pursuit sampling · 0.0
YearPublicationVenuePosition
2024 Towards Reducing Diagnostic Errors with Interpretable Risk Prediction
abstract
a confident diagnosis can be made. We use an LLM to retrieve an initial pool of evidence, but then refine this set of evidence according to correlations learned by the model. We conduct an in-depth evaluation of the usefulness of our approach by simulating how it might be used by a clinician to decide between a pre-defined list of differential diagnoses.
Denis Jered McInerney, William Dickinson, Lucy C. Flynn, Andrea Young, Geoffrey S. Young, Jan-Willem van de Meent, Byron C. Wallace
NAACL-HLT2
2005 Visualizing Similarity between Program Executions
abstract
Multidimensional scaling (MDS) is a technique for visualizing multidimensional data points as a 2D scatter plot. It can be applied to execution profiles of software to reveal how similar executions are to one another. This is useful for certain software engineering applications, which require accurate representation of small dissimilarities and nearest neighbor relationships. However, the high-dimensionality of profiles can cause MDS techniques to represent small dissimilarities poorly. We evaluate several variants of MDS on large sets of profiles, to see which techniques produce the most accurate displays. These include four previously proposed techniques -classical scaling followed by iterative majorization, energy minimization, ordinal AIDS, and cluster differences scaling - and two techniques of our invention - hierarchical MDS and sparse region scaling. The results suggest that each technique except ordinal MDS can significantly improve the representation of small dissimilarities between program executions and that hierarchical MDS and sparse region scaling perform best overall
David Leon, Andy Podgurski, William Dickinson
ISSRE3
2001 Finding Failures by Cluster Analysis of Execution Profiles
abstract
We experimentally evaluate the effectiveness of using cluster analysis of execution profiles to find failures among the executions induced by a set of potential test cases. We compare several filtering procedures for selecting executions to evaluate for conformance to requirements. Each filtering procedure involves a choice of a sampling strategy and a clustering metric. The results suggest that filtering procedures based on clustering are more effective than simple random sampling for identifying failures in populations of operational executions, with adaptive sampling from clusters being the most effective sampling strategy. The results also suggest that clustering metrics that give extra weight to industrial profile features are most effective. Scatter plots of execution populations, produced by multidimensional scaling, are used to provide intuition for these results.
William Dickinson, David Leon, Andy Podgurski
ICSE1
2001 Pursuing failure: the distribution of program failures in a profile space
abstract
Observation-based testing calls for analyzing profiles of executions induced by potential test cases, in order to select a subset of executions to be checked for conformance to requirements. A family of techniques for selecting such a subset is evaluated experimentally. These techniques employ automatic cluster analysis to partition executions, and they use various sampling techniques to select executions from clusters. The experimental results support the hypothesis that with appropriate profiling, failures often have unusual profiles that are revealed by cluster analysis. The results also suggest that failures often form small clusters or chains in sparsely-populated areas of the profile space. A form of adaptive sampling called failure-pursuit sampling is proposed for revealing failures in such regions, and this sampling method is evaluated experimentally. The results suggest that failure-pursuit sampling is effective.
William Dickinson, David Leon, Andy Podgurski
ESEC / SIGSOFT FSE1