Ehsan Kafshdar Goharshady

26 papers A* 5B 3Misc 1Journal 15Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Qualitative Analysis of ω-Regular Objectives on Robust MDPs. AAAI Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Ali Shafiee
2026	J	`jnl`	Strongly Polynomial Time Complexity of Policy Iteration for L CoRR Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Alipasha Montaseri, Carlo Pagano
2026	J	`jnl`	SuperDP: Differential Privacy Refutation via Supermartingales. CoRR Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Dorde Zikelic
2025	B	`conf`	PolyQEnt: A Polynomial Quantified Entailment Solver. ATVA Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Maximilian Seeliger, Dorde Zikelic
2025	J	`jnl`	Qualitative Analysis of ω-Regular Objectives on Robust MDPs. CoRR Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Ali Shafiee
2025	A*	`conf`	Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization. AAAI Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Harshit J. Motwani, Maximilian Seeliger, Dorde Zikelic
2025	—	`conf`	Refuting Equivalence in Probabilistic Programs with Conditioning. TACAS (2) Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic
2025	J	`jnl`	Refuting Equivalence in Probabilistic Programs with Conditioning. CoRR Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic
2024	B	`conf`	Bidding Games with Charging. CONCUR Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik
2024	J	`jnl`	Bidding Games with Charging. CoRR Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik
2024	J	`jnl`	Equivalence and Similarity Refutation for Probabilistic Programs. CoRR Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic
2024	J	`jnl`	Equivalence and Similarity Refutation for Probabilistic Programs. Proc. ACM Program. Lang. Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic
2024	J	`jnl`	PolyHorn: A Polynomial Horn Clause Solver. CoRR Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Dorde Zikelic
2024	J	`jnl`	Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization. CoRR Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Harshit J. Motwani, Maximilian Seeliger, Dorde Zikelic
2024	A*	`conf`	Solving Long-run Average Reward Robust MDPs via Stochastic Games. IJCAI Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic
2024	—	`conf`	Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. FM (1) Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic
2024	J	`jnl`	Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. CoRR Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic
2023	J	`jnl`	On Lexicographic Proof Rules for Probabilistic Termination. Formal Aspects Comput. Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic
2023	J	`jnl`	Solving Long-run Average Reward Robust MDPs via Stochastic Games. CoRR Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic
2021	B	`conf`	On Lexicographic Proof Rules for Probabilistic Termination. FM Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic
2021	J	`jnl`	On Lexicographic Proof Rules for Probabilistic Termination. CoRR Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic
2021	J	`jnl`	Proving Non-termination by Program Reversal. CoRR Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic
2021	A*	`conf`	Proving non-termination by program reversal. PLDI Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic
2020	A*	`conf`	Polynomial invariant generation for non-deterministic recursive programs. PLDI Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady
2019	J	`jnl`	Polynomial Invariant Generation for Non-deterministic Recursive Programs. CoRR Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady
2019	Misc	`conf`	The treewidth of smart contracts. SAC Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.