Ramana Nagasamudram

13 papers A* 1Journal 10Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Alignment complete relational Hoare logics for some and all. Log. Methods Comput. Sci. Ramana Nagasamudram, Anindya Banerjee, David A. Naumann
2025	J	`jnl`	Forall-Exists Relational Verification by Filtering to Forall-Forall. CoRR Ramana Nagasamudram, Anindya Banerjee, David A. Naumann
2024	—	`conf`	Verifying a C Implementation of Derecho's Coordination Mechanism Using VST and Coq. NFM Ramana Nagasamudram, Lennart Beringer, Ken Birman, Mae Milano, David A. Naumann
2023	J	`jnl`	Alignment complete relational Hoare logics for some and all. CoRR Ramana Nagasamudram, Anindya Banerjee, David A. Naumann
2023	J	`jnl`	An Algebra of Alignment for Relational Verification. Proc. ACM Program. Lang. Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo
2023	—	`conf`	The WhyRel Prototype for Modular Relational Verification of Pointer Programs. TACAS (2) Ramana Nagasamudram, Anindya Banerjee, David A. Naumann
2023	J	`jnl`	The WhyRel Prototype for Relational Verification. CoRR Ramana Nagasamudram, Anindya Banerjee, David A. Naumann
2022	J	`jnl`	A Relational Program Logic with Data Abstraction and Dynamic Framing. ACM Trans. Program. Lang. Syst. Anindya Banerjee, Ramana Nagasamudram, David A. Naumann, Mohammad Nikouei
2022	J	`jnl`	An algebra of alignment for relational verification. CoRR Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo
2022	J	`jnl`	Making Relational Hoare Logic Alignment Complete. CoRR Anindya Banerjee, Ramana Nagasamudram, David A. Naumann
2021	A*	`conf`	Alignment Completeness for Relational Hoare Logics. LICS Ramana Nagasamudram, David A. Naumann
2021	J	`jnl`	Alignment Completeness for Relational Hoare Logics. CoRR Ramana Nagasamudram, David A. Naumann
2019	J	`jnl`	Data Abstraction and Relational Program Logic. CoRR Anindya Banerjee, Ramana Nagasamudram, David A. Naumann, Mohammad Nikouei

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.