default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmir Kafshdar Goharshady
Person information
- affiliation: Institute of Science and Technology Austria
SPARQL queries 
🛈 Please note that only 72% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j13]Krishnendu Chatterjee
, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic:
Quantitative Bounds on Resource Usage of Probabilistic Programs. Proc. ACM Program. Lang. 8(OOPSLA1): 362-391 (2024)- [j12]Amir Kafshdar Goharshady, Chun Kit Lam, Lionel Parreaux:
Fast and Optimal Extraction for Sparse Equality Graphs. Proc. ACM Program. Lang. 8(OOPSLA2): 2551-2577 (2024) - [c40]Amir Kafshdar Goharshady, Zhaorun Lin:
Blind Vote: Economical and Secret Blockchain-Based Voting. Blockchain 2024: 46-53 - [c39]Soroush Farokhnia, Amir Kafshdar Goharshady:
Options and Futures Imperil Bitcoin's Security. Blockchain 2024: 157-164 - [c38]Togzhan Barakbayeva, Soroush Farokhnia, Amir Kafshdar Goharshady, Markus Gufler, Sergei Novozhilov:
Pixiu: Optimal Block Production Revenues on Cardano. Blockchain 2024: 491-496 - [c37]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic. FM (1) 2024: 111-130 - [c36]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic:
Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. FM (1) 2024: 600-619 - [c35]V. P. Abidha, Togzhan Barakbayeva, Zhuo Cai, Amir Kafshdar Goharshady:
Gas-Efficient Decentralized Random Beacons. ICBC 2024: 205-209 - [c34]Togzhan Barakbayeva, Zhuo Cai, Amir Kafshdar Goharshady:
SRNG: An Efficient Decentralized Approach for Secret Random Number Generation. ICBC 2024: 615-619 - [c33]Kianoush Arshi, Amir Kafshdar Goharshady:
Congesting Ethereum after EIP-1559. ICBC 2024: 667-669 - [c32]S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. LPAR 2024: 484-502 - [c31]Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Pavel Hudec, Pingjiang Li, Harshit J. Motwani:
Faster Treewidth-Based Approximations for Wiener Index. SEA 2024: 6:1-6:19 - [i26]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic:
Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. CoRR abs/2403.05386 (2024) - [i25]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Dorde Zikelic:
PolyHorn: A Polynomial Horn Clause Solver. CoRR abs/2408.03796 (2024) - 2023
- [j11]Amir Kafshdar Goharshady, S. Hitarth, Fatemeh Mohammadi, Harshit J. Motwani:
Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs. Proc. ACM Program. Lang. 7(OOPSLA1): 727-756 (2023) - [j10]Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Chun Kit Lam:
The Bounded Pathwidth of Control-Flow Graphs. Proc. ACM Program. Lang. 7(OOPSLA2): 292-317 (2023) - [j9]Zhuo Cai, Soroush Farokhnia, Amir Kafshdar Goharshady, S. Hitarth:
Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts. Proc. ACM Program. Lang. 7(OOPSLA2): 882-911 (2023) - [j8]Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Kerim Kochekov, Yun Chen Tsai, Ahmed Khaled Zaher:
Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis. Proc. ACM Program. Lang. 7(OOPSLA2): 1993-2022 (2023) - [c30]Pouria Fatemi, Amir Kafshdar Goharshady:
Secure and Decentralized Generation of Secret Random Numbers on the Blockchain. BCCA 2023: 511-517 - [c29]Jonas Ballweg, Zhuo Cai, Amir Kafshdar Goharshady:
PureLottery: Fair Leader Election without Decentralized Random Number Generation. Blockchain 2023: 273-280 - [c28]Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Automated Tail Bound Analysis for Probabilistic Recurrence Relations. CAV (3) 2023: 16-39 - [c27]Zhuo Cai, Amir Kafshdar Goharshady:
Trustless and Bias-resistant Game-theoretic Distributed Randomness. ICBC 2023: 1-3 - [c26]Soroush Farokhnia, Amir Kafshdar Goharshady:
Reducing the Gas Usage of Ethereum Smart Contracts without a Sidechain. ICBC 2023: 1-3 - [c25]Zhuo Cai, Amir Kafshdar Goharshady:
Game-Theoretic Randomness for Proof-of-Stake. MARBLE 2023: 28-47 - [c24]Soroush Farokhnia, Amir Kafshdar Goharshady:
Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts. SAC 2023: 258-261 - [c23]Amir Kafshdar Goharshady, Ahmed Khaled Zaher:
Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth. VMCAI 2023: 177-202 - [i24]Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Harshit J. Motwani, Sergei Novozhilov:
Parameterized Algorithms for Topological Indices in Chemistry. CoRR abs/2303.13279 (2023) - [i23]Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Automated Tail Bound Analysis for Probabilistic Recurrence Relations. CoRR abs/2305.15104 (2023) - 2022
- [c22]Mohsen Alambardar Meybodi, Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Ali Shakiba:
Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees. Blockchain 2022: 266-273 - [c21]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic:
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs. CAV (1) 2022: 55-78 - [c20]Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic:
Algorithms and Hardness Results for Computing Cores of Markov Chains. FSTTCS 2022: 29:1-29:20 - [c19]Ali Ahmadi, Majid Daliri, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Efficient approximations for cache-conscious data placement. PLDI 2022: 857-871 - [i22]Amir Kafshdar Goharshady, S. Hitarth, Fatemeh Mohammadi, Harshit J. Motwani:
Template-based Program Synthesis using Stellensätze. CoRR abs/2209.03602 (2022) - 2021
- [c18]Amir Kafshdar Goharshady:
Irrationality, Extortion, or Trusted Third-parties: Why it is Impossible to Buy and Sell Physical Goods Securely on the Blockchain. Blockchain 2021: 73-81 - [c17]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Polynomial reachability witnesses via Stellensätze. PLDI 2021: 772-787 - [c16]Jinyi Wang, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Quantitative analysis of assertion violations in probabilistic programs. PLDI 2021: 1171-1186 - [i21]Amir Kafshdar Goharshady:
Irrationality, Extortion, or Trusted Third-parties: Why it is Impossible to Buy and Sell Physical Goods Securely on the Blockchain. CoRR abs/2110.09857 (2021) - 2020
- [b1]Amir Kafshdar Goharshady:
Parameterized and Algebro-geometric Advances in Static Program Analysis. (Progrès paramétriques et algébro-géométriques dans l'analyse statique des programmes). Institute of Science and Technology Austria, Klosterneuburg, Austria, 2020 - [j7]Amir Kafshdar Goharshady, Fatemeh Mohammadi:
An efficient algorithm for computing network reliability in small treewidth. Reliab. Eng. Syst. Saf. 193: 106665 (2020) - [c15]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. ATVA 2020: 253-270 - [c14]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. ESOP 2020: 112-140 - [c13]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial invariant generation for non-deterministic recursive programs. PLDI 2020: 672-687 - [i20]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. CoRR abs/2001.11070 (2020) - [i19]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. CoRR abs/2004.08828 (2020) - [i18]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Inductive Reachability Witnesses. CoRR abs/2007.14259 (2020) - [i17]Jinyi Wang, Yican Sun, Hongfei Fu, Mingzhang Huang, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. CoRR abs/2008.00425 (2020) - [i16]Jinyi Wang, Yican Sun, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Quantitative Analysis of Assertion Violations in Probabilistic Programs. CoRR abs/2011.14617 (2020)
2010 – 2019
- 2019
- [j6]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Modular verification for almost-sure termination of probabilistic programs. Proc. ACM Program. Lang. 3(OOPSLA): 129:1-129:29 (2019) - [j5]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Nastaran Okati, Andreas Pavlogiannis:
Efficient parameterized algorithms for data packing. Proc. ACM Program. Lang. 3(POPL): 53:1-53:28 (2019) - [j4]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. ACM Trans. Program. Lang. Syst. 41(4): 20:1-20:52 (2019) - [j3]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Trans. Program. Lang. Syst. 41(4): 23:1-23:46 (2019) - [c12]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. IEEE ICBC 2019: 403-412 - [c11]Peixin Wang, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, Wenjun Shi:
Cost analysis of nondeterministic probabilistic programs. PLDI 2019: 204-220 - [c10]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Hybrid mining: exploiting blockchain's computational power for distributed problem solving. SAC 2019: 374-381 - [c9]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
The treewidth of smart contracts. SAC 2019: 400-408 - [i15]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. CoRR abs/1901.06087 (2019) - [i14]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial Invariant Generation for Non-deterministic Recursive Programs. CoRR abs/1902.04373 (2019) - [i13]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Peixin Wang, Xudong Qin, Wenjun Shi:
Cost Analysis of Nondeterministic Probabilistic Programs. CoRR abs/1902.04659 (2019) - [i12]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. CoRR abs/1902.07986 (2019) - 2018
- [j2]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Trans. Program. Lang. Syst. 40(3): 9:1-9:43 (2018) - [c8]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CONCUR 2018: 11:1-11:17 - [c7]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner:
Quantitative Analysis of Smart Contracts. ESOP 2018: 739-767 - [c6]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati:
Computational Approaches for Stochastic Shortest Path on Succinct MDPs. IJCAI 2018: 4700-4707 - [c5]Amir Kafshdar Goharshady, Ali Behrouz, Krishnendu Chatterjee:
Secure Credit Reporting on the Blockchain. iThings/GreenCom/CPSCom/SmartData 2018: 1343-1348 - [i11]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner:
Quantitative Analysis of Smart Contracts. CoRR abs/1801.03367 (2018) - [i10]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati:
Computational Approaches for Stochastic Shortest Path on Succinct MDPs. CoRR abs/1804.08984 (2018) - [i9]Amir Kafshdar Goharshady, Ali Behrouz, Krishnendu Chatterjee:
Secure Credit Reporting on the Blockchain. CoRR abs/1805.09104 (2018) - [i8]Ali Shakiba, Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Mohsen Alambardar Meybodi:
A note on belief structures and S-approximation spaces. CoRR abs/1805.10672 (2018) - [i7]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CoRR abs/1806.03108 (2018) - 2017
- [c4]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
JTDec: A Tool for Tree Decompositions in Soot. ATVA 2017: 59-66 - [c3]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. CAV (2) 2017: 41-63 - [i6]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. CoRR abs/1705.00317 (2017) - [i5]Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, Mohsen Alambardar Meybodi:
[1, 2]-sets and [1, 2]-total Sets in Trees with Algorithms. CoRR abs/1706.05248 (2017) - [i4]Amir Kafshdar Goharshady, Fatemeh Mohammadi:
A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth. CoRR abs/1712.09692 (2017) - 2016
- [j1]Amir Kafshdar Goharshady, Mohammad Reza Hooshmandasl, M. Alambardar Meybodi:
[1, 2]-sets and [1, 2]-total sets in trees with algorithms. Discret. Appl. Math. 198: 136-146 (2016) - [c2]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Termination Analysis of Probabilistic Programs Through Positivstellensatz's. CAV (1) 2016: 3-22 - [c1]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL 2016: 733-747 - [i3]Mohammad Reza Hooshmandasl, M. Alambardar Meybodi, Amir Kafshdar Goharshady, Ali Shakiba:
A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces. CoRR abs/1602.00998 (2016) - [i2]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Termination Analysis of Probabilistic Programs through Positivstellensatz's. CoRR abs/1604.07169 (2016) - 2015
- [i1]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. CoRR abs/1510.07565 (2015)
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-12-10 20:43 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:
