Amir Kafshdar Goharshady

Orcid: 0000-0003-1702-6584

Affiliations:
  • Institute of Science and Technology Austria


According to our database1, Amir Kafshdar Goharshady authored at least 50 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs.
CoRR, 2024

2023
The Bounded Pathwidth of Control-Flow Graphs.
Proc. ACM Program. Lang., October, 2023

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis.
Proc. ACM Program. Lang., October, 2023

Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts.
Proc. ACM Program. Lang., October, 2023

Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs.
Proc. ACM Program. Lang., April, 2023

Parameterized Algorithms for Topological Indices in Chemistry.
CoRR, 2023

Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2023

Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023

Game-Theoretic Randomness for Proof-of-Stake.
Proceedings of the Mathematical Research for Blockchain Economy: 4th International Conference MARBLE 2023, 2023

Reducing the Gas Usage of Ethereum Smart Contracts without a Sidechain.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

Trustless and Bias-resistant Game-theoretic Distributed Randomness.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

Automated Tail Bound Analysis for Probabilistic Recurrence Relations.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

PureLottery: Fair Leader Election without Decentralized Random Number Generation.
Proceedings of the IEEE International Conference on Blockchain, 2023

Secure and Decentralized Generation of Secret Random Numbers on the Blockchain.
Proceedings of the Fifth International Conference on Blockchain Computing and Applications, 2023

2022
Template-based Program Synthesis using Stellensätze.
CoRR, 2022

Efficient approximations for cache-conscious data placement.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Algorithms and Hardness Results for Computing Cores of Markov Chains.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees.
Proceedings of the IEEE International Conference on Blockchain, 2022

2021
Quantitative analysis of assertion violations in probabilistic programs.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Polynomial reachability witnesses via Stellensätze.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Irrationality, Extortion, or Trusted Third-parties: Why it is Impossible to Buy and Sell Physical Goods Securely on the Blockchain.
Proceedings of the 2021 IEEE International Conference on Blockchain, 2021

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).
PhD thesis, 2020

An efficient algorithm for computing network reliability in small treewidth.
Reliab. Eng. Syst. Saf., 2020

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations.
CoRR, 2020

Inductive Reachability Witnesses.
CoRR, 2020

Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth.
CoRR, 2020

Polynomial invariant generation for non-deterministic recursive programs.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis.
Proceedings of the Programming Languages and Systems, 2020

Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.
ACM Trans. Program. Lang. Syst., 2019

Non-polynomial Worst-Case Analysis of Recursive Programs.
ACM Trans. Program. Lang. Syst., 2019

Modular verification for almost-sure termination of probabilistic programs.
Proc. ACM Program. Lang., 2019

Efficient parameterized algorithms for data packing.
Proc. ACM Program. Lang., 2019

Compositional Analysis for Almost-Sure Termination of Probabilistic Programs.
CoRR, 2019

Hybrid mining: exploiting blockchain's computational power for distributed problem solving.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

The treewidth of smart contracts.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

Cost analysis of nondeterministic probabilistic programs.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Probabilistic Smart Contracts: Secure Randomness on the Blockchain.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2019

2018
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
ACM Trans. Program. Lang. Syst., 2018

A note on belief structures and S-approximation spaces.
CoRR, 2018

Secure Credit Reporting on the Blockchain.
Proceedings of the IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, 2018

Computational Approaches for Stochastic Shortest Path on Succinct MDPs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Quantitative Analysis of Smart Contracts.
Proceedings of the Programming Languages and Systems, 2018

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth.
CoRR, 2017

JTDec: A Tool for Tree Decompositions in Soot.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2016
[1, 2]-sets and [1, 2]-total sets in trees with algorithms.
Discret. Appl. Math., 2016

A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces.
CoRR, 2016

Termination Analysis of Probabilistic Programs Through Positivstellensatz's.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016


  Loading...