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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Allen-Bond

dblp:198/2438 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

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
1 paper
Program analysis · 61% Debugging and program repair · 30% Operating systems · 9%

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

TopicWeightPapersLastEvidence papers
Debugging and program repair
fault localization
0.312017
Pallas: Semantic-Aware Checking for Finding Deep Bugs in Fast Path · ASPLOS 2017
Program analysis › error detection
semantic bug detection
0.312017
Pallas: Semantic-Aware Checking for Finding Deep Bugs in Fast Path · ASPLOS 2017
Program analysis
static analysis
0.312017
Pallas: Semantic-Aware Checking for Finding Deep Bugs in Fast Path · ASPLOS 2017
Operating systems › kernel
linux kernel
0.112017
Pallas: Semantic-Aware Checking for Finding Deep Bugs in Fast Path · ASPLOS 2017

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

semantic-aware checking · 0.3
YearPublicationVenuePosition
2017 Pallas: Semantic-Aware Checking for Finding Deep Bugs in Fast Path
abstract
Software optimization is constantly a serious concern for developing high-performance systems. To accelerate the workflow execution of a specific functionality, software developers usually define and implement a fast path to speed up the critical and commonly executed functions in the workflow. However, producing a bug-free fast path is nontrivial. Our study on the Linux kernel discloses that a committed fast path can have up to 19 follow-up patches for bug fixing, and most of them are deep semantic bugs, which are difficult to be pinpointed by existing bug-finding tools.
Jian Huang 0006, Michael Allen-Bond, Xuechen Zhang 0001
ASPLOS2