Formal JVM Code Analysis in JavaFAN. - Azadeh Farzan; José Meseguer 001; Grigore Rosu (AMAST, 2004)

Formal Analysis of Java Programs in JavaFAN. - Azadeh Farzan; Feng Chen 006; José Meseguer 001; Grigore Rosu (CAV, 2004)

State Space Reduction of Rewrite Theories Using Invisible Transitions. - Azadeh Farzan; José Meseguer 001 (AMAST, 2006)

Causal Atomicity. - Azadeh Farzan; P. Madhusudan (CAV, 2006)

Partial Order Reduction for Rewriting Semantics of Programming Languages. - Azadeh Farzan; José Meseguer 001 (WRLA, 2006)

Some Tools. - Manuel Clavel; Francisco Durán 001; Steven Eker; Patrick Lincoln; Narciso Martí-Oliet; José Meseguer 001; Carolyn L. Talcott; Christiano Braga; Azadeh Farzan; Joe Hendrix; Peter Csaba Ölveczky; Miguel Palomino; et al. (All About Maude, 2007)

Causal Dataflow Analysis for Concurrent Programs. - Azadeh Farzan; P. Madhusudan (TACAS, 2007)

Static and Dynamic Formal Analysis of Concurrent Systems and Languages: A Semantics-Based Approach - Azadeh Farzan (2007)

Monitoring Atomicity in Concurrent Programs. - Azadeh Farzan; P. Madhusudan (CAV, 2008)

Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages. - Azadeh Farzan; Yu-Fang Chen 001; Edmund M. Clarke; Yih-Kuen Tsay; Bow-Yaw Wang (TACAS, 2008)

Meta-analysis for Atomicity Violations under Nested Locking. - Azadeh Farzan; P. Madhusudan; Francesco Sorrentino 002 (CAV, 2009)

Learning Minimal Separating DFA's for Compositional Verification. - Yu-Fang Chen 001; Azadeh Farzan; Edmund M. Clarke; Yih-Kuen Tsay; Bow-Yaw Wang (TACAS, 2009)

The Complexity of Predicting Atomicity Violations. - Azadeh Farzan; P. Madhusudan (TACAS, 2009)

Automated Assume-Guarantee Reasoning through Implicit Learning. - Yu-Fang Chen 001; Edmund M. Clarke; Azadeh Farzan; Ming-Hsien Tsai 001; Yih-Kuen Tsay; Bow-Yaw Wang (CAV, 2010)

Comparing Learning Algorithms in Automated Assume-Guarantee Reasoning. - Yu-Fang Chen 001; Edmund M. Clarke; Azadeh Farzan; Fei He 001; Ming-Hsien Tsai 001; Yih-Kuen Tsay; Bow-Yaw Wang; Lei Zhu (ISoLA (1), 2010)

Compositional Bitvector Analysis for Concurrent Programs with Nested Locks. - Azadeh Farzan; Zachary Kincaid (SAS, 2010)

PENELOPE: weaving threads to expose atomicity violations. - Francesco Sorrentino 002; Azadeh Farzan; P. Madhusudan (SIGSOFT FSE, 2010)

Bounded-Interference Sequentialization for Testing Concurrent Programs. - Niloofar Razavi; Azadeh Farzan; Andreas Holzer (ISoLA (1), 2012)

Verification of parameterized concurrent programs by modular reasoning about data and control. - Azadeh Farzan; Zachary Kincaid (POPL, 2012)

Predicting null-pointer dereferences in concurrent programs. - Azadeh Farzan; P. Madhusudan; Niloofar Razavi; Francesco Sorrentino 002 (SIGSOFT FSE, 2012)

Duet: Static Analysis for Unbounded Parallelism. - Azadeh Farzan; Zachary Kincaid (CAV, 2013)

Inductive data flow graphs. - Azadeh Farzan; Zachary Kincaid; Andreas Podelski (POPL, 2013)

Con2colic testing. - Azadeh Farzan; Andreas Holzer; Niloofar Razavi; Helmut Veith (ESEC/SIGSOFT FSE, 2013)

An Algebraic Framework for Compositional Program Analysis. - Azadeh Farzan; Zachary Kincaid (CoRR, 2013)

Consistency analysis of decision-making programs. - Swarat Chaudhuri; Azadeh Farzan; Zachary Kincaid (POPL, 2014)

Proofs that count. - Azadeh Farzan; Zachary Kincaid; Andreas Podelski (POPL, 2014)

Concolic Testing of Concurrent Programs. - Azadeh Farzan; Andreas Holzer; Niloofar Razavi; Helmut Veith (Software Engineering, 2014)

Generating effective tests for concurrent programs via AI automated planning techniques. - Niloofar Razavi; Azadeh Farzan; Sheila A. McIlraith (Int. J. Softw. Tools Technol. Transf., 2014)

Compositional Recurrence Analysis. - Azadeh Farzan; Zachary Kincaid (FMCAD, 2015)

Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution. - Azadeh Farzan; Andreas Holzer; Helmut Veith (ICST, 2015)

Automated Program Verification. - Azadeh Farzan; Matthias Heizmann; Jochen Hoenicke; Zachary Kincaid; Andreas Podelski (LATA, 2015)

Proof Spaces for Unbounded Parallelism. - Azadeh Farzan; Zachary Kincaid; Andreas Podelski (POPL, 2015)

Compositional Invariant Generation via Linear Recurrence Analysis. - Azadeh Farzan; Zachary Kincaid (CoRR, 2015)

Linear Arithmetic Satisfiability via Strategy Improvement. - Azadeh Farzan; Zachary Kincaid (IJCAI, 2016)

Proving Liveness of Parameterized Programs. - Azadeh Farzan; Zachary Kincaid; Andreas Podelski (LICS, 2016)

