Azadeh Farzan

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 34

Top Topics

Probabilistic Reasoning

Automated Verification

Concurrent Programs

Top Venues

Proc. ACM Program. Lang.

Publications

Azadeh Farzan, Umang Mathur
Coarser Equivalences for Causal Concurrency. Proc. ACM Program. Lang. 8 (POPL) (2024)
Azadeh Farzan, Dominik Klumpp, Andreas Podelski
Commutativity Simplifies Proofs of Parameterized Programs. Proc. ACM Program. Lang. 8 (POPL) (2024)
Jialu Bao, Emanuele D'Osualdo, Azadeh Farzan
Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning. CoRR (2024)
Azadeh Farzan, Dominik Klumpp, Andreas Podelski
Stratified Commutativity in Verification Algorithms for Concurrent Programs. Proc. ACM Program. Lang. 7 (POPL) (2023)
Azadeh Farzan
Commutativity in Automated Verification. LICS (2023)
Danya Lette, Azadeh Farzan
Commutativity for Concurrent Program Termination Proofs. CAV (1) (2023)
Azadeh Farzan, Dominik Klumpp, Andreas Podelski
Commutativity Simplifies Proofs of Parameterized Programs. CoRR (2023)
Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil
A Pragmatic Approach to Stateful Partial Order Reduction. VMCAI (2023)
Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer
Proving Hypersafety Compositionally. CoRR (2022)
Azadeh Farzan, Umang Mathur
Coarser Equivalences for Concurrent Program Runs. CoRR (2022)
Azadeh Farzan, Dominik Klumpp, Andreas Podelski
Sound sequentialization for concurrent program verification. PLDI (2022)
Dominik Klumpp, Daniel Dietsch, Matthias Heizmann, Frank Schüssele, Marcel Ebbinghaus, Azadeh Farzan, Andreas Podelski
Ultimate GemCutter and the Axes of Generalization - (Competition Contribution). TACAS (2) (2022)
Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer
Proving hypersafety compositionally. Proc. ACM Program. Lang. 6 (OOPSLA2) (2022)
Azadeh Farzan, Danya Lette, Victor Nicolet
Recursion synthesis with unrealizability witnesses. PLDI (2022)
Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil
A Pragmatic Approach to Stateful Partial Order Reduction. CoRR (2022)
Azadeh Farzan, Victor Nicolet
Phased synthesis of divide and conquer programs. PLDI (2021)
Azadeh Farzan, Victor Nicolet
Counterexample-Guided Partial Bounding for Recursive Function Synthesis. CAV (1) (2021)
Emanuele D'Osualdo, Julian Sutherland, Azadeh Farzan, Philippa Gardner
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. ACM Trans. Program. Lang. Syst. 43 (4) (2021)
Azadeh Farzan, Anthony Vandikas
Reductions for safety proofs. Proc. ACM Program. Lang. 4 (POPL) (2020)
Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil
Root Causing Linearizability Violations. CAV (1) (2020)
Azadeh Farzan, Anthony Vandikas
Reductions for Automated Hypersafety Verification. CoRR (2019)
Azadeh Farzan, Victor Nicolet
Modular divide-and-conquer parallelization of nested loops. PLDI (2019)
Azadeh Farzan, Victor Nicolet
Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version). CoRR (2019)
Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner, Julian Sutherland
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. CoRR (2019)
Azadeh Farzan, Anthony Vandikas
Automated Hypersafety Verification. CAV (1) (2019)
Azadeh Farzan, Anthony Vandikas
Reductions for Safety Proofs (Extended Version). CoRR (2019)
Azadeh Farzan, Zachary Kincaid
Strategy synthesis for linear arithmetic games. Proc. ACM Program. Lang. 2 (POPL) (2018)
Azadeh Farzan, Zachary Kincaid
A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). CONCUR (2017)
Azadeh Farzan, Victor Nicolet
Synthesis of divide and conquer parallelism for loops. PLDI (2017)
Azadeh Farzan, Victor Nicolet
Automated Synthesis of Divide and Conquer Parallelism. CoRR (2017)
Constantin Enea, Azadeh Farzan
On Atomicity in Presence of Non-atomic Writes. TACAS (2016)
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
Proving Liveness of Parameterized Programs. CoRR (2016)
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
Proving Liveness of Parameterized Programs. LICS (2016)
Azadeh Farzan, Zachary Kincaid
Linear Arithmetic Satisfiability via Strategy Improvement. IJCAI (2016)
Azadeh Farzan, Andreas Holzer, Helmut Veith
Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution. ICST (2015)
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
Proof Spaces for Unbounded Parallelism. POPL (2015)
Azadeh Farzan, Zachary Kincaid
Compositional Recurrence Analysis. FMCAD (2015)
Azadeh Farzan, Zachary Kincaid
Compositional Invariant Generation via Linear Recurrence Analysis. CoRR (2015)
Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, Andreas Podelski
Automated Program Verification. LATA (2015)
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
Proofs that count. POPL (2014)
Swarat Chaudhuri, Azadeh Farzan, Zachary Kincaid
Consistency analysis of decision-making programs. POPL (2014)
Azadeh Farzan, Andreas Holzer, Niloofar Razavi, Helmut Veith
Concolic Testing of Concurrent Programs. Software Engineering (2014)
Niloofar Razavi, Azadeh Farzan, Sheila A. McIlraith
Generating effective tests for concurrent programs via AI automated planning techniques. Int. J. Softw. Tools Technol. Transf. 16 (1) (2014)
Azadeh Farzan, Andreas Holzer, Niloofar Razavi, Helmut Veith
Con2colic testing. ESEC/SIGSOFT FSE (2013)
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
Inductive data flow graphs. POPL (2013)
Azadeh Farzan, Zachary Kincaid
Duet: Static Analysis for Unbounded Parallelism. CAV (2013)
Azadeh Farzan, Zachary Kincaid
An Algebraic Framework for Compositional Program Analysis. CoRR (2013)
Azadeh Farzan, P. Madhusudan, Niloofar Razavi, Francesco Sorrentino
Predicting null-pointer dereferences in concurrent programs. SIGSOFT FSE (2012)
Azadeh Farzan, Zachary Kincaid
Verification of parameterized concurrent programs by modular reasoning about data and control. POPL (2012)
Niloofar Razavi, Azadeh Farzan, Andreas Holzer
Bounded-Interference Sequentialization for Testing Concurrent Programs. ISoLA (1) (2012)
Yu-Fang Chen, Edmund M. Clarke, Azadeh Farzan, Ming-Hsien Tsai, Yih-Kuen Tsay, Bow-Yaw Wang
Automated Assume-Guarantee Reasoning through Implicit Learning. CAV (2010)
Francesco Sorrentino, Azadeh Farzan, P. Madhusudan
PENELOPE: weaving threads to expose atomicity violations. SIGSOFT FSE (2010)
Yu-Fang Chen, Edmund M. Clarke, Azadeh Farzan, Fei He, Ming-Hsien Tsai, Yih-Kuen Tsay, Bow-Yaw Wang, Lei Zhu
Comparing Learning Algorithms in Automated Assume-Guarantee Reasoning. ISoLA (1) (2010)
Azadeh Farzan, Zachary Kincaid
Compositional Bitvector Analysis for Concurrent Programs with Nested Locks. SAS (2010)
Azadeh Farzan, P. Madhusudan, Francesco Sorrentino
Meta-analysis for Atomicity Violations under Nested Locking. CAV (2009)
Yu-Fang Chen, Azadeh Farzan, Edmund M. Clarke, Yih-Kuen Tsay, Bow-Yaw Wang
Learning Minimal Separating DFA's for Compositional Verification. TACAS (2009)
Azadeh Farzan, P. Madhusudan
The Complexity of Predicting Atomicity Violations. TACAS (2009)
Azadeh Farzan, P. Madhusudan
Monitoring Atomicity in Concurrent Programs. CAV (2008)
Azadeh Farzan, Yu-Fang Chen, Edmund M. Clarke, Yih-Kuen Tsay, Bow-Yaw Wang
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages. TACAS (2008)
Azadeh Farzan, P. Madhusudan
Causal Dataflow Analysis for Concurrent Programs. TACAS (2007)
Azadeh Farzan, P. Madhusudan
Causal Atomicity. CAV (2006)
Azadeh Farzan, José Meseguer
State Space Reduction of Rewrite Theories Using Invisible Transitions. AMAST (2006)
Azadeh Farzan, José Meseguer
Partial Order Reduction for Rewriting Semantics of Programming Languages. WRLA (2006)
Azadeh Farzan, Feng Chen, José Meseguer, Grigore Rosu
Formal Analysis of Java Programs in JavaFAN. CAV (2004)
Azadeh Farzan, José Meseguer, Grigore Rosu
Formal JVM Code Analysis in JavaFAN. AMAST (2004)