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.

Shabnam Ghasemirad

dblp:336/5101 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-4193-5123ORCID · reported

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

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
isolation guarantees
0.912025
VerIso: Verifiable Isolation Guarantees for Database Transactions · Proc. VLDB Endow. 2025
Transaction processing and concurrency control › serializability
strict serializability
0.912025
VerIso: Verifiable Isolation Guarantees for Database Transactions · Proc. VLDB Endow. 2025
Program verification
protocol verification
0.912025
VerIso: Verifiable Isolation Guarantees for Database Transactions · Proc. VLDB Endow. 2025
Program verification
theorem proving
0.912025
VerIso: Verifiable Isolation Guarantees for Database Transactions · Proc. VLDB Endow. 2025
Transaction processing and concurrency control
concurrency control
0.312025
VerIso: Verifiable Isolation Guarantees for Database Transactions · Proc. VLDB Endow. 2025
Transaction processing and concurrency control › concurrency control › locking protocols
two-phase locking
0.312025
VerIso: Verifiable Isolation Guarantees for Database Transactions · Proc. VLDB Endow. 2025

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

Isabelle/HOL · 1.7
YearPublicationVenuePosition
2025 Pushing the Limit: Verified Performance-Optimal Causally-Consistent Database Transactions
abstract
Abstract Modern web services crucially rely on high-performance distributed databases, where concurrent transactions are isolated from each other using concurrency control protocols. Relaxed isolation levels, which permit more complex concurrent behaviors than strong levels like serializability, are used in practice for higher performance and availability. In this paper, we present Eiger-PORT+, a concurrency control protocol that achieves a strong form of causal consistency, called TCCv (Transactional Causal Consistency with convergence). We show that Eiger-PORT+ also provides performance-optimal read transactions in the presence of transactional writes, thus refuting an open conjecture that this is impossible for TCCv. We also deductively verify that Eiger-PORT+ satisfies this isolation level by refining an abstract model of transactions. This yields the first deductive verification of a complex concurrency control protocol. Furthermore, we conduct a performance evaluation showing Eiger-PORT+ ’s superior performance over the state-of-the-art.
Shabnam Ghasemirad, Christoph Sprenger 0001, Si Liu 0003, Luca Multazzu, David A. Basin
TACAS (3)1
2025 VerIso: Verifiable Isolation Guarantees for Database Transactions
abstract
Isolation bugs, stemming especially from design-level defects, have been repeatedly found in carefully designed and extensively tested production databases over decades. In parallel, various frameworks for modeling database transactions and reasoning about their isolation guarantees have been developed. What is missing however is a mathematically rigorous and systematic framework with tool support for formally verifying a wide range of such guarantees for all possible system behaviors. We present the first such framework, VerIso, developed within the theorem prover Isabelle/HOL. To showcase its use in verification, we model the strict two-phase locking concurrency control protocol and verify that it provides strict serializability isolation guarantee. Moreover, we show how VerIso helps identify isolation bugs during protocol design. We derive new counterexamples for the TAPIR protocol from failed attempts to prove its claimed strict serializability. In particular, we show that it violates a much weaker isolation level, namely, atomic visibility.
Shabnam Ghasemirad, Si Liu 0003, Christoph Sprenger 0001, Luca Multazzu, David A. Basin
Proc. VLDB Endow.1