Tutorial Presenters

Clark Barrett

Stanford University

Satisfiability Modulo Theories

Brief Bio

Clark Barrett is a Professor (Research) of Computer Science at Stanford University. Before coming to Stanford in 2016, he was an Associate Professor of Computer Science at the Courant Institute of Mathematical Sciences at New York University. His expertise is in automated reasoning and its applications. His PhD dissertation introduced a novel automated reasoning technique now known as Satisfiability Modulo Theories (SMT). His current work focuses on the development and application of automated reasoning techniques to improve reliability and security of software, hardware, and machine learning systems. He is the director of the Stanford Center for Automated Reasoning (Centaur) and co-director of the Stanford Center for AI Safety. He is an ACM Distinguished Scientist and a winner of the 2021 Computer Aided Verification (CAV) award.

Ciaran McCreesh

University of Glasgow

Practical Algorithms for Finding Small Graphs Inside Big Graphs

Brief Bio

Dr. Ciaran McCreesh is a Royal Academy of Engineering Research Fellow, working at the University of Glasgow. His research covers the design, implementation, and evaluation of practical algorithms for hard combinatorial problems, with a particular focus on providing correctness and reliability alongside high performance. He was awarded the Association for Constraint Programming Doctoral Research Award in 2018 for his PhD thesis on “Solving Hard Subgraph Problems in Parallel”, and the Early Career Research Award in 2023 in recognition of his recent research on proof logging.