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

Kaan Genç

dblp:220/9248 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Software engineering, systems software and programming languages · 4 · 2 first-author

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
3 papers
Concurrent programming · 75% Program analysis · 25%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 61% Storage systems · 31% Parallel and multicore computing · 8%
Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Concurrent programming
concurrency bugs
1.132020
SmartTrack: efficient predictive race detection · PLDI 2020
Dependence-aware, unbounded sound predictive race detection · Proc. ACM Program. Lang. 2019
High-coverage, unbounded sound predictive race detection · PLDI 2018
Program analysis
dynamic analysis
1.132020
SmartTrack: efficient predictive race detection · PLDI 2020
Dependence-aware, unbounded sound predictive race detection · Proc. ACM Program. Lang. 2019
High-coverage, unbounded sound predictive race detection · PLDI 2018
Concurrent programming › concurrency bug detection › data race detection
predictive race detection
1.132020
SmartTrack: efficient predictive race detection · PLDI 2020
Dependence-aware, unbounded sound predictive race detection · Proc. ACM Program. Lang. 2019
High-coverage, unbounded sound predictive race detection · PLDI 2018
Concurrent programming › concurrency bug detection
data race detection
0.822020
SmartTrack: efficient predictive race detection · PLDI 2020
High-coverage, unbounded sound predictive race detection · PLDI 2018
Storage systems
crash consistency
0.412020
Crafty: efficient, HTM-compatible persistent transactions · PLDI 2020
Memory systems
non-volatile memory
0.412020
Crafty: efficient, HTM-compatible persistent transactions · PLDI 2020
Memory systems › non-volatile memory
persistent memory
0.412020
Crafty: efficient, HTM-compatible persistent transactions · PLDI 2020
Concurrent programming › concurrency bugs
data races
0.412019
Dependence-aware, unbounded sound predictive race detection · Proc. ACM Program. Lang. 2019

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

hardware transactional memory · 0.9data dependence analysis · 0.8control dependence analysis · 0.8
YearPublicationVenuePosition
2020 Crafty: efficient, HTM-compatible persistent transactions
abstract
Byte-addressable persistent memory, such as Intel/Micron 3D XPoint, is an emerging technology that bridges the gap between volatile memory and persistent storage. Data in persistent memory survives crashes and restarts; however, it is challenging to ensure that this data is consistent after failures. Existing approaches incur significant performance costs to ensure crash consistency.
Kaan Genç, Michael D. Bond, Guoqing Harry Xu
PLDI1
2020 SmartTrack: efficient predictive race detection
abstract
Widely used data race detectors, including the state-of-the-art FastTrack algorithm, incur performance costs that are acceptable for regular in-house testing, but miss races detectable from the analyzed execution. Predictive analyses detect more data races in an analyzed execution than FastTrack detects, but at significantly higher performance cost.
Jake Roemer, Kaan Genç, Michael D. Bond
PLDI2
2019 Dependence-aware, unbounded sound predictive race detection
abstract
Data races are a real problem for parallel software, yet hard to detect. Sound predictive analysis observes a program execution and detects data races that exist in some other, unobserved execution. However, existing predictive analyses miss races because they do not scale to full program executions or do not precisely incorporate data and control dependence. This paper introduces two novel, sound predictive approaches that incorporate data and control dependence and handle full program executions. An evaluation using real, large Java programs shows that these approaches detect more data races than the closest related approaches, thus advancing the state of the art in sound predictive race detection.
Kaan Genç, Jake Roemer, Yufan Xu 0001, Michael D. Bond
Proc. ACM Program. Lang.1
2018 High-coverage, unbounded sound predictive race detection
abstract
Dynamic program analysis can predict data races knowable from an observed execution, but existing predictive analyses either miss races or cannot analyze full program executions. This paper presents Vindicator, a novel, sound (no false races) predictive approach that finds more data races than existing predictive approaches. Vindicator achieves high coverage by using a new, efficient analysis that finds all possible predictable races but may detect false races. Vindicator ensures soundness using a novel algorithm that checks each potential race to determine whether it is a true predictable race. An evaluation using large Java programs shows that Vindicator finds hard-to-detect predictable races that existing sound predictive analyses miss, at a comparable performance cost.
Jake Roemer, Kaan Genç, Michael D. Bond
PLDI2