17 citations · 48 across the 18 of their papers we have counts for
19 papers
On the Complexity of Checking Soundness of Natural Reductions (Extended Version)
Constantin Enea, Azadeh Farzan, Dominik Klumpp
The verification of reductions, representative subsets of interleavings, simplifies correctness proofs of parameterized concurrent programs. We introduce an expressive class of syn…
Complete Local Reasoning About Parameterized Programs Over Topologies (Extended Version)
Ruotong Cheng, Azadeh Farzan
This paper investigates the algorithmic safety verification problem of infinite-state parameterized concurrent programs over a rich set of communication topologies. The goal is to…
Parametrizing Reads-From Equivalence for Predictive Monitoring
Azadeh Farzan, Umang Mathur
Predictive runtime monitoring asks whether an execution of a concurrent program can be used to \emph{soundly predict} the existence of a reordering of that satisfies a…
Symmetric Proofs of Parameterized Programs
Ruotong Cheng, Azadeh Farzan
We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, cal…
Enhanced Data Race Prediction Through Modular Reasoning
Zhendong Ang, Azadeh Farzan, Umang Mathur
There are two orthogonal methodologies for efficient prediction of data races from concurrent program runs: commutativity and prefix reasoning. There are several instances of each…
Products of Recursive Programs for Hypersafety Verification (Extended Version)
Ruotong Cheng, Azadeh Farzan
We study the problem of automated hypersafety verification of infinite-state recursive programs. We propose an infinite class of product programs, specifically designed with recurs…
Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning
Jialu Bao, Emanuele D'Osualdo, Azadeh Farzan
We present Bluebell, a program logic for reasoning about probabilistic programs where unary and relational styles of reasoning come together to create new reasoning tools. Unary-st…
Commutativity Simplifies Proofs of Parameterized Programs
Azadeh Farzan, Dominik Klumpp, Andreas Podelski
Commutativity has proven to be a powerful tool in reasoning about concurrent programs. Recent work has shown that a commutativity-based reduction of a program may admit simpler pro…
A Pragmatic Approach to Stateful Partial Order Reduction
Berk Cirisci, Constantin Enea, Azadeh Farzan +1
Partial order reduction (POR) is a classic technique for dealing with the state explosion problem in model checking of concurrent programs. Theoretical optimality, i.e., avoiding e…
Proving Hypersafety Compositionally
Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer
Hypersafety properties of arity are program properties that relate traces of a program (or, more generally, traces of programs). Classic examples include determinism, i…
Coarser Equivalences for Causal Concurrency
Azadeh Farzan, Umang Mathur
Trace theory is a principled framework for defining equivalence relations for concurrent program runs based on a commutativity relation over the set of atomic steps taken by indivi…
Reductions for Safety Proofs (Extended Version)
Azadeh Farzan, Anthony Vandikas
Program reductions are used widely to simplify reasoning about the correctness of concurrent and distributed programs. In this paper, we propose a general approach to proof simplif…
Reductions for Automated Hypersafety Verification
Azadeh Farzan, Anthony Vandikas
We propose an automated verification technique for hypersafety properties, which express sets of valid interrelations between multiple finite runs of a program. The key observation…
Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version)
Azadeh Farzan, Victor Nicolet
We propose a methodology for automatic generation of divide-and-conquer parallel implementations of sequential nested loops. We focus on a class of loops that traverse read-only mu…
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner +1
We present TaDA Live, a concurrent separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs. The crucial challenge is how t…
Automated Synthesis of Divide and Conquer Parallelism
Azadeh Farzan, Victor Nicolet
This paper focuses on automated synthesis of divide-and-conquer parallelism, which is a common parallel programming skeleton supported by many cross-platform multithreaded librarie…
Proving Liveness of Parameterized Programs
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
Correctness of multi-threaded programs typically requires that they satisfy liveness properties. For example, a program may require that no thread is starved of a shared resource,…
Compositional Invariant Generation via Linear Recurrence Analysis
Azadeh Farzan, Zachary Kincaid
This paper presents a new method for automatically generating numerical invariants for imperative programs. Given a program, our procedure computes a binary input/output relation o…
An Algebraic Framework for Compositional Program Analysis
Azadeh Farzan, Zachary Kincaid
The purpose of a program analysis is to compute an abstract meaning for a program which approximates its dynamic behaviour. A compositional program analysis accomplishes this task…