Leroy Chew

Dr. Leroy Chew is a Research Fellow at the Institute of Logic and Computation at Technische Universität Wien. He specializes in theoretical computer science with focus areas in proof complexity, quantified Boolean formulas (QBF), and SAT solving. His educational background includes a PhD from the University of Leeds and postdoctoral research at Carnegie Mellon University.

Dr. Chew's research explores the boundaries of computational complexity and formal verification systems. His current projects include developing novel proof systems for quantified formulas and expansion-based approaches for constraint satisfaction problems. He leads research funded by the ESPRIT Grant on QBF Proofs and Certificates.

His publication record demonstrates consistent contributions to formal verification and computational logic, with recent advances in strategy extraction techniques and dual proof systems. He maintains academic collaborations across Europe and the United States, and has served on program committees for major conferences including SAT and QBF Workshops.

Dr. Chew has received the EPSRC Postdoctoral Prize Research Fellowship and continues to develop computational tools for the research community, including proof generators and strategy extraction software.