Publications

OOPSLA 2025
Efficient Decrease-And-Conquer Linearizability Monitoring
Zheng Han Lee, Umang Mathur

PLDI 2025
Program Skeletons for Automated Program Translation
Bo Wang, Tianyu Li, Ruishi Li, Umang Mathur, Prateek Saxena

PLDI 2025
Efficient Timestamping for Sampling-Based Race Detection
Minjian Zhang, Daniel Lim, Mosaad Al Thokair, Umang Mathur, Mahesh Viswanathan

ASPLOS 2025
Selectively Uniform Concurrency Testing
Huan Zhao, Dylan Wolff, Umang Mathur, Abhik Roychoudhury

POPL 2025
The Decision Problem for Regular First-Order Theories
Umang Mathur, David Mestel, Mahesh Viswanathan

ASPLOS 2024
Greybox Fuzzing for Concurrency Testing
Dylan Wolff, Zheng Shi, Gregory J. Duck, Umang Mathur, Abhik Roychoudhury

CAV 2024
Predictive Monitoring with Strong Trace Prefixes
Zhendong Ang, Umang Mathur

PODS 2024
A faster FPRAS for #NFA
Kuldeep S. Meel, Sourav Chakraborty, Umang Mathur

ICSE 2024
Optimistic Prediction of Synchronization-Reversal Data Races
Zheng Shi, Umang Mathur, Andreas Pavlogiannis

CPP 2024
Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic
Qiyuan Zhao, George Pîrlea, Zhendong Ang, Umang Mathur, Ilya Sergey
2024 CPP Distinguished Paper Award

PDF Cite Code DOI

POPL 2024
Predictive Monitoring against Pattern Regular Languages
Zhendong Ang, Umang Mathur

PDF Cite Code DOI

POPL 2024
How Hard Is Weak-Memory Testing?
Soham Chakraborty, Shankara Narayanan Krishna, Umang Mathur, Andreas Pavlogiannis

POPL 2024
Coarser Equivalences for Causal Concurrency
Azadeh Farzan, Umang Mathur