Azadeh Farzan
where else to find them
what they talk about
all 5 in the filters
where they keep going back
all 4 in the filters
on a stage with
all 15 in the filters
who talks about the same things
- Andreas Podelski6 talks
- Dominik Klumpp5 talks
- Sharon Shoham13 talks
- Michael Sammler16 talks
- Zachary Kincaid9 talks
- Thomas Reps20 talks
| title | conference | date |
|---|---|---|
| Products of Recursive Programs for Hypersafety Verification | OOPSLA 2025 | 2025-10-16 |
Proposes an algorithmic construction of an infinite family of product programs that reduce hypersafety of recursive programs to ordinary safety, using visibly… | ||
| Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning | POPL 2025 | 2025-01-19 |
Bluebell is a program logic that unifies unary and relational proofs by adding a joint conditioning modality that encodes conditional independence and… | ||
| A New Perspective on Commutativity in Verification | POPL 2024 | 2024-01-14 |
Argues that commutativity becomes a primary search dimension so verification can find an easier-to-prove program and carry results back soundly, formalizes… | ||
| Commutativity Simplifies Proofs of Parameterized Programs | POPL 2024 | 2024-01-14 |
Extends commutativity-based reductions to parameterized programs and encodes each reduction by transforming the thread template into another parameterized… | ||
| Coarser Equivalences for Causal Concurrency | POPL 2024 | 2024-01-14 |
Proves a linear space lower bound for deciding causal concurrency under the fullest reads‑from style relaxation, shows classic trace/commutativity lets the… | ||
| A Pragmatic Approach to Stateful Partial Order Reduction | VMCAI 2023 | 2023-01-15 |
Proposes stateful POR variants: a cheap static safe-set pass plus two dynamic source-set trackers (eager and lazy) implemented in Java Pathfinder. Benchmarks… | ||
| Stratified Commutativity in Verification Algorithms for Concurrent Programs | POPL 2023 | 2023-01-15 |
Defines a formal framework for abstract commutativity relations with a simple soundness condition and an automatic method to derive such relations from a… | ||
| Proving Hypersafety Compositionally | OOPSLA 2022 | 2022-12-05 |
Claims a new proof system, the Logic for Hyper-triple Composition (LHC), that proves hypersafety properties compositionally by treating mixed-arity… | ||
| Compass: Strong and Compositional Library Specifications in Relaxed Memory Separation Logic | PLDI 2022 | 2022-06-13 |
Compass is a framework that gives strong, compositional specifications for relaxed-memory libraries by combining logical atomicity with partial-order… | ||
| TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Pr | POPL 2022 | 2022-01-16 |
TaDA Live claims compositional proofs of termination for blocking fine‑grained concurrent programs by extending separation logic with a semantic model of… | ||
| nothing matches | ||