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, they often fall short of discovering more …
level issues such as data races or deadlocks, they often fall short of discovering more …
The fine-grained complexity of CFL reachability
Many problems in static program analysis can be modeled as the context-free language
(CFL) reachability problem on directed labeled graphs. The CFL reachability problem can …
(CFL) reachability problem on directed labeled graphs. The CFL reachability problem can …
Coarser Equivalences for Causal Concurrency
Trace theory (formulated by Mazurkiewicz in 1987) is a principled framework for defining
equivalence relations for concurrent program runs based on a commutativity relation over …
equivalence relations for concurrent program runs based on a commutativity relation over …
Dynamic race detection with O (1) samples
Happens before-based dynamic analysis is the go-to technique for detecting data races in
large scale software projects due to the absence of false positive reports. However, such …
large scale software projects due to the absence of false positive reports. However, such …
A tree clock data structure for causal orderings in concurrent executions
Dynamic techniques are a scalable and effective way to analyze concurrent programs.
Instead of analyzing all behaviors of a program, these techniques detect errors by focusing …
Instead of analyzing all behaviors of a program, these techniques detect errors by focusing …
Optimistic Prediction of Synchronization-Reversal Data Races
Z Shi, U Mathur, A Pavlogiannis - arXiv preprint arXiv:2401.05642, 2024 - arxiv.org
Dynamic data race detection has emerged as a key technique for ensuring reliability of
concurrent software in practice. However, dynamic approaches can often miss data races …
concurrent software in practice. However, dynamic approaches can often miss data races …
Predictive Monitoring with Strong Trace Prefixes
Z Ang, U Mathur - arXiv preprint arXiv:2405.10499, 2024 - arxiv.org
Runtime predictive analyses enhance coverage of traditional dynamic analyses based bug
detection techniques by identifying a space of feasible reorderings of the observed …
detection techniques by identifying a space of feasible reorderings of the observed …
Sound dynamic deadlock prediction in linear time
Deadlocks are one of the most notorious concurrency bugs, and significant research has
focused on detecting them efficiently. Dynamic predictive analyses work by observing …
focused on detecting them efficiently. Dynamic predictive analyses work by observing …
Coarser Equivalences for Concurrent Program Runs
Trace theory (formulated by Mazurkiewicz in 1987) is a framework for designing equivalence
relations for concurrent program runs based on a commutativity relation over the set of …
relations for concurrent program runs based on a commutativity relation over the set of …