Research on incremental decompilation of binary code, covering loop-free and loop-containing control flow structures, with applications to Erlang binary and source code. Theoretical investigation of programming language emulation-completeness and its implications for general decompilation. Development of methods for structuring arbitrary control flow graphs as abstract syntax trees.

Research on fully dynamic maintenance of graph properties in directed graphs, including strong connectivity, reachability, breadth-first search trees, spanning trees, and loop nesting forests in reducible flow graphs. The work focuses on efficient data structures and algorithms that update incrementally under edge insertions and deletions.

Research on the theoretical and practical aspects of self-modifying code, including Turing completeness, write-execute duality, and speculative execution (Spectre-class) considerations. Development of control flow obfuscation techniques using irreducible loops and self-modifying constructs. Investigation of tamper-proofing methods and static analysis for detecting security vulnerabilities.

Research on high-performance simulation and optimization of quantum circuits, with emphasis on data-flow engine (FPGA/Tensor Streaming Processor) acceleration for boson sampling simulation (PiquassoBoost) and unitary synthesis (SQUANDER). Development of efficient QUBO encodings for Boolean logic, SAT problems, and cryptographic constructions. Investigation of optimization strategies for variational quantum circuits, including batched line search methods for navigating barren plateaus.