Kafshdar Goharshady, Amir
110  Ergebnisse:
Personensuche X
?
1

Alleviating High Gas Costs by Secure and Trustless Off-chai..:

, In: Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing,
 
?
2

Quantitative Bounds on Resource Usage of Probabilistic Prog..:

Chatterjee, Krishnendu ; Goharshady, Amir Kafshdar ; Meggendorfer, Tobias.
Proceedings of the ACM on Programming Languages.  8 (2024)  OOPSLA1 - p. 362-391 , 2024
 
?
3

Asparagus: Automated Synthesis of Parametric Gas Upper-Boun..:

Cai, Zhuo ; Farokhnia, Soroush ; Goharshady, Amir Kafshdar.
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA2 - p. 882-911 , 2023
 
?
4

PureLottery: Fair Leader Election without Decentralized Ran..:

, In: 2023 IEEE International Conference on Blockchain (Blockchain),
 
?
5

Algebro-geometric Algorithms for Template-Based Synthesis o..:

Goharshady, Amir Kafshdar ; Hitarth, S. ; Mohammadi, Fatemeh.
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA1 - p. 727-756 , 2023
 
?
6

Trustless and Bias-resistant Game-theoretic Distributed Ran..:

, In: 2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC),
 
?
7

Efficient Interprocedural Data-Flow Analysis Using Treedept..:

, In: Lecture Notes in Computer Science; Verification, Model Checking, and Abstract Interpretation,
 
?
8

Reducing the Gas Usage of Ethereum Smart Contracts without ..:

, In: 2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC),
 
?
9

Exploiting the Sparseness of Control-Flow and Call Graphs f..:

Conrado, Giovanna Kobus ; Goharshady, Amir Kafshdar ; Kochekov, Kerim..
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA2 - p. 1993-2022 , 2023
 
?
10

The Bounded Pathwidth of Control-Flow Graphs:

Conrado, Giovanna Kobus ; Goharshady, Amir Kafshdar ; Lam, Chun Kit
Proceedings of the ACM on Programming Languages.  7 (2023)  OOPSLA2 - p. 292-317 , 2023
 
?
11

Automated Tail Bound Analysis for Probabilistic Recurrence ..:

, In: Computer Aided Verification; Lecture Notes in Computer Science,
 
?
 
?
13

Efficient approximations for cache-conscious data placement:

, In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation,
 
?
14

Sound and Complete Certificates for Quantitative Terminatio..:

, In: Computer Aided Verification; Lecture Notes in Computer Science,
 
?
15

Polynomial reachability witnesses via Stellensätze:

, In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation,
Asadi, Ali ; Chatterjee, Krishnendu ; Fu, Hongfei.. - p. 772-787 , 2021
 
1-15