research
∙
04/07/2023
Optimal Reads-From Consistency Checking for C11-Style Memory Models
Over the years, several memory models have been proposed to capture the ...
share
research
∙
04/07/2023
Sound Dynamic Deadlock Prediction in Linear Time
Deadlocks are one of the most notorious concurrency bugs, and significan...
research
∙
11/26/2022
Maximizing the Probability of Fixation in the Positional Voter Model
The Voter model is a well-studied stochastic process that models the inv...
research
∙
01/20/2022
Invasion Dynamics in the Biased Voter Process
The voter process is a classic stochastic process that models the invasi...
research
∙
01/17/2022
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions
Dynamic techniques are a scalable and effective way to analyze concurren...
research
∙
01/06/2022
Fixation Maximization in the Positional Moran Process
The Moran process is a classic stochastic process that models invasion d...
research
∙
11/10/2021
The Decidability and Complexity of Interleaved Bidirected Dyck Reachability
Dyck reachability is the standard formulation of a large domain of stati...
research
∙
07/08/2021
Dynamic Data-Race Detection through the Fine-Grained Lens
Data races are among the most common bugs in concurrency. The standard a...
research
∙
05/13/2021
Stateless Model Checking under a Reads-Value-From Equivalence
Stateless model checking (SMC) is one of the standard approaches to the ...
research
∙
11/23/2020
The Reads-From Equivalence for the TSO and PSO Memory Models
The verification of concurrent programs remains an open challenge due to...
research
∙
10/30/2020
Optimal Prediction of Synchronization-Preserving Races
Concurrent programs are notoriously hard to write correctly, as scheduli...
research
∙
06/02/2020
The Fine-Grained and Parallel Complexity of Andersen's Pointer Analysis
Pointer analysis is one of the fundamental problems in static program an...
research
∙
06/02/2020
The Fine-Grained Complexity of Andersen's Pointer Analysis
Pointer analysis is one of the fundamental problems in static program an...
research
∙
04/30/2020
The Complexity of Dynamic Data Race Prediction
Writing concurrent programs is notoriously hard due to scheduling non-de...
research
∙
04/19/2020
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth
Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) a...
research
∙
01/29/2020
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis
Interprocedural data-flow analyses form an expressive and useful paradig...
research
∙
10/01/2019
Optimal Dyck Reachability for Data-Dependence and Alias Analysis
A fundamental algorithmic problem at the heart of static analysis is Dyc...
research
∙
09/03/2019
Value-centric Dynamic Partial Order Reduction
The verification of concurrent programs remains an open challenge, as th...
research
∙
01/25/2019
Fast, Sound and Effectively Complete Dynamic Race Detection
Writing concurrent programs is highly error-prone due to the nondetermin...
research
∙
09/27/2018
Fixation probability and fixation time in structured populations
The rate of biological evolution depends on the fixation probability and...
research
∙
02/07/2018
