avatar

Auto-generated profile, based on publicly available information


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2020 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
SMSuvam Mukherjee
Suvam Mukherjee
PDPantazis Deligiannis
Pantazis Deligiannis
ABArpita Biswas
Arpita Biswas
ALAkash Lal
Akash Lal
Concurrency bugs are notoriously hard to detect and reproduce. Controlled concurrency testing (CCT) techniques aim to offer a solution, where a scheduler explores the space of possible interleavings of a concurrent program looking for bugs. Since the set of possible interleavings is typically very large, these schedulers employ heuristics that prioritize the search to “interesting” subspaces. However, current heuristics are typically tuned to specific bug patterns, which limits their effectiveness in practice. In this paper, we present QL, a learning-based CCT framework where the likelihood of an action being selected by the scheduler is influenced by earlier explorations. We leverage the classical Q-learning algorithm to explore the space of possible interleavings, allowing the exploration to adapt to the program under test, unlike previous techniques. We have implemented and evaluated QL on a set of microbenchmarks, complex protocols, as well as production cloud services. In our experiments, we found QL to consistently outperform the state-of-the-art in CCT.

19 August 2017
Verified
Book Chapter
Closed access
PDF file
SMSuvam Mukherjee
Suvam Mukherjee
OPOded Padon
Oded Padon
SSSharon Shoham
Sharon Shoham
DDDeepak D’sOuza
Deepak D’sOuza
NRNoam Rinetzky
Noam Rinetzky

12 November 2017
Verified
Book Chapter
Closed access
PDF file
SMSuvam Mukherjee
Suvam Mukherjee
OPOded Padon
Oded Padon
SSSharon Shoham
Sharon Shoham
DDDeepak D’souza
Deepak D’souza
NRNoam Rinetzky
Noam Rinetzky

6 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
ABArpita Biswas
Arpita Biswas
SMSuvam Mukherjee
Suvam Mukherjee
In this paper, we study the problem of fair classification in the presence of prior probability shifts, where the training set distribution differs from the test set. This phenomenon can be observed in the yearly records of several real-world datasets, such as recidivism records and medical expenditure surveys. If unaccounted for, such shifts can cause the predictions of a classifier to become unfair towards specific population subgroups. While the fairness notion called Proportional Equality (PE) accounts for such shifts, a procedure to ensure PE-fairness was unknown. In this work, we propose a method, called CAPE, which provides a comprehensive solution to the aforementioned problem. CAPE makes novel use of prevalence estimation techniques, sampling and an ensemble of classifiers to ensure fair predictions under prior probability shifts. We introduce a metric, called prevalence difference (PD), which CAPE attempts to minimize in order to ensure PE-fairness. We theoretically establish that this metric exhibits several desirable properties. We evaluate the efficacy of CAPE via a thorough empirical evaluation on synthetic datasets. We also compare the performance of CAPE with several popular fair classifiers on real-world datasets like COMPAS (criminal risk assessment) and MEPS (medical expenditure panel survey). The results indicate that CAPE ensures PE-fair predictions, while performing well on other performance metrics.