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 EDBT 2026 / reviewers in the wild / expert

Michael Kuperstein 0001

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

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

Software engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 1 · 1 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
1 paper
Concurrent programming · 56% Program verification · 44%

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

TopicWeightPapersLastEvidence papers
Program verification
automated verification		 0.112011
Partial-coherence abstractions for relaxed memory models · PLDI 2011
Concurrent programming › memory models
weak memory models		 0.112011
Partial-coherence abstractions for relaxed memory models · PLDI 2011
Concurrent programming
memory models		 0.012011
Partial-coherence abstractions for relaxed memory models · PLDI 2011
YearPublicationVenuePosition
2011 Partial-coherence abstractions for relaxed memory models
abstract
We present an approach for automatic verification and fence inference in concurrent programs running under relaxed memory models. Verification under relaxed memory models is a hard problem. Given a finite state program and a safety specification, verifying that the program satisfies the specification under a sufficiently relaxed memory model is undecidable. For stronger models, the problem is decidable but has non-primitive recursive complexity.
Michael Kuperstein 0001, Martin T. Vechev, Eran Yahav
 PLDI1
2010 Automatic inference of memory fences
Michael Kuperstein 0001, Martin T. Vechev, Eran Yahav
 FMCAD1