activity
20082025
most citedAtomicity Checking in Linear Time using Vector Clocks

26 citations · 137 across the 24 of their papers we have counts for

collaborators
Showing cs.LOShow all

7 papers · 1 filter

cs.LO2023

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…

cs.LO2023

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…

cs.LO2022

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…

cs.LO2020

The Complexity of Dynamic Data Race Prediction

Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan

Writing concurrent programs is notoriously hard due to scheduling non-determinism. The most common concurrency bugs are data races, which are accesses to a shared resource that can…

cs.LO2019

Revisiting MITL to Fix Decision Procedures

Nima Roohi, Mahesh Viswanathan

Metric Interval Temporal Logic (MITL) is a well studied real-time, temporal logic that has decidable satisfiability and model checking problems. The decision procedures for MITL re…

cs.LO2017★ 4 cited

A Decidable Fragment of Second Order Logic With Applications to Synthesis

P. Madhusudan, Umang Mathur, Shambwaditya Saha +1

We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\exis…

cs.LO2013★ 3 cited

Reachability under Contextual Locking

Remi Bonnet, Rohit Chadha, Mahesh Viswanathan +1

The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of the progr…