Paper-Conference

Greybox Fuzzing for Concurrency Testing
Uncovering bugs in concurrent programs is a challenging problem owing to the exponentially large search space of thread interleavings. …
Dylan Wolff, Zheng Shi, Gregory J. Duck, Umang Mathur, Abhik Roychoudhury
PDF Cite DOI
Predictive Monitoring with Strong Trace Prefixes
A faster FPRAS for #NFA
Given a non-deterministic finite automaton (NFA) A with m states, and a natural number n (presented in unary), the #NFA problem asks to …
Kuldeep S. Meel, Sourav Chakraborty, Umang Mathur
PDF Cite DOI
Optimistic Prediction of Synchronization-Reversal Data Races
Dynamic data race detection has emerged as a key technique for ensuring reliability of concurrent software in practice. However, …
Zheng Shi, Umang Mathur, Andreas Pavlogiannis
PDF Cite DOI
Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic
Array-based encodings of tree structures are often preferable to linked or abstract data type-based representations for efficiency …
Qiyuan Zhao, George Pîrlea, Zhendong Ang, Umang Mathur, Ilya Sergey
PDF Cite Code DOI
Coarser Equivalences for Causal Concurrency

Trace theory (formulated by Mazurkiewicz in 1987) is a principled framework for defining equivalence relations for concurrent program …

Azadeh Farzan, Umang Mathur
PDF Cite DOI
How Hard Is Weak-Memory Testing?

Weak-memory models are standard formal specifications of concurrency across hardware, programming languages, and distributed systems. A …

Soham Chakraborty, Shankara Narayanan Krishna, Umang Mathur, Andreas Pavlogiannis
PDF Cite DOI
Predictive Monitoring against Pattern Regular Languages

While current bug detection techniques for concurrent software focus on unearthing low-level issues such as data races or deadlocks, …

PDF Cite Code DOI