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

Bradley Swain

dblp:23/6118 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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
Program analysis · 76% Concurrent programming · 24%

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

TopicWeightPapersLastEvidence papers
Program analysis
static analysis
1.022022
PUS: A Fast and Highly Efficient Solver for Inclusion-based Pointer Analysis · ICSE 2022
OMPRacer: a scalable and precise static race detector for OpenMP programs · SC 2020
Program analysis
constraint solving
0.612022
PUS: A Fast and Highly Efficient Solver for Inclusion-based Pointer Analysis · ICSE 2022
Program analysis › static analysis › pointer analysis
inclusion-based points-to analysis
0.612022
PUS: A Fast and Highly Efficient Solver for Inclusion-based Pointer Analysis · ICSE 2022
Program analysis › static analysis
pointer analysis
0.612022
PUS: A Fast and Highly Efficient Solver for Inclusion-based Pointer Analysis · ICSE 2022
Concurrent programming
concurrency bugs
0.412020
OMPRacer: a scalable and precise static race detector for OpenMP programs · SC 2020
Concurrent programming › concurrency bug detection
data race detection
0.412020
OMPRacer: a scalable and precise static race detector for OpenMP programs · SC 2020

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

wave propagation · 0.6deep propagation · 0.6causality subgraph · 0.6value-flow analysis · 0.4pointer analysis · 0.4happens-before tracking · 0.4flow-sensitive interprocedural analysis · 0.4
YearPublicationVenuePosition
2022 PUS: A Fast and Highly Efficient Solver for Inclusion-based Pointer Analysis
abstract
A crucial performance bottleneck in most interprocedural static analyses is solving pointer analysis constraints. We present Pus, a highly efficient solver for inclusion-based pointer analysis. At the heart of Pus is a new constraint solving algorithm that significantly advances the state-of-the-art. Unlike the existing algorithms (i.e., wave and deep propagation) which construct a holistic constraint graph, at each stage Pus only considers partial constraints that causally affect the final fixed-point computation. In each iteration Pus extracts a small causality subgraph and it guarantees that only processing the causality subgraph is sufficient to reach the same global fixed point. Our extensive evaluation of Pus on a wide range of real-world large complex programs yields highly promising results. Pus is able to analyze millions of lines of code such as PostgreSQL in 10 minutes on a commodity laptop. On average, Pus is more than 7× faster in solving context-sensitive constraints, and more than 2× faster in solving context-insensitive constraints compared to the state of the art wave and deep propagation algorithms. Moreover, Pus has been used to find tens of previous unknown bugs in high-profile codebases including Linux, Redis, and Memcached.
Peiming Liu, Bradley Swain, Jeff Huang 0001
ICSE3
2020 OMPRacer: a scalable and precise static race detector for OpenMP programs
abstract
We present OMPRACER, a static tool that uses flow-sensitive, interprocedural analysis to detect data races in OpenMP programs. OMPRACER is fast, scalable, has high code coverage, and supports the most common OpenMP features by combining state-of-the-art pointer analysis, novel value-flow analysis, happens-before tracking, and generalized modelling of OpenMP APIs. Unlike dynamic tools that currently dominate data race detection, OMPRACER achieves almost 100% code coverage using static analysis to detect a broader category of races without running the program or relying on specific input or runtime behaviour. OMPRACER has competitive precision with dynamic tools like Archer and ROMP: passing 105/116 cases in DataRaceBench with a total accuracy of 91%. OMPRACER has been used to analyze several Exascale Computing Project proxy applications containing over 2 million lines of code in under 10 minutes. OMPRACER has revealed previously unknown races in an ECP proxy app and a production simulation for COVID19.
Bradley Swain, Peiming Liu, Ignacio Laguna, Giorgis Georgakoudis, Jeff Huang 0001
SC1