On Atomicity in Presence of Non-atomic Writes. - Constantin Enea; Azadeh Farzan (TACAS, 2016)

A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). - Azadeh Farzan; Zachary Kincaid (CONCUR, 2017)

Synthesis of divide and conquer parallelism for loops. - Azadeh Farzan; Victor Nicolet (PLDI, 2017)

Automated Synthesis of Divide and Conquer Parallelism. - Azadeh Farzan; Victor Nicolet (CoRR, 2017)

Strategy synthesis for linear arithmetic games. - Azadeh Farzan; Zachary Kincaid (Proc. ACM Program. Lang., 2018)

Automated Hypersafety Verification. - Azadeh Farzan; Anthony Vandikas (CAV (1), 2019)

Modular divide-and-conquer parallelization of nested loops. - Azadeh Farzan; Victor Nicolet (PLDI, 2019)

Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version). - Azadeh Farzan; Victor Nicolet (CoRR, 2019)

Reductions for Automated Hypersafety Verification. - Azadeh Farzan; Anthony Vandikas (CoRR, 2019)

Reductions for Safety Proofs (Extended Version). - Azadeh Farzan; Anthony Vandikas (CoRR, 2019)

Root Causing Linearizability Violations. - Berk Çirisci; Constantin Enea; Azadeh Farzan; Suha Orhun Mutluergil (CAV (1), 2020)

Reductions for safety proofs. - Azadeh Farzan; Anthony Vandikas (Proc. ACM Program. Lang., 2020)

Counterexample-Guided Partial Bounding for Recursive Function Synthesis. - Azadeh Farzan; Victor Nicolet (CAV (1), 2021)

Phased synthesis of divide and conquer programs. - Azadeh Farzan; Victor Nicolet (PLDI, 2021)

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. - Emanuele D'Osualdo; Julian Sutherland; Azadeh Farzan; Philippa Gardner (ACM Trans. Program. Lang. Syst., 2021)

Ultimate GemCutter SV-COMP 2022 Competition Contribution. - Dominik Klumpp; Daniel Dietsch; Matthias Heizmann; Frank Schüssele; Marcel Ebbinghaus; Azadeh Farzan; Andreas Podelski (Zenodo, 2021)

Sound sequentialization for concurrent program verification. - Azadeh Farzan; Dominik Klumpp; Andreas Podelski (PLDI, 2022)

Recursion synthesis with unrealizability witnesses. - Azadeh Farzan; Danya Lette; Victor Nicolet (PLDI, 2022)

Ultimate GemCutter and the Axes of Generalization - (Competition Contribution). - Dominik Klumpp; Daniel Dietsch; Matthias Heizmann; Frank Schüssele; Marcel Ebbinghaus; Azadeh Farzan; Andreas Podelski (TACAS (2), 2022)

Coarser Equivalences for Concurrent Program Runs. - Azadeh Farzan; Umang Mathur 001 (CoRR, 2022)

Proving hypersafety compositionally. - Emanuele D'Osualdo; Azadeh Farzan; Derek Dreyer (Proc. ACM Program. Lang., 2022)

Artifact for PLDI'22 paper "What Is Your Preference Order?". - Azadeh Farzan; Dominik Klumpp; Andreas Podelski (Zenodo, 2022)

Artifact for PLDI'22 paper "What Is Your Preference Order?". - Azadeh Farzan; Dominik Klumpp; Andreas Podelski (Zenodo, 2022)

Artifact for PLDI'22 paper "Sound Sequentialization for Concurrent Program Verification". - Azadeh Farzan; Dominik Klumpp; Andreas Podelski (Zenodo, 2022)

Ultimate GemCutter SV-COMP 2023 Competition Contribution. - Dominik Klumpp; Daniel Dietsch; Matthias Heizmann; Frank Schüssele; Azadeh Farzan; Andreas Podelski (Zenodo, 2022)

Commutativity for Concurrent Program Termination Proofs. - Danya Lette; Azadeh Farzan (CAV (1), 2023)

Commutativity in Automated Verification. - Azadeh Farzan (LICS, 2023)

A Pragmatic Approach to Stateful Partial Order Reduction. - Berk Çirisci; Constantin Enea; Azadeh Farzan; Suha Orhun Mutluergil (VMCAI, 2023)

Stratified Commutativity in Verification Algorithms for Concurrent Programs. - Azadeh Farzan; Dominik Klumpp; Andreas Podelski (Proc. ACM Program. Lang., 2023)

Benchmarks for POPL'24 Paper "Commutativity Simplifies Proofs of Parameterized Programs". - Azadeh Farzan; Dominik Klumpp; Andreas Podelski (Zenodo, 2023)

Commutativity Simplifies Proofs of Parameterized Programs. - Azadeh Farzan; Dominik Klumpp; Andreas Podelski (Proc. ACM Program. Lang., 2024)

Coarser Equivalences for Causal Concurrency. - Azadeh Farzan; Umang Mathur 001 (Proc. ACM Program. Lang., 2024)

Partial bounding for recursive function synthesis. - Azadeh Farzan; Victor Nicolet (Formal Methods Syst. Des., 2024)

Choose Your Proofs: Commutativity and Symmetry for Smarter Reasoning. - Azadeh Farzan (CADE, 2025)

Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning. - Jialu Bao; Emanuele D'Osualdo; Azadeh Farzan (Proc. ACM Program. Lang., 2025)

Products of Recursive Programs for Hypersafety Verification. - Ruotong Cheng; Azadeh Farzan (CoRR, 2025)

Enhanced Data Race Prediction Through Modular Reasoning. - Zhendong Ang; Azadeh Farzan; Umang Mathur 001 (CoRR, 2025)