Daniel Găină


Associate professor

Contact

Research interests

My primary research interest lies in universal logic, which aims to develop general frameworks for constructing and reasoning about a wide variety of logical systems. Within this paradigm, I focus on institution model theory, a category-based formalization of the informal notion of logical systems, which includes signatures, sentences, models, and satisfaction relations. By leveraging the expressive power of category theory, institution model theory provides a unified and abstract treatment of logic, enabling systematic comparison, integration, and interoperability among diverse logical systems.

Post-graduation work

Following my graduation, I contributed to the design of CafeOBJ, an algebraic specification language developed at the Japan Advanced Institute of Science and Technology with substantial support from the Japanese government. A central goal of this work was to establish a rigorous logical foundation for proof scores, a formal method that supports both the specification of software systems and their structured, interactive verification.

Tool development

Building on this foundation, I designed the Constructor-based Inductive Theorem Prover (CITP) , which supports inductive reasoning over algebraic specifications within an institutional framework. To enhance the logical expressiveness of CITP, I introduced transition algebra — a many-sorted first-order logic extended with dynamic logic features, including state transitions, their composition, union, and reflexive-transitive closure.

Recent work

Area of study

Other profiles

Journal papers

  1. Adrián Riesco, Kazuhiro Ogata, Masaki Nakamura, Daniel Găină, Duong Dinh Tran and Kokichi Futatsugi,
    Proof Scores: A Survey,
    ACM Computing Surveys, 2025 (pdf)
  2. Guillermo Badia, Daniel Găină, Alexander Knapp, Tomasz Kowalski and Martin Wirsing,
    Hybrid-Dynamic Ehrenfeucht–Fraïssé Games,
    ACM Transactions on Computational Logic, 2025 (pdf)
  3. Guillermo Badia, Daniel Găină, Alexander Knapp, Tomasz Kowalski and Martin Wirsing,
    A modular bisimulation characterisation for fragments of hybrid logic,
    The Bulletin of Symbolic Logic, 2025 (pdf)
  4. Daniel Găină, Guillermo Badia and Tomasz Kowalski,
    Omitting Types Theorem in hybrid dynamic first-order logic with rigid symbols,
    Annals of Pure and Applied Logic, vol. 174, issue 3, pp. 1–41, 2023 (pdf)
  5. Daniel Găină and Tomasz Kowalski,
    Lindström’s theorem, both syntax and semantics free,
    Journal of Logic and Computation, vol. 32, issue 5, pp. 942–975, July 2022, (pdf)
  6. Daniel Găină,
    Forcing and Calculi for Hybrid Logics,
    Journal of the ACM, vol. 67, issue 4, pp. 1-55, 2020 (pdf)
  7. Daniel Găină, Masaki Nakamura, Kazuhiro Ogata and Kokichi Futatsugi,
    Stability of termination and sufficient-completeness under pushouts via amalgamation ,
    Theoretical Computer Science, vol. 848, pp. 82-105, 2020 (pdf)
  8. Daniel Găină and Tomasz Kowalski,
    Fraïssé-Hintikka Theorem in institutions,
    Journal of Logic and Computation, vol. 30, issue 7, pp. 1377-1399, 2020 (pdf)
  9. Daniel Găină,
    Birkhoff Style Calculi for Hybrid Logics,
    Formal Aspects of Computing, vol. 29, issue 5, pp. 805-832, 2017 (pdf)
  10. Daniel Găină,
    Downward Löwenheim-Skolem Theorem and interpolation in logics with constructors,
    Journal of Logic and Computation, vol. 27, issue 6, pp.1717-1752, 2017 (pdf)
  11. Daniel Găină,
    Foundations of logic programming in hybrid logics with user-defined sharing,
    Theoretical Computer Science, vol. 686, pp. 1-24, 2017 (pdf)
  12. Daniel Găină and Kokichi Futatsugi,
    Initial semantics in logics with constructors,
    Journal of Logic and Computation, vol. 25, issue 1, pp. 95-116, 2015 (pdf)
  13. Daniel Găină,
    Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, institutionally,
    Logica Universalis, vol. 8, issue 3-4, pp. 469-498, 2014 (pdf)
  14. Daniel Găină,
    Interpolation in logics with constructors,
    Theoretical Computer Science, vol. 474, pp. 46-59, 2013 (pdf)
  15. Daniel Găină, Kokichi Futatsugi and Kazuhiro Ogata,
    Constructor-based Logics,
    Journal of Universal Computer Science, vol. 18, issue 16, pp. 2204-2233, 2012 (pdf)
  16. Kokichi Futatsugi, Daniel Găină and Kazuhiro Ogata,
    Principles of proof scores in CafeOBJ,
    Theoretical Computer Science, vol. 464, pp. 90-112, 2012
  17. Daniel Găină and Marius Petria,
    Completeness by Forcing,
    Journal of Logic and Computation, vol. 20, issue 6, pp. 1165-1186, 2010 (pdf)
  18. Mihai Codescu and Daniel Găină,
    Birkhoff Completeness in Institutions,
    Logica Universalis, vol. 2, issue 2, pp. 277-309, 2008 (pdf)
  19. Daniel Găină and Andrei Popescu,
    An Institution-Independent Proof of the Robinson Consistency Theorem,
    Studia Logica, vol. 85, issue 1, pp. 41-73, 2007
  20. Daniel Găină and Andrei Popescu,
    An Institution-independent Generalization of Tarski's Elementary Chain Theorem,
    Journal of Logic and Computation, vol. 16, issue 6, pp. 713-735, 2006 (pdf)

