default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAzadeh Farzan
Person information
- affiliation: University of Toronto, Canada
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Azadeh Farzan, Victor Nicolet:
Partial bounding for recursive function synthesis. Formal Methods Syst. Des. 63(1): 172-205 (2024)- [j8]Azadeh Farzan
, Umang Mathur:
Coarser Equivalences for Causal Concurrency. Proc. ACM Program. Lang. 8(POPL): 911-941 (2024) - [j7]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Commutativity Simplifies Proofs of Parameterized Programs. Proc. ACM Program. Lang. 8(POPL): 2485-2513 (2024) - [i13]Jialu Bao, Emanuele D'Osualdo, Azadeh Farzan:
Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning. CoRR abs/2402.18708 (2024) - 2023
- [j6]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Stratified Commutativity in Verification Algorithms for Concurrent Programs. Proc. ACM Program. Lang. 7(POPL): 1426-1453 (2023) - [c44]Danya Lette, Azadeh Farzan:
Commutativity for Concurrent Program Termination Proofs. CAV (1) 2023: 109-131 - [c43]Azadeh Farzan:
Commutativity in Automated Verification. LICS 2023: 1-7 - [c42]Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil:
A Pragmatic Approach to Stateful Partial Order Reduction. VMCAI 2023: 129-154 - [i12]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Commutativity Simplifies Proofs of Parameterized Programs. CoRR abs/2311.02673 (2023) - 2022
- [j5]Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
Proving hypersafety compositionally. Proc. ACM Program. Lang. 6(OOPSLA2): 289-314 (2022) - [c41]Azadeh Farzan, Danya Lette, Victor Nicolet:
Recursion synthesis with unrealizability witnesses. PLDI 2022: 244-259 - [c40]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Sound sequentialization for concurrent program verification. PLDI 2022: 506-521 - [c39]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: 479-483 - [d5]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Artifact for PLDI'22 paper "What Is Your Preference Order?". Zenodo, 2022
- [d4]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Artifact for PLDI'22 paper "What Is Your Preference Order?". Zenodo, 2022 - [d3]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Artifact for PLDI'22 paper "Sound Sequentialization for Concurrent Program Verification". Zenodo, 2022 - [d2]Dominik Klumpp, Daniel Dietsch, Matthias Heizmann, Frank Schüssele, Azadeh Farzan, Andreas Podelski:
Ultimate GemCutter SV-COMP 2023 Competition Contribution. Zenodo, 2022 - [i11]Azadeh Farzan, Umang Mathur:
Coarser Equivalences for Concurrent Program Runs. CoRR abs/2208.12117 (2022) - [i10]Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
Proving Hypersafety Compositionally. CoRR abs/2209.07448 (2022) - [i9]Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil:
A Pragmatic Approach to Stateful Partial Order Reduction. CoRR abs/2211.11942 (2022) - 2021
- [j4]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): 16:1-16:134 (2021) - [c38]Azadeh Farzan, Victor Nicolet:
Counterexample-Guided Partial Bounding for Recursive Function Synthesis. CAV (1) 2021: 832-855 - [c37]Azadeh Farzan, Victor Nicolet:
Phased synthesis of divide and conquer programs. PLDI 2021: 974-986 - [d1]Dominik Klumpp, Daniel Dietsch, Matthias Heizmann, Frank Schüssele, Marcel Ebbinghaus, Azadeh Farzan, Andreas Podelski:
Ultimate GemCutter SV-COMP 2022 Competition Contribution. Zenodo, 2021 - 2020
- [j3]Azadeh Farzan, Anthony Vandikas:
Reductions for safety proofs. Proc. ACM Program. Lang. 4(POPL): 13:1-13:28 (2020) - [c36]Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil:
Root Causing Linearizability Violations. CAV (1) 2020: 350-375
2010 – 2019
- 2019
- [c35]Azadeh Farzan, Anthony Vandikas:
Automated Hypersafety Verification. CAV (1) 2019: 200-218 - [c34]Azadeh Farzan, Victor Nicolet:
Modular divide-and-conquer parallelization of nested loops. PLDI 2019: 610-624 - [i8]Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner, Julian Sutherland:
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. CoRR abs/1901.05750 (2019) - [i7]Azadeh Farzan, Victor Nicolet:
Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version). CoRR abs/1904.01031 (2019) - [i6]Azadeh Farzan, Anthony Vandikas:
Reductions for Automated Hypersafety Verification. CoRR abs/1905.09242 (2019) - [i5]Azadeh Farzan, Anthony Vandikas:
Reductions for Safety Proofs (Extended Version). CoRR abs/1910.14619 (2019) - 2018
- [j2]Azadeh Farzan, Zachary Kincaid:
Strategy synthesis for linear arithmetic games. Proc. ACM Program. Lang. 2(POPL): 61:1-61:30 (2018) - 2017
- [c33]Azadeh Farzan, Zachary Kincaid:
A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). CONCUR 2017: 4:1-4:11 - [c32]Azadeh Farzan, Victor Nicolet:
Synthesis of divide and conquer parallelism for loops. PLDI 2017: 540-555 - [i4]Azadeh Farzan, Victor Nicolet:
Automated Synthesis of Divide and Conquer Parallelism. CoRR abs/1701.08345 (2017) - 2016
- [c31]Azadeh Farzan, Zachary Kincaid:
Linear Arithmetic Satisfiability via Strategy Improvement. IJCAI 2016: 735-743 - [c30]Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Proving Liveness of Parameterized Programs. LICS 2016: 185-196 - [c29]Constantin Enea, Azadeh Farzan:
On Atomicity in Presence of Non-atomic Writes. TACAS 2016: 497-514 - [e2]Swarat Chaudhuri, Azadeh Farzan:
Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9779, Springer 2016, ISBN 978-3-319-41527-7 [contents] - [e1]Swarat Chaudhuri, Azadeh Farzan:
Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part II. Lecture Notes in Computer Science 9780, Springer 2016, ISBN 978-3-319-41539-0 [contents] - [i3]Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Proving Liveness of Parameterized Programs. CoRR abs/1605.02350 (2016) - 2015
- [c28]Azadeh Farzan, Zachary Kincaid:
Compositional Recurrence Analysis. FMCAD 2015: 57-64 - [c27]Azadeh Farzan, Andreas Holzer, Helmut Veith:
Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution. ICST 2015: 1-11 - [c26]Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, Andreas Podelski:
Automated Program Verification. LATA 2015: 25-46 - [c25]Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Proof Spaces for Unbounded Parallelism. POPL 2015: 407-420 - [i2]Azadeh Farzan, Zachary Kincaid:
Compositional Invariant Generation via Linear Recurrence Analysis. CoRR abs/1502.00138 (2015) - 2014
- [j1]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): 49-65 (2014) - [c24]Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Proofs that count. POPL 2014: 151-164 - [c23]Swarat Chaudhuri, Azadeh Farzan, Zachary Kincaid:
Consistency analysis of decision-making programs. POPL 2014: 555-568 - [c22]Azadeh Farzan, Andreas Holzer, Niloofar Razavi, Helmut Veith:
Concolic Testing of Concurrent Programs. Software Engineering 2014: 101-102 - 2013
- [c21]Azadeh Farzan, Zachary Kincaid:
Duet: Static Analysis for Unbounded Parallelism. CAV 2013: 191-196 - [c20]Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Inductive data flow graphs. POPL 2013: 129-142 - [c19]Azadeh Farzan, Andreas Holzer, Niloofar Razavi, Helmut Veith:
Con2colic testing. ESEC/SIGSOFT FSE 2013: 37-47 - [i1]Azadeh Farzan, Zachary Kincaid:
An Algebraic Framework for Compositional Program Analysis. CoRR abs/1310.3481 (2013) - 2012
- [c18]Niloofar Razavi, Azadeh Farzan, Andreas Holzer:
Bounded-Interference Sequentialization for Testing Concurrent Programs. ISoLA (1) 2012: 372-387 - [c17]Azadeh Farzan, Zachary Kincaid:
Verification of parameterized concurrent programs by modular reasoning about data and control. POPL 2012: 297-308 - [c16]Azadeh Farzan, P. Madhusudan, Niloofar Razavi, Francesco Sorrentino:
Predicting null-pointer dereferences in concurrent programs. SIGSOFT FSE 2012: 47 - 2010
- [c15]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: 511-526 - [c14]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: 643-657 - [c13]Azadeh Farzan, Zachary Kincaid:
Compositional Bitvector Analysis for Concurrent Programs with Nested Locks. SAS 2010: 253-270 - [c12]Francesco Sorrentino, Azadeh Farzan, P. Madhusudan:
PENELOPE: weaving threads to expose atomicity violations. SIGSOFT FSE 2010: 37-46
2000 – 2009
- 2009
- [c11]Azadeh Farzan, P. Madhusudan, Francesco Sorrentino:
Meta-analysis for Atomicity Violations under Nested Locking. CAV 2009: 248-262 - [c10]Yu-Fang Chen, Azadeh Farzan, Edmund M. Clarke, Yih-Kuen Tsay, Bow-Yaw Wang:
Learning Minimal Separating DFA's for Compositional Verification. TACAS 2009: 31-45 - [c9]Azadeh Farzan, P. Madhusudan:
The Complexity of Predicting Atomicity Violations. TACAS 2009: 155-169 - 2008
- [c8]Azadeh Farzan, P. Madhusudan:
Monitoring Atomicity in Concurrent Programs. CAV 2008: 52-65 - [c7]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: 2-17 - 2007
- [b1]Azadeh Farzan:
Static and Dynamic Formal Analysis of Concurrent Systems and Languages: A Semantics-Based Approach. University of Illinois Urbana-Champaign, USA, 2007 - [c6]Azadeh Farzan, P. Madhusudan:
Causal Dataflow Analysis for Concurrent Programs. TACAS 2007: 102-116 - [p1]Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott, Christiano Braga, Azadeh Farzan, Joe Hendrix, Peter Csaba Ölveczky, Miguel Palomino, Ralf Sasse, Mark-Oliver Stehr, Alberto Verdejo:
Some Tools. All About Maude 2007: 667-693 - 2006
- [c5]Azadeh Farzan, José Meseguer:
State Space Reduction of Rewrite Theories Using Invisible Transitions. AMAST 2006: 142-157 - [c4]Azadeh Farzan, P. Madhusudan:
Causal Atomicity. CAV 2006: 315-328 - [c3]Azadeh Farzan, José Meseguer:
Partial Order Reduction for Rewriting Semantics of Programming Languages. WRLA 2006: 61-78 - 2004
- [c2]Azadeh Farzan, José Meseguer, Grigore Rosu:
Formal JVM Code Analysis in JavaFAN. AMAST 2004: 132-147 - [c1]Azadeh Farzan, Feng Chen, José Meseguer, Grigore Rosu:
Formal Analysis of Java Programs in JavaFAN. CAV 2004: 501-505
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
