معرفی
Gert Smolka is a Professor of Computer Science at Saarland University, affiliated with the Saarland Informatics Campus. His research lies at the intersection of programming languages, computational logic, and formal verification, with a strong focus on type theory and interactive theorem proving using the Coq proof assistant.
His research interests include:
- Computational Logic
- Interactive Theorem Proving
- Type Theory
- Programming Languages
- Formal Verification
- Automated Reasoning
His recent publications (2017–2023) demonstrate a sustained focus on formalizing foundational mathematical and computational concepts in Coq. Key themes include:
- Synthetic undecidability and mechanized incompleteness proofs
- Formalization of lambda calculi and their semantics
- Constructive set theory and model theory in dependent type theory
- Automata and logic, including Büchi automata and S1S
- Compiler and machine verification
- Decision procedures for modal and hybrid logics
He has received no explicitly mentioned scientific awards in the provided text, but his long-standing contributions to the field are evident through extensive publication in top venues such as CPP, ITP, POPL, and JAR.
He has advised or collaborated closely with several doctoral students and researchers, including Yannick Forster, Dominik Kirst, Christian Doczkal, and Mark Kaminski. His work often involves deep formalization projects in Coq, contributing to the foundations of programming language theory and mathematical logic.
He is associated with the Programming Systems Lab at Saarland University, where he leads research in programming language theory and formal methods.