Conference papers

  1. Go Hashimoto and Daniel Găină,
    Model-theoretic Forcing in Transition Algebra ,
    In Proceedings of Mathematical Foundations of Computer Science (MFCS 2025), Warsaw, Poland, 25-29 August, 2025 (pdf)
  2. Daniel Găină,
    Birkhoff style proof systems for hybrid-dynamic quantum logic ,
    In Proceedings of Advances in Modal Logic (AiML 2024), Prague, The Czech Republic, 19–23 August, 2024 (pdf)
  3. Go Hashimoto, Daniel Găină and Ionut Tutu
    Forcing, Transition Algebras, and Calculi ,
    In Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024), Tallinn, Estonia, 8-13 July 2024 (pdf)
  4. Daniel Găină, Guillermo Badia and Tomasz Kowalski,
    Robinson consistency in many-sorted hybrid first-order logics ,
    In Proceedings of Advances in Modal Logic (AiML 2022), Rennes, 22-25 August, 2022 (pdf)
  5. Daniel Găină and Ionut Tutu,
    Birkhoff Completeness for Hybrid-Dynamic First-Order Logic ,
    In Proceedings of 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2019), London, UK, September 3-5, 2019 (pdf)
  6. Daniel Găină, Ionut Tutu and Adrian Riesco,
    Specification and Verification of Invariant Properties of Transition Systems ,
    In Proceedings of 25th Asia-Pacific Software Engineering Conference (APSEC 2018), Nara, Japan, December 4-7, 2018 (pdf)
  7. Daniel Găină,
    Foundations of Logic Programming in Hybridised Logics ,
    22nd International Workshop on Algebraic Development Techniques (WADT 2014), Sinaia, Romania, September 4-7, 2014 (pdf)
  8. Daniel Găină, Dorel Lucanu, Kazuhiro Ogata and Kokichi Futatsugi,
    On Automation of OTS/CafeOBJ Method ,
    in Proceedings of SAS 2014, Kanazawa, Japan, April 14-16, 2014
  9. Daniel Găină, Zhang Min, Yuki Chiba and Yasuhito Arimoto,
    Constructor-based Inductive Theorem Prover,
    In Proceedings of 5th International Conference on Algebra and Coalgebra in Computer Science (CALCO 2013), Warsaw, Poland, September 3-6, 2013
  10. Daniel Găină, Kokichi Futatsugi and Kazuhiro Ogata,
    Constructor-Based Institutions ,
    In Proceedings of the 3rd International Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), Udine, Italy, September 7-10, 2009