Collaborated with:K.Chatterjee H.F.0001 A.Pavlogiannis Y.Velner M.Huang R.Ibsen-Jensen Nastaran Okati Peixin Wang Xudong Qin Wenjun Shi
Talks about:program (4) analysi (4) probabilist (3) algorithm (2) termin (2) positivstellensatz (1) nondeterminist (1) treewidth (1) parameter (1) properti (1)
Person: Amir Kafshdar Goharshady
DBLP: Goharshady:Amir_Kafshdar
Contributed to:
2018
20162017
2019
2016
20192019Wrote 7 papers:
- ESOP-2018-ChatterjeeGV #analysis #contract
- Quantitative Analysis of Smart Contracts (KC, AKG, YV), pp. 739–767.
- CAV-2016-ChatterjeeFG #analysis #probability #source code #termination
- Termination Analysis of Probabilistic Programs Through Positivstellensatz's (KC, HF0, AKG), pp. 3–22.
- CAV-2017-ChatterjeeFG #analysis #recursion #source code #worst-case
- Non-polynomial Worst-Case Analysis of Recursive Programs (KC, HF0, AKG), pp. 41–63.
- OOPSLA-2019-Huang0CG #composition #probability #source code #termination #verification
- Modular verification for almost-sure termination of probabilistic programs (MH, HF0, KC, AKG), p. 29.
- POPL-2016-ChatterjeeGIP #algebra #algorithm #component #concurrent #constant
- Algorithms for algebraic path properties in concurrent systems of constant treewidth components (KC, AKG, RIJ, AP), pp. 733–747.
- PLDI-2019-Wang0GCQS #cost analysis #nondeterminism #probability #source code
- Cost analysis of nondeterministic probabilistic programs (PW, HF0, AKG, KC, XQ, WS), pp. 204–220.
- POPL-2019-ChatterjeeGOP #algorithm #performance
- Efficient parameterized algorithms for data packing (KC, AKG, NO, AP), p. 28.