Azadeh Farzan

1.6k total citations
40 papers, 476 citations indexed

About

Azadeh Farzan is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Azadeh Farzan has authored 40 papers receiving a total of 476 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Artificial Intelligence, 23 papers in Computational Theory and Mathematics and 13 papers in Computer Networks and Communications. Recurrent topics in Azadeh Farzan's work include Logic, programming, and type systems (23 papers), Formal Methods in Verification (23 papers) and Parallel Computing and Optimization Techniques (10 papers). Azadeh Farzan is often cited by papers focused on Logic, programming, and type systems (23 papers), Formal Methods in Verification (23 papers) and Parallel Computing and Optimization Techniques (10 papers). Azadeh Farzan collaborates with scholars based in Canada, United States and Germany. Azadeh Farzan's co-authors include Zachary Kincaid, P. Madhusudan, Francesco Sorrentino, Andreas Podelski, Swarat Chaudhuri, Andreas Holzer, Helmut Veith, José Meseguer, Philippa Gardner and Derek Dreyer and has published in prestigious journals such as ACM SIGPLAN Notices, ACM Transactions on Programming Languages and Systems and Lecture notes in computer science.

In The Last Decade

Azadeh Farzan

39 papers receiving 462 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Azadeh Farzan Canada 12 227 221 217 191 175 40 476
Limor Fix United States 9 121 0.5× 106 0.5× 184 0.8× 216 1.1× 176 1.0× 20 424
Oliver Rüthing Germany 8 318 1.4× 175 0.8× 143 0.7× 418 2.2× 210 1.2× 17 562
Tomáš Vojnar Czechia 11 137 0.6× 154 0.7× 132 0.6× 112 0.6× 87 0.5× 61 346
Thomas Pressburger United States 6 205 0.9× 350 1.6× 307 1.4× 131 0.7× 127 0.7× 13 544
Noam Rinetzky Israel 11 254 1.1× 143 0.6× 139 0.6× 153 0.8× 222 1.3× 39 479
Vladimir Levin United States 8 262 1.2× 258 1.2× 198 0.9× 122 0.6× 129 0.7× 14 497
Michael Tautschnig United Kingdom 10 153 0.7× 133 0.6× 149 0.7× 250 1.3× 173 1.0× 34 404
Julien Signoles France 9 188 0.8× 152 0.7× 111 0.5× 77 0.4× 66 0.4× 25 313
Jan Hoffmann United States 14 451 2.0× 122 0.6× 362 1.7× 182 1.0× 125 0.7× 41 578
Konrad Slind United States 10 194 0.9× 78 0.4× 125 0.6× 167 0.9× 204 1.2× 31 418

Countries citing papers authored by Azadeh Farzan

Since Specialization
Citations

This map shows the geographic impact of Azadeh Farzan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Azadeh Farzan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Azadeh Farzan more than expected).

Fields of papers citing papers by Azadeh Farzan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Azadeh Farzan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Azadeh Farzan. The network helps show where Azadeh Farzan may publish in the future.

Co-authorship network of co-authors of Azadeh Farzan

This figure shows the co-authorship network connecting the top 25 collaborators of Azadeh Farzan. A scholar is included among the top collaborators of Azadeh Farzan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Azadeh Farzan. Azadeh Farzan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Farzan, Azadeh, et al.. (2025). Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning. Proceedings of the ACM on Programming Languages. 9(POPL). 1719–1749.
2.
Farzan, Azadeh & Umang Mathur. (2024). Coarser Equivalences for Causal Concurrency. Proceedings of the ACM on Programming Languages. 8(POPL). 911–941. 3 indexed citations
3.
Farzan, Azadeh, et al.. (2024). Commutativity Simplifies Proofs of Parameterized Programs. Proceedings of the ACM on Programming Languages. 8(POPL). 2485–2513. 1 indexed citations
4.
Farzan, Azadeh, et al.. (2023). Stratified Commutativity in Verification Algorithms for Concurrent Programs. Proceedings of the ACM on Programming Languages. 7(POPL). 1426–1453. 4 indexed citations
5.
Farzan, Azadeh, et al.. (2021). TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. ACM Transactions on Programming Languages and Systems. 43(4). 1–134. 7 indexed citations
6.
Farzan, Azadeh, et al.. (2019). Reductions for safety proofs. Proceedings of the ACM on Programming Languages. 4(POPL). 1–28. 9 indexed citations
7.
Farzan, Azadeh, et al.. (2017). Synthesis of divide and conquer parallelism for loops. 540–555. 10 indexed citations
8.
Farzan, Azadeh & Zachary Kincaid. (2016). Linear arithmetic satisfiability via strategy improvement. International Joint Conference on Artificial Intelligence. 735–743. 5 indexed citations
9.
Farzan, Azadeh & Swarat Chaudhuri. (2016). Computer Aided Verification. Lecture notes in computer science. 20 indexed citations
10.
Farzan, Azadeh & Zachary Kincaid. (2015). Compositional recurrence analysis. 57–64. 26 indexed citations
11.
Farzan, Azadeh, Andreas Holzer, & Helmut Veith. (2015). Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution. 2013. 1–11. 3 indexed citations
12.
Farzan, Azadeh, Zachary Kincaid, & Andreas Podelski. (2015). Proof Spaces for Unbounded Parallelism. ACM SIGPLAN Notices. 50(1). 407–420. 1 indexed citations
13.
Chaudhuri, Swarat, Azadeh Farzan, & Zachary Kincaid. (2014). Consistency analysis of decision-making programs. ACM SIGPLAN Notices. 49(1). 555–567. 1 indexed citations
14.
Farzan, Azadeh, et al.. (2014). Concolic Testing of Concurrent Programs. 101–102. 1 indexed citations
15.
Farzan, Azadeh, Zachary Kincaid, & Andreas Podelski. (2013). Inductive data flow graphs. ACM SIGPLAN Notices. 48(1). 129–142. 2 indexed citations
16.
Farzan, Azadeh & Zachary Kincaid. (2012). Verification of parameterized concurrent programs by modular reasoning about data and control. ACM SIGPLAN Notices. 47(1). 297–308. 17 indexed citations
17.
Legay, Axel & Azadeh Farzan. (2009). Proceedings International Workshop on Verification of Infinite-State Systems. Electronic Proceedings in Theoretical Computer Science. 10. 1–2. 1 indexed citations
18.
Farzan, Azadeh & P. Madhusudan. (2007). Causal dataflow analysis for concurrent programs. Lecture notes in computer science. 102–116. 3 indexed citations
19.
Farzan, Azadeh & José Meseguer. (2007). Partial Order Reduction for Rewriting Semantics of Programming Languages. Electronic Notes in Theoretical Computer Science. 176(4). 61–78. 11 indexed citations
20.
Farzan, Azadeh, et al.. (2004). Formal analysis of Java programs in JavaFAN. Lecture notes in computer science. 3114. 501–505. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026