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

Pallavi Maiya

dblp:145/0966 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2017
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 3 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
2 papers
Concurrent programming · 80% Program analysis · 16% Operating systems · 5%

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

TopicWeightPapersLastEvidence papers
Concurrent programming
concurrency analysis		 0.312017
Efficient computation of happens-before relation for event-driven programs · ISSTA 2017
Concurrent programming › memory models
happens-before relation		 0.312017
Efficient computation of happens-before relation for event-driven programs · ISSTA 2017
Concurrent programming
concurrency bugs		 0.212014
Race detection for Android applications · PLDI 2014
Concurrent programming › concurrency bug detection
data race detection		 0.212014
Race detection for Android applications · PLDI 2014
Program analysis
dynamic analysis		 0.212014
Race detection for Android applications · PLDI 2014

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

vector clocks · 0.3dynamic analysis · 0.3dynamic race detection · 0.2
YearPublicationVenuePosition
2017 Efficient computation of happens-before relation for event-driven programs
abstract
An emerging style of programming is to use both threads and events to achieve better scalability. The improved scalability comes at the price of increased complexity, as both threads and events can follow non-deterministic schedules. The happens-before (HB) relation captures the space of possible schedules and forms the basis of various concurrency analyses. Improving efficiency of the HB computation can speed up these analyses.
Pallavi Maiya, Aditya Kanade 0001
 ISSTA1
2016 Partial Order Reduction for Event-Driven Multi-threaded Programs
Pallavi Maiya, Aditya Kanade 0001, Rupak Majumdar
 TACAS1
2014 Race detection for Android applications
abstract
Programming environments for smartphones expose a concurrency model that combines multi-threading and asynchronous event-based dispatch. While this enables the development of efficient and feature-rich applications, unforeseen thread interleavings coupled with non-deterministic reorderings of asynchronous tasks can lead to subtle concurrency errors in the applications.
Pallavi Maiya, Aditya Kanade 0001, Rupak Majumdar
 PLDI1