Tachio Terauchi

62 papers A* 12A 10B 8Misc 1Journal 26Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Hardness of Regular Expression Matching with Extensions. CoRR Taisei Nogami, Tachio Terauchi
2025	A*	`conf`	A Secure Mocking Approach towards Software Supply Chain Security. ASE Daisuke Yamaguchi, Shinobu Saito, Takuya Iwatsuka, Nariyoshi Chida, Tachio Terauchi
2025	B	`conf`	Efficient Matching of Some Fundamental Regular Expressions with Backreferences. MFCS Taisei Nogami, Tachio Terauchi
2025	J	`jnl`	Efficient Matching of Some Fundamental Regular Expressions with Backreferences. CoRR Taisei Nogami, Tachio Terauchi
2025	J	`jnl`	Measuring the expressive power of practical regular expressions by classical stacking automata models. Inf. Comput. Taisei Nogami, Tachio Terauchi
2025	A	`conf`	On DoS Vulnerability of Regular Expressions, with and Without Backreferences. CSF Tachio Terauchi
2025	B	`conf`	Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers. APLAS Ryunosuke Endo, Tachio Terauchi
2025	J	`jnl`	Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers. CoRR Ryunosuke Endo, Tachio Terauchi
2024	J	`jnl`	Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers. Proc. ACM Program. Lang. Fuga Kawamata, Hiroshi Unno, Taro Sekiyama, Tachio Terauchi
2024	J	`jnl`	Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition. CoRR Taisei Nogami, Tachio Terauchi
2024	A*	`conf`	Repairing Regex-Dependent String Functions. ASE Nariyoshi Chida, Tachio Terauchi
2023	J	`jnl`	Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers. CoRR Fuga Kawamata, Hiroshi Unno, Taro Sekiyama, Tachio Terauchi
2023	J	`jnl`	Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification. Proc. ACM Program. Lang. Hiroshi Unno, Tachio Terauchi, Yu Gu, Eric Koskinen
2023	J	`jnl`	On Lookaheads in Regular Expressions with Backreferences. IEICE Trans. Inf. Syst. Nariyoshi Chida, Tachio Terauchi
2023	B	`conf`	On the Expressive Power of Regular Expressions with Backreferences. MFCS Taisei Nogami, Tachio Terauchi
2023	J	`jnl`	On the Expressive Power of Regular Expressions with Backreferences. CoRR Taisei Nogami, Tachio Terauchi
2023	J	`jnl`	Repairing Regular Expressions for Extraction. Proc. ACM Program. Lang. Nariyoshi Chida, Tachio Terauchi
2022	B	`conf`	On Lookaheads in Regular Expressions with Backreferences. FSCD Nariyoshi Chida, Tachio Terauchi
2022	A*	`conf`	Repairing DoS Vulnerability of Real-World Regexes. SP Nariyoshi Chida, Tachio Terauchi
2021	—	`conf`	Constraint-Based Relational Verification. CAV (1) Hiroshi Unno, Tachio Terauchi, Eric Koskinen
2021	J	`jnl`	Constraint-based Relational Verification. CoRR Hiroshi Unno, Tachio Terauchi, Eric Koskinen
2020	J	`jnl`	Automatic Repair of Vulnerable Regular Expressions. CoRR Nariyoshi Chida, Tachio Terauchi
2020	J	`jnl`	Bucketing and information flow analysis for provable timing attack mitigation. J. Comput. Secur. Tachio Terauchi, Timos Antonopoulos
2020	J	`jnl`	Program Verification via Predicate Constraint Satisfiability Modulo Theories. CoRR Hiroshi Unno, Yuki Satake, Tachio Terauchi, Eric Koskinen
2019	—	`conf`	A Formal Analysis of Timing Channel Security via Bucketing. POST Tachio Terauchi, Timos Antonopoulos
2019	A	`conf`	Games for Security Under Adaptive Adversaries. CSF Timos Antonopoulos, Tachio Terauchi
2018	A*	`conf`	A Fixpoint Logic and Dependent Effects for Temporal Property Verification. LICS Yoji Nanjo, Hiroshi Unno, Eric Koskinen, Tachio Terauchi
2018	J	`jnl`	Intensional and extensional aspects of computation: From computability and complexity to program analysis and security (NII Shonan Meeting 2018-1). NII Shonan Meet. Rep. Roberto Giacobazzi, Dusko Pavlovic, Tachio Terauchi
2018	J	`jnl`	Relatively complete refinement type system for verification of higher-order non-deterministic programs. Proc. ACM Program. Lang. Hiroshi Unno, Yuki Satake, Tachio Terauchi
2017	—	`conf`	Compositional Synthesis of Leakage Resilient Programs. POST Arthur Blot, Masaki Yamamoto, Tachio Terauchi
2017	A*	`conf`	Decomposition instead of self-composition for proving the absence of timing channels. PLDI Timos Antonopoulos, Paul Gazzillo, Michael Hicks, Eric Koskinen, Tachio Terauchi, Shiyi Wei
2016	J	`jnl`	Compositional Synthesis of Leakage Resilient Programs. CoRR Arthur Blot, Masaki Yamamoto, Tachio Terauchi
2016	A*	`conf`	Temporal verification of higher-order functional programs. POPL Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno
2015	B	`conf`	Explaining the Effectiveness of Small Refinement Heuristics in Program Verification with CEGAR. SAS Tachio Terauchi
2015	A	`conf`	Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling. TACAS Hiroshi Unno, Tachio Terauchi
2015	J	`jnl`	Logic and Verification Methods in Security and Privacy (NII Shonan Meeting 2015-16). NII Shonan Meet. Rep. Marco Gaboardi, Vivek Nigam, Tachio Terauchi
2015	A	`conf`	Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement. ESOP Tachio Terauchi, Hiroshi Unno
2014	A	`conf`	Automatic Termination Verification for Higher-Order Functional Programs. ESOP Takuya Kuwahara, Tachio Terauchi, Hiroshi Unno, Naoki Kobayashi
2014	—	`conf`	Local temporal reasoning. CSL-LICS Eric Koskinen, Tachio Terauchi
2014	J	`jnl`	Quantitative information flow as safety and liveness hyperproperties. Theor. Comput. Sci. Hirotoshi Yasuoka, Tachio Terauchi
2013	A*	`conf`	Automating relatively complete verification of higher-order functional programs. POPL Hiroshi Unno, Tachio Terauchi, Naoki Kobayashi
2012	Misc	`conf`	Automated Verification of Higher-Order Functional Programs. FLOPS Tachio Terauchi
2012	—	`conf`	Quantitative Information Flow as Safety and Liveness Hyperproperties QAPL Hirotoshi Yasuoka, Tachio Terauchi
2011	J	`jnl`	On Bounding Problems of Quantitative Information Flow CoRR Hirotoshi Yasuoka, Tachio Terauchi
2011	J	`jnl`	On bounding problems of quantitative information flow. J. Comput. Secur. Hirotoshi Yasuoka, Tachio Terauchi
2010	A*	`conf`	Dependent types from counterexamples. POPL Tachio Terauchi
2010	A	`conf`	On Bounding Problems of Quantitative Information Flow. ESORICS Hirotoshi Yasuoka, Tachio Terauchi
2010	J	`jnl`	Quantitative Information Flow - Verification Hardness and Possibilities CoRR Hirotoshi Yasuoka, Tachio Terauchi
2010	A	`conf`	Quantitative Information Flow - Verification Hardness and Possibilities. CSF Hirotoshi Yasuoka, Tachio Terauchi
2009	B	`conf`	Polymorphic Fractional Capabilities. SAS Hirotoshi Yasuoka, Tachio Terauchi
2008	A	`conf`	A Type System for Observational Determinism. CSF Tachio Terauchi
2008	J	`jnl`	A capability calculus for concurrency and determinism. ACM Trans. Program. Lang. Syst. Tachio Terauchi, Alex Aiken
2008	A*	`conf`	Checking race freedom via linear programming. PLDI Tachio Terauchi
2008	A	`conf`	Inferring Channel Buffer Bounds Via Linear Programming. ESOP Tachio Terauchi, Adam Megacz
2008	J	`jnl`	Witnessing side effects. ACM Trans. Program. Lang. Syst. Tachio Terauchi, Alex Aiken
2006	B	`conf`	A Capability Calculus for Concurrency and Determinism. CONCUR Tachio Terauchi, Alex Aiken
2006	A*	`conf`	On Typability for Rank-2 Intersection Types with Polymorphic Recursion. LICS Tachio Terauchi, Alex Aiken
2005	B	`conf`	Secure Information Flow as a Safety Problem. SAS Tachio Terauchi, Alex Aiken
2005	A	`conf`	Witnessing side-effects. ICFP Tachio Terauchi, Alex Aiken
2003	A*	`conf`	Checking and inferring local non-aliasing. PLDI Alex Aiken, Jeffrey S. Foster, John Kodumal, Tachio Terauchi
2002	A*	`conf`	Flow-Sensitive Type Qualifiers. PLDI Jeffrey S. Foster, Tachio Terauchi, Alex Aiken
1999	J	`jnl`	Exploring MARS: developing indoor and outdoor user interfaces to a mobile augmented reality system. Comput. Graph. Tobias Höllerer, Steven Feiner, Tachio Terauchi, Gus Rashid, Drexel Hallaway

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.