(852) 2358 8339
Formal Verification; Static Program Analysis; Parameterized Algorithms and Complexity; Probabilistic Programs; Blockchain
Amir Goharshady's research is in mathematical and algorithmic aspects of program verification and formal methods. He is especially focused on parameterized algorithms, analysis of probabilistic programs, and quantitative security verification of blockchain protocols and smart contracts.
Amir has been a recipient of various research awards, including a Hong Kong RGC Early-Career Grant, an HKUST-Kaisa Joint Research Institute Grant, International Congress of Mathematicians' Kovalevskaya Grant, fellowships from Facebook, IBM, the Austrian Academy of Sciences, and the Royal Commission for the Exhibition of 1851, as well as IST Austria's Best PhD Dissertation Award, the Best PhD Thesis Award of the European Association for Programming Languages and Systems (EAPLS), two IEEE Computer Society Lance Stafford Larson Best Paper Awards and the Iranian Presidential Research Award (Khwarizmi Prize).
Amir leads one of the most diverse and international research groups in Hong Kong. See https://amir.goharshady.com/ for more information.