Summary
Anthony Lin is a Max-Planck Fellow and professor based in Kaiserslautern with a decade-long track record in formal verification, automated reasoning, and programming languages. He develops SMT techniques for strings and sequences, explainable machine learning over sequential data, and constraint models for graph databases, bridging deep theory with practical verification tools. His research history spans leading EPSRC-funded projects, discovering real-world vulnerabilities, and settling complexity questions in verification—work that has been published and implemented in tools showcased to industry. Comfortable in both academic and applied settings, he combines rigorous theory (PhD in Informatics) with systems-building experience in C++, Prolog, and solver integrations. An intriguing throughline in his career is applying automata- and transducer-based methods to make infinite-state and numeric program analysis tractable and explainable.
10 years of coding experience
9 years of employment as a software developer
PhD, Informatics, PhD, Informatics at University of Edinburgh
Master of Science, Computer Science, Master of Science, Computer Science at University of Toronto
The University of Melbourne
Chinese, Indonesian, English, German