Tatsuji Kawai - RankMe

33 papers B 2Journal 30Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Predicative presentations of stably locally compact locales. Theor. Comput. Sci. Tatsuji Kawai
2025	—	`conf`	Modeling Language for Scenario Development of Autonomous Driving Systems. FormaliSE Toshiaki Aoki, Takashi Tomita, Tatsuji Kawai, Daisuke Kawakami, Nobuo Chida
2025	J	`jnl`	Modeling Language for Scenario Development of Autonomous Driving Systems. CoRR Toshiaki Aoki, Takashi Tomita, Tatsuji Kawai, Daisuke Kawakami, Nobuo Chida
2023	J	`jnl`	Coding of real-valued continuous functions under WKL $\mathsf {WKL}$. Math. Log. Q. Tatsuji Kawai
2023	J	`jnl`	Reflexive combinatory algebras. J. Log. Comput. Marlou M. Gijzen, Hajime Ishihara, Tatsuji Kawai
2023	B	`conf`	Specification Based Testing of Object Detection for Automated Driving Systems via BBSL. ENASE Kento Tanaka, Toshiaki Aoki, Tatsuji Kawai, Takashi Tomita, Daisuke Kawakami, Nobuo Chida
2022	B	`conf`	A Formal Specification Language Based on Positional Relationship Between Objects in Automated Driving Systems. COMPSAC Kento Tanaka, Toshiaki Aoki, Tatsuji Kawai, Takashi Tomita, Daisuke Kawakami, Nobuo Chida
2021	J	`jnl`	Algebraic combinatory models. CoRR Marlou M. Gijzen, Hajime Ishihara, Tatsuji Kawai
2021	J	`jnl`	Characterising Brouwer's continuity by bar recursion on moduli of continuity. Arch. Math. Log. Makoto Fujiwara, Tatsuji Kawai
2021	J	`jnl`	Decidable fan theorem and uniform continuity theorem with continuous moduli. Math. Log. Q. Makoto Fujiwara, Tatsuji Kawai
2021	J	`jnl`	Factorizing the $\mathbf {Top}$-$\mathbf {Loc}$ adjunction through positive topologies. Arch. Math. Log. Francesco Ciraulo, Tatsuji Kawai, Samuele Maschio
2021	J	`jnl`	Predicative theories of continuous lattices. Log. Methods Comput. Sci. Tatsuji Kawai
2020	J	`jnl`	Predicative theories of continuous lattices. CoRR Tatsuji Kawai
2020	J	`jnl`	Presenting de Groot duality of stably compact spaces. Theor. Comput. Sci. Tatsuji Kawai
2019	J	`jnl`	A continuity principle equivalent to the monotone Π Arch. Math. Log. Tatsuji Kawai
2019	J	`jnl`	Equivalence of bar induction and bar recursion for continuous functions with continuous moduli. Ann. Pure Appl. Log. Makoto Fujiwara, Tatsuji Kawai
2019	J	`jnl`	Equivalents of the finitary non-deterministic inductive definitions. Ann. Pure Appl. Log. Ayana Hirata, Hajime Ishihara, Tatsuji Kawai, Takako Nemoto
2019	J	`jnl`	On the commutativity of the powerspace constructions. Log. Methods Comput. Sci. Matthew de Brecht, Tatsuji Kawai
2019	J	`jnl`	Principles of bar induction and continuity on Baire space. J. Log. Anal. Tatsuji Kawai
2019	J	`jnl`	Representing definable functions of HA Ann. Pure Appl. Log. Tatsuji Kawai
2019	J	`jnl`	The principle of pointfree continuity. Log. Methods Comput. Sci. Tatsuji Kawai, Giovanni Sambin
2018	J	`jnl`	Factorizing the Top-Loc adjunction through positive topologies. CoRR Francesco Ciraulo, Tatsuji Kawai, Samuele Maschio
2018	J	`jnl`	Formally continuous functions on Baire space. Math. Log. Q. Tatsuji Kawai
2018	J	`jnl`	Presenting de Groot duality of stably compact spaces. CoRR Tatsuji Kawai
2018	J	`jnl`	The principle of point-free continuity. CoRR Tatsuji Kawai, Giovanni Sambin
2017	J	`jnl`	A point-free characterisation of Bishop locally compact metric spaces. J. Log. Anal. Tatsuji Kawai
2017	J	`jnl`	Formally continuous functions on Baire space. CoRR Tatsuji Kawai
2017	J	`jnl`	Geometric theories of patch and Lawson topologies. CoRR Tatsuji Kawai
2017	J	`jnl`	Localic completion of uniform spaces. CoRR Tatsuji Kawai
2017	J	`jnl`	Localic completion of uniform spaces. Log. Methods Comput. Sci. Tatsuji Kawai
2017	J	`jnl`	On the commutativity of the powerspace constructions. CoRR Matthew de Brecht, Tatsuji Kawai
2017	J	`jnl`	Point-free characterisation of Bishop compact metric spaces. J. Log. Anal. Tatsuji Kawai
2015	J	`jnl`	Completeness and cocompleteness of the categories of basic pairs and concrete spaces. Math. Struct. Comput. Sci. Hajime Ishihara, Tatsuji Kawai

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.