EDBT 2026 Demo / reviewers in the wild / expert
Immad Naseer
dblp:89/1427
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 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.
| Software engineering, system software, and programming languages
1 paper |
Software testing · 75% Concurrent programming · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Concurrent programming
concurrency bugs |
0.5 | 1 | 2021 | Nekara: Generalized Concurrency Testing · ASE 2021 |
Software testing
concurrency testing |
0.5 | 1 | 2021 | Nekara: Generalized Concurrency Testing · ASE 2021 |
Software testing › concurrency testing
interleaving exploration |
0.5 | 1 | 2021 | Nekara: Generalized Concurrency Testing · ASE 2021 |
Software testing › concurrency testing
systematic concurrency testing |
0.5 | 1 | 2021 | Nekara: Generalized Concurrency Testing · ASE 2021 |
Methods — techniques the papers use, named apart from their topics
systematic testing · 0.5scheduling · 0.5exploration algorithms · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Nekara: Generalized Concurrency TestingabstractTesting concurrent systems remains an uncomfortable problem for developers. The common industrial practice is to stress-test a system against large workloads, with the hope of triggering enough corner-case interleavings that reveal bugs. However, stress testing is often inefficient and its ability to get coverage of interleavings is unclear. In reaction, the research community has proposed the idea of systematic testing, where a tool takes over the scheduling of concurrent actions so that it can perform an algorithmic search over the space of interleavings.We present an experience paper on the application of systematic testing to several case studies. We separate the algorithmic advancements in prior work (on searching the large space of interleavings) from the engineering of their tools. The latter was unsatisfactory; often the tools were limited to a small domain, hard to maintain, and hard to extend to other domains. We designed Nekara, an open-source cross-platform library for easily building custom systematic testing solutions.We show that (1) Nekara can effectively encapsulate state-of-the-art exploration algorithms by evaluating on prior bench-marks, and (2) Nekara can be applied to a wide variety of scenarios, including existing open-source systems as well as production distributed services of Microsoft Azure. Nekara was easy to use, improved testing, and found multiple new bugs. Udit Agarwal, Pantazis Deligiannis, Kumseok Jung, Akash Lal, Immad Naseer, Matthew Parkinson, Arun Thangamani, Jyothi Vedurada |
ASE | 6 |