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
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Mingyu Gao 0006

dblp:61/7672-6 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved

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

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 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
1 paper
Software testing · 44% Concurrent programming · 35% Program analysis · 22%

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

TopicWeightPapersLastEvidence papers
Concurrent programming
concurrency bug detection		 0.712023
Probabilistic Concurrency Testing for Weak Memory Programs · ASPLOS (2) 2023
Software testing
concurrency testing		 0.712023
Probabilistic Concurrency Testing for Weak Memory Programs · ASPLOS (2) 2023
Program analysis
dynamic analysis		 0.712023
Probabilistic Concurrency Testing for Weak Memory Programs · ASPLOS (2) 2023
Software testing › concurrency testing
probabilistic concurrency testing		 0.712023
Probabilistic Concurrency Testing for Weak Memory Programs · ASPLOS (2) 2023
Concurrent programming
memory models		 0.212023
Probabilistic Concurrency Testing for Weak Memory Programs · ASPLOS (2) 2023
Concurrent programming › memory models
weak memory models		 0.212023
Probabilistic Concurrency Testing for Weak Memory Programs · ASPLOS (2) 2023
YearPublicationVenuePosition
2023 Probabilistic Concurrency Testing for Weak Memory Programs
abstract
The Probabilistic Concurrency Testing (PCT) algorithm that provides theoretical guarantees on the probability of detecting concurrency bugs does not apply to weak memory programs. The PCT algorithm builds on the interleaving semantics of sequential consistency, which does not hold for weak memory concurrency. It is because weak memory concurrency allows additional behaviors that cannot be produced by any interleaving execution.
Mingyu Gao 0006, Soham Chakraborty 0001, Burcu Kulahcioglu Ozkan
 ASPLOS (2)1