(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 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, two IEEE Computer Society Lance Stafford Larson Best Paper Awards and the Iranian Presidential Research Award (Khwarizmi Prize). He has also won a total of 14 Medals in National and International Mathematics and Computing Olympiads.
Starting in 2022, Amir will be recruiting several PhD students with a strong background in either theoretical computer science or mathematics, as evidenced by publications or competitive programming/olympiads performance, to join his research group.