Daniel GAINA
Scholar

Daniel GAINA

Google Scholar ID: 352kUN0AAAAJ
Institute of Mathematics for Industry, Kyushu University
LogicFormal MethodsCategory Theory
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
201
 
H-index
10
 
i10-index
10
 
Publications
20
 
Co-authors
0
 
Contact
Emaildaniel@imi.kyushu-u.ac.jpCVOpen ↗GitHubOpen ↗
Resume
Academic Achievements
  • Published 'Proof Scores: A Survey' in ACM Computing Surveys (2025).
  • Published 'Hybrid-Dynamic Ehrenfeucht–Fraïssé Games' in ACM Transactions on Computational Logic (2025).
  • Published 'A modular bisimulation characterisation for fragments of hybrid logic' in The Bulletin of Symbolic Logic (2025).
  • Published 'Omitting Types Theorem in hybrid dynamic first-order logic with rigid symbols' in Annals of Pure and Applied Logic (2023).
  • Published 'Lindström’s theorem, both syntax and semantics free' in Journal of Logic and Computation (2022).
  • Published 'Forcing and Calculi for Hybrid Logics' in Journal of the ACM (2020).
  • Published 'Stability of termination and sufficient-completeness under pushouts via amalgamation' in Theoretical Computer Science (2020).
  • Published 'Fraïssé-Hintikka Theorem in institutions' in Journal of Logic and Computation (2020).
Research Experience
  • Contributed to the design of CafeOBJ, an algebraic specification language developed at JAIST with strong Japanese government support.
  • Worked on establishing a rigorous logical foundation for proof scores, a method for specifying and interactively verifying software systems.
  • Designed the Constructor-based Inductive Theorem Prover (CITP) supporting inductive reasoning over algebraic specifications within an institutional framework.
  • Introduced transition algebra—a many-sorted first-order logic extended with dynamic logic features such as state transitions, composition, union, and reflexive-transitive closure.
  • Recently extended transition algebra to hybrid systems combining discrete and continuous dynamics, adapting both syntax and semantics.
  • Applied institution-based theory to quantum computing, developing a proof system for a hybrid-dynamic logic of quantum clauses and proving a Birkhoff-style completeness theorem.