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

Chris Dern

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

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

Software 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
Concurrent programming · 67% Program verification · 33%

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

TopicWeightPapersLastEvidence papers
Concurrent programming
concurrency verification
0.112010
Line-up: a complete and automatic linearizability checker · PLDI 2010
Concurrent programming › atomicity
linearizability
0.112010
Line-up: a complete and automatic linearizability checker · PLDI 2010
Program verification › concurrent program verification
linearizability verification
0.112010
Line-up: a complete and automatic linearizability checker · PLDI 2010

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

sequential behavior enumeration · 0.1
YearPublicationVenuePosition
2010 Line-up: a complete and automatic linearizability checker
abstract
Modular development of concurrent applications requires thread-safe components that behave correctly when called concurrently by multiple client threads. This paper focuses on linearizability, a specific formalization of thread safety, where all operations of a concurrent component appear to take effect instantaneously at some point between their call and return. The key insight of this paper is that if a component is intended to be deterministic, then it is possible to build an automatic linearizability checker by systematically enumerating the sequential behaviors of the component and then checking if each its concurrent behavior is equivalent to some sequential behavior.
Sebastian Burckhardt, Chris Dern, Madan Musuvathi, Roy Tan
PLDI2