Paul Downen - RankMe

34 papers A* 1A 6B 2C 3Misc 1Journal 16Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Proving and Computing: The Infinite Pigeonhole Principle and Countable Choice. CoRR Zena M. Ariola, Paul Downen, Hugo Herbelin
2025	J	`jnl`	A contextual formalization of structural coinduction. J. Funct. Program. Paul Downen, Zena M. Ariola
2025	—	`conf`	CoScheme: Compositional Copatterns in Scheme. TFP Paul Downen, Adriano Corbelino II
2025	J	`jnl`	Controlling Copatterns: There and Back Again (Extended Version). CoRR Paul Downen
2024	J	`jnl`	Call-by-Unboxed-Value. Proc. ACM Program. Lang. Paul Downen
2023	J	`jnl`	Classical (co)recursion: Mechanics. J. Funct. Program. Paul Downen, Zena M. Ariola
2023	C	`conf`	Closure Conversion in Little Pieces. PPDP Zachary J. Sullivan, Paul Downen, Zena M. Ariola
2022	J	`jnl`	Introduction and elimination, left and right. Proc. ACM Program. Lang. Klaus Ostermann, David Binder, Ingo Skupin, Tim Süberkrüb, Paul Downen
2021	J	`jnl`	Classical (Co)Recursion: Mechanics. CoRR Paul Downen, Zena M. Ariola
2021	J	`jnl`	Classical (Co)Recursion: Programming. CoRR Paul Downen, Zena M. Ariola
2021	B	`conf`	Duality in Action (Invited Talk). FSCD Paul Downen, Zena M. Ariola
2021	—	`conf`	Strictly capturing non-strict closures. PEPM@POPL Zachary J. Sullivan, Paul Downen, Zena M. Ariola
2020	C	`conf`	A Computational Understanding of Classical (Co)Recursion. PPDP Paul Downen, Zena M. Ariola
2020	J	`jnl`	Abstracting models of strong normalization for classical calculi. J. Log. Algebraic Methods Program. Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2020	J	`jnl`	Compiling With Classical Connectives. Log. Methods Comput. Sci. Paul Downen, Zena M. Ariola
2020	J	`jnl`	Kinds are calling conventions. Proc. ACM Program. Lang. Paul Downen, Zena M. Ariola, Simon Peyton Jones, Richard A. Eisenberg
2019	A	`conf`	Codata in Action. ESOP Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones
2019	J	`jnl`	Compiling With Classical Connectives. CoRR Paul Downen, Zena M. Ariola
2019	—	`conf`	Making a faster Curry with extensional types. Haskell@ICFP Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones
2019	J	`jnl`	The Duality of Classical Intersection and Union Types. Fundam. Informaticae Paul Downen, Zena M. Ariola, Silvia Ghilezan
2018	J	`jnl`	A tutorial on computational classical logic and the sequent calculus. J. Funct. Program. Paul Downen, Zena M. Ariola
2018	B	`conf`	Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing. CSL Paul Downen, Zena M. Ariola
2018	—	`conf`	Uniform Strong Normalization for Multi-discipline Calculi. WRLA Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2017	J	`jnl`	Call-by-name extensionality and confluence. J. Funct. Program. Philip Johnson-Freyd, Paul Downen, Zena M. Ariola
2017	A*	`conf`	Compiling without continuations. PLDI Luke Maurer, Paul Downen, Zena M. Ariola, Simon L. Peyton Jones
2016	A	`conf`	Sequent calculus as a compiler intermediate language. ICFP Paul Downen, Luke Maurer, Zena M. Ariola, Simon Peyton Jones
2015	—	`conf`	First Class Call Stacks: Exploring Head Reduction. WoC Philip Johnson-Freyd, Paul Downen, Zena M. Ariola
2015	A	`conf`	Structures for structural recursion. ICFP Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2014	A	`conf`	Compositional semantics for composable continuations: from abortive to delimited control. ICFP Paul Downen, Zena M. Ariola
2014	C	`conf`	Continuations, Processes, and Sharing. PPDP Paul Downen, Luke Maurer, Zena M. Ariola, Daniele Varacca
2014	J	`jnl`	Delimited control and computational effects. J. Funct. Program. Paul Downen, Zena M. Ariola
2014	A	`conf`	The Duality of Construction. ESOP Paul Downen, Zena M. Ariola
2012	A	`conf`	A Systematic Approach to Delimited Control with Multiple Prompts. ESOP Paul Downen, Zena M. Ariola
2012	Misc	`conf`	Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin

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.