26 citations · 106 across the 19 of their papers we have counts for
4 papers · 2 filters
How Hard is Weak-Memory Testing?
Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur +1
Weak-memory models are standard formal specifications of concurrency across hardware, programming languages, and distributed systems. A fundamental computational problem is consist…
Predictive Monitoring against Pattern Regular Languages
Zhendong Ang, Umang Mathur
In this paper, we focus on the problem of dynamically analysing concurrent software against high-level temporal specifications. Existing techniques for runtime monitoring against s…
Optimal Reads-From Consistency Checking for C11-Style Memory Models
Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty +3
Over the years, several memory models have been proposed to capture the subtle concurrency semantics of C/C++.One of the most fundamental problems associated with a memory model M…
Sound Dynamic Deadlock Prediction in Linear Time
Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis +1
Deadlocks are one of the most notorious concurrency bugs, and significant research has focused on detecting them efficiently. Dynamic predictive analyses work by observing concurre…