Termination Analysis of Probabilistic Programs Through Positivstellensatz's. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady (CAV (1), 2016)

A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces. - Mohammad Reza Hooshmandasl; M. Alambardar Meybodi; Amir Kafshdar Goharshady; Ali Shakiba (CoRR, 2016)

[1, 2]-sets and [1, 2]-total sets in trees with algorithms. - Amir Kafshdar Goharshady; Mohammad Reza Hooshmandasl; M. Alambardar Meybodi (Discret. Appl. Math., 2016)

JTDec: A Tool for Tree Decompositions in Soot. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ATVA, 2017)

A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth. - Amir Kafshdar Goharshady; Fatemeh Mohammadi (CoRR, 2017)

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Yaron Velner (CONCUR, 2018)

Quantitative Analysis of Smart Contracts. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Yaron Velner (ESOP, 2018)

Computational Approaches for Stochastic Shortest Path on Succinct MDPs. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Nastaran Okati (IJCAI, 2018)

Secure Credit Reporting on the Blockchain. - Amir Kafshdar Goharshady; Ali Behrouz; Krishnendu Chatterjee (iThings/GreenCom/CPSCom/SmartData, 2018)

A note on belief structures and S-approximation spaces. - Ali Shakiba; Amir Kafshdar Goharshady; Mohammad Reza Hooshmandasl; Mohsen Alambardar Meybodi (CoRR, 2018)

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2018)

Probabilistic Smart Contracts: Secure Randomness on the Blockchain. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Arash Pourdamghani (IEEE ICBC, 2019)

Cost analysis of nondeterministic probabilistic programs. - Peixin Wang; Hongfei Fu 001; Amir Kafshdar Goharshady; Krishnendu Chatterjee; Xudong Qin; Wenjun Shi (PLDI, 2019)

The treewidth of smart contracts. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady (SAC, 2019)

Hybrid mining: exploiting blockchain's computational power for distributed problem solving. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Arash Pourdamghani (SAC, 2019)

Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (CoRR, 2019)

Efficient parameterized algorithms for data packing. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Nastaran Okati; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2019)

Modular verification for almost-sure termination of probabilistic programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (Proc. ACM Program. Lang., 2019)

Non-polynomial Worst-Case Analysis of Recursive Programs. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady (ACM Trans. Program. Lang. Syst., 2019)

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Prateesh Goyal; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2019)

Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. - Ali Asadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Kiarash Mohammadi; Andreas Pavlogiannis (ATVA, 2020)

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ESOP, 2020)

Polynomial invariant generation for non-deterministic recursive programs. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady (PLDI, 2020)

Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. - Ali Asadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Kiarash Mohammadi; Andreas Pavlogiannis (CoRR, 2020)

Inductive Reachability Witnesses. - Ali Asadi; Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Mohammad Mahdavi (CoRR, 2020)

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. - Jinyi Wang; Yican Sun; Hongfei Fu 001; Mingzhang Huang; Amir Kafshdar Goharshady; Krishnendu Chatterjee (CoRR, 2020)

An efficient algorithm for computing network reliability in small treewidth. - Amir Kafshdar Goharshady; Fatemeh Mohammadi (Reliab. Eng. Syst. Saf., 2020)

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). - Amir Kafshdar Goharshady (2020)

Irrationality, Extortion, or Trusted Third-parties: Why it is Impossible to Buy and Sell Physical Goods Securely on the Blockchain. - Amir Kafshdar Goharshady (Blockchain, 2021)

Polynomial reachability witnesses via Stellensätze. - Ali Asadi; Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Mohammad Mahdavi (PLDI, 2021)

Quantitative analysis of assertion violations in probabilistic programs. - Jinyi Wang; Yican Sun; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (PLDI, 2021)

Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees. - Mohsen Alambardar Meybodi; Amir Kafshdar Goharshady; Mohammad Reza Hooshmandasl; Ali Shakiba (Blockchain, 2022)

Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Tobias Meggendorfer; Dorde Zikelic (CAV (1), 2022)

Algorithms and Hardness Results for Computing Cores of Markov Chains. - Ali Ahmadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Tobias Meggendorfer; Roodabeh Safavi; Dorde Zikelic (FSTTCS, 2022)

Efficient approximations for cache-conscious data placement. - Ali Ahmadi; Majid Daliri; Amir Kafshdar Goharshady; Andreas Pavlogiannis (PLDI, 2022)

Template-based Program Synthesis using Stellensätze. - Amir Kafshdar Goharshady; S. Hitarth; Fatemeh Mohammadi; Harshit J. Motwani (CoRR, 2022)

Secure and Decentralized Generation of Secret Random Numbers on the Blockchain. - Pouria Fatemi; Amir Kafshdar Goharshady (BCCA, 2023)

PureLottery: Fair Leader Election without Decentralized Random Number Generation. - Jonas Ballweg; Zhuo Cai 001; Amir Kafshdar Goharshady (Blockchain, 2023)

Automated Tail Bound Analysis for Probabilistic Recurrence Relations. - Yican Sun; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (CAV (3), 2023)

Trustless and Bias-resistant Game-theoretic Distributed Randomness. - Zhuo Cai 001; Amir Kafshdar Goharshady (ICBC, 2023)

