Person: Azadeh Farzan

DBLP: Farzan:Azadeh

Facilitated 2 volumes:

Ed

Ed

Contributed to:

2015

2015

2015

2014

2013

2013

2013

2012

2012

2010

2010

2010

2009

2009

2008

2008

2007

2006

2007

2004

2019

2017

2018

2019

2020

Wrote 27 papers:

ICST-2015-FarzanHV #concurrent #execution #testing

Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution (AF, AH, HV), pp. 1–11.

LATA-2015-FarzanHHKP #automation #verification

Automated Program Verification (AF, MH, JH, ZK, AP), pp. 25–46.

POPL-2015-FarzanKP #bound #parallel #proving

Proof Spaces for Unbounded Parallelism (AF, ZK, AP), pp. 407–420.

POPL-2014-ChaudhuriFK #analysis #consistency #source code

Consistency analysis of decision-making programs (SC, AF, ZK), pp. 555–568.

POPL-2014-FarzanKP #proving

Proofs that count (AF, ZK, AP), pp. 151–164.

CAV-2013-FarzanK #bound #named #parallel #static analysis

Duet: Static Analysis for Unbounded Parallelism (AF, ZK), pp. 191–196.

ESEC-FSE-2013-FarzanHRV #testing

Con2colic testing (AF, AH, NR, HV), pp. 37–47.

POPL-2013-FarzanKP #data flow #graph #induction

Inductive data flow graphs (AF, ZK, AP), pp. 129–142.

FSE-2012-FarzanMRS #concurrent #predict #source code

Predicting null-pointer dereferences in concurrent programs (AF, PM, NR, FS), p. 47.

POPL-2012-FarzanK #composition #concurrent #reasoning #source code #verification

Verification of parameterized concurrent programs by modular reasoning about data and control (AF, ZK), pp. 297–308.

CAV-2010-ChenCFTTW #automation #learning #reasoning

Automated Assume-Guarantee Reasoning through Implicit Learning (YFC, EMC, AF, MHT, YKT, BYW), pp. 511–526.

FSE-2010-SorrentinoFM #named #thread #weaving

PENELOPE: weaving threads to expose atomicity violations (FS, AF, PM), pp. 37–46.

SAS-2010-FarzanK #analysis #composition #concurrent #source code

Compositional Bitvector Analysis for Concurrent Programs with Nested Locks (AF, ZK), pp. 253–270.

CAV-2009-FarzanMS

Meta-analysis for Atomicity Violations under Nested Locking (AF, PM, FS), pp. 248–262.

TACAS-2009-ChenFCTW #automaton #composition #learning #verification

Learning Minimal Separating DFA’s for Compositional Verification (YFC, AF, EMC, YKT, BYW), pp. 31–45.

TACAS-2009-FarzanM #complexity #predict

The Complexity of Predicting Atomicity Violations (AF, PM), pp. 155–169.

CAV-2008-FarzanM #concurrent #monitoring #source code

Monitoring Atomicity in Concurrent Programs (AF, PM), pp. 52–65.

TACAS-2008-FarzanCCTW #automation #composition #regular expression #verification

Extending Automated Compositional Verification to the Full Class of ω-Regular Languages (AF, YFC, EMC, YKT, BYW), pp. 2–17.

TACAS-2007-FarzanM #analysis #concurrent #data flow #source code

Causal Dataflow Analysis for Concurrent Programs (AF, PM), pp. 102–116.

CAV-2006-FarzanM

Causal Atomicity (AF, PM), pp. 315–328.

WRLA-2006-FarzanM07 #partial order #programming language #reduction #semantics

Partial Order Reduction for Rewriting Semantics of Programming Languages (AF, JM), pp. 61–78.

CAV-2004-FarzanCMR #analysis #formal method #java #source code

Formal Analysis of Java Programs in JavaFAN (AF, FC, JM, GR), pp. 501–505.

CAV-2019-FarzanV #automation #verification

Automated Hypersafety Verification (AF, AV), pp. 200–218.

PLDI-2017-FarzanN #divide and conquer #parallel #synthesis

Synthesis of divide and conquer parallelism for loops (AF, VN), pp. 540–555.

POPL-2018-FarzanK #game studies #linear #synthesis

Strategy synthesis for linear arithmetic games (AF, ZK), p. 30.

PLDI-2019-FarzanN #composition #divide and conquer #parallel

Modular divide-and-conquer parallelization of nested loops (AF, VN), pp. 610–624.

POPL-2020-FarzanV #proving #reduction #safety

Reductions for safety proofs (AF, AV), p. 28.