معرفی
Carsten Fuhs is a Senior Lecturer at the School of Computing and Mathematical Sciences at Birkbeck, University of London. His research focuses on Program Analysis, Termination, Complexity Bounds, and Term Rewriting, with applications in Verification and SAT Encodings.
- Research Group Lead of the Logical Methods research group (2023–present)
- Member of the Board of Trustees for CADE (2023–present)
- Chair of the Bill McCune PhD Award Expert Committee (2024, 2025)
- Active in conference organization and program committees (FSCD, IJCAR, LOPSTR, etc.)
Research Interests:
Carsten Fuhs specializes in automated termination and complexity analysis for term rewriting and programming languages. His work leverages SAT solving and constraint-based methods to develop tools like AProVE for program verification. Key areas include parallel term rewriting, higher-order dependency pairs, and memory safety proofs.
Selected Publications Trends:
Recent articles emphasize higher-order rewriting (2025), parallel complexity analysis (2024), and modular termination proofs (2022–2024). Earlier work (2014–2017) explores pointer arithmetic verification, separation logic, and integer program complexity.
Scientific Awards:
- Best Paper Award, LOPSTR 2022
Teaching and Mentoring:
Carsten Fuhs has lectured on Java programming, compilers, and term rewriting at Birkbeck and international summer schools. He contributes to SAT competitions as a benchmark submitter and organizes regional programming language seminars like S-REPLS 10 (2018).
