26 citations · 137 across the 24 of their papers we have counts for
28 papers
Dynamic Race Detection With O(1) Samples
Mosaad Al Thokair, Minjian Zhang, Umang Mathur +1
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 a…
DAWN: Designing Distributed Agents in a Worldwide Network
Zahra Aminiranjbar, Jianan Tang, Qiudan Wang +2
The rapid evolution of Large Language Models (LLMs) has transformed them from basic conversational tools into sophisticated entities capable of complex reasoning and decision-makin…
RTAEval: A framework for evaluating runtime assurance logic
Kristina Miller, Christopher K. Zeitler, William Shen +2
Runtime assurance (RTA) addresses the problem of keeping an autonomous system safe while using an untrusted (or experimental) controller. This can be done via logic that explicitly…
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…
Stack-Aware Hyperproperties
Ali Bajwa, Minjian Zhang, Rohit Chadha +1
A hyperproperty relates executions of a program and is used to formalize security objectives such as confidentiality, non-interference, privacy, and anonymity. Formally, a hyperpro…
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions
Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç +1
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 on a…