Reducing the Gas Usage of Ethereum Smart Contracts without a Sidechain. - Soroush Farokhnia; Amir Kafshdar Goharshady (ICBC, 2023)

Game-Theoretic Randomness for Proof-of-Stake. - Zhuo Cai 001; Amir Kafshdar Goharshady (MARBLE, 2023)

Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts. - Soroush Farokhnia; Amir Kafshdar Goharshady (SAC, 2023)

Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth. - Amir Kafshdar Goharshady; Ahmed Khaled Zaher (VMCAI, 2023)

Parameterized Algorithms for Topological Indices in Chemistry. - Giovanna Kobus Conrado; Amir Kafshdar Goharshady; Harshit J. Motwani; Sergei Novozhilov (CoRR, 2023)

Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs. - Amir Kafshdar Goharshady; S. Hitarth; Fatemeh Mohammadi; Harshit J. Motwani (Proc. ACM Program. Lang., 2023)

Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts. - Zhuo Cai 001; Soroush Farokhnia; Amir Kafshdar Goharshady; S. Hitarth (Proc. ACM Program. Lang., 2023)

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis. - Giovanna Kobus Conrado; Amir Kafshdar Goharshady; Kerim Kochekov; Yun Chen Tsai; Ahmed Khaled Zaher (Proc. ACM Program. Lang., 2023)

The Bounded Pathwidth of Control-Flow Graphs. - Giovanna Kobus Conrado; Amir Kafshdar Goharshady; Chun Kit Lam (Proc. ACM Program. Lang., 2023)

PYRAMID: A Protocol for Private and Trustless Multi-level Marketing on the Blockchain. - Giovanna Kobus Conrado; Amir Kafshdar Goharshady; Kha Nhat Long Nguyen (BCCA, 2024)

Pixiu: Optimal Block Production Revenues on Cardano. - Togzhan Barakbayeva; Soroush Farokhnia; Amir Kafshdar Goharshady; Markus Gufler; Sergei Novozhilov (Blockchain, 2024)

Options and Futures Imperil Bitcoin's Security. - Soroush Farokhnia; Amir Kafshdar Goharshady (Blockchain, 2024)

Blind Vote: Economical and Secret Blockchain-Based Voting. - Amir Kafshdar Goharshady; Zhaorun Lin (Blockchain, 2024)

Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic. - S. Akshay 001; Supratik Chakraborty; Amir Kafshdar Goharshady; R. Govind 001; Harshit J. Motwani; Sai Teja Varanasi (FM (1), 2024)

Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady; Mehrdad Karrabi; Dorde Zikelic (FM (1), 2024)

Gas-Efficient Decentralized Random Beacons. - V. P. Abidha; Togzhan Barakbayeva; Zhuo Cai 001; Amir Kafshdar Goharshady (ICBC, 2024)

Congesting Ethereum after EIP-1559. - Kianoush Arshi; Amir Kafshdar Goharshady (ICBC, 2024)

SRNG: An Efficient Decentralized Approach for Secret Random Number Generation. - Togzhan Barakbayeva; Zhuo Cai 001; Amir Kafshdar Goharshady (ICBC, 2024)

Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. - S. Akshay 001; Supratik Chakraborty; Amir Kafshdar Goharshady; R. Govind 001; Harshit J. Motwani; Sai Teja Varanasi (LPAR, 2024)

Faster Lifetime-Optimal Speculative Partial Redundancy Elimination for Goto-Free Programs. - Xuran Cai; Amir Kafshdar Goharshady (SETTA, 2024)

Faster Treewidth-Based Approximations for Wiener Index. - Giovanna Kobus Conrado; Amir Kafshdar Goharshady; Pavel Hudec; Pingjiang Li; Harshit J. Motwani (SEA, 2024)

PolyHorn: A Polynomial Horn Clause Solver. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady; Mehrdad Karrabi; Milad Saadat; Dorde Zikelic (CoRR, 2024)

Quantitative Bounds on Resource Usage of Probabilistic Programs. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Tobias Meggendorfer; Dorde Zikelic (Proc. ACM Program. Lang., 2024)

Fast and Optimal Extraction for Sparse Equality Graphs. - Amir Kafshdar Goharshady; Chun Kit Lam; Lionel Parreaux (Proc. ACM Program. Lang., 2024)

Faster Chaitin-like Register Allocation via Grammatical Decompositions of Control-Flow Graphs. - Xuran Cai; Amir Kafshdar Goharshady; S. Hitarth; Chun Kit Lam (ASPLOS (1), 2025)

Efficient Synthesis of Tight Polynomial Upper-Bounds for Systems of Conditional Polynomial Recurrences. - Amir Kafshdar Goharshady; S. Hitarth; Sergei Novozhilov (ESOP (2), 2025)

Improved Gas Optimization of Smart Contracts. - Togzhan Barakbayeva; Soroush Farokhnia; Amir Kafshdar Goharshady; Pingjiang Li; Zhaorun Lin (FSEN, 2025)

Brief Announcement: Fast and Gas-efficient Private Sealed-bid Auctions. - Jonas Ballweg; Amir Kafshdar Goharshady; Zhaorun Lin (PODC, 2025)

Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners. - Mohsen Alambardar Meybodi; Amir Kafshdar Goharshady; Mohammad Reza Hooshmandasl; Ali Shakiba (J. Comb. Optim., 2025)