Join us in welcoming Professor Caleb Stanford to GGAM!
Caleb Stanford is an assistant professor in the computer science department. His research applies techniques from programming languages and formal methods, including applied mathematical logic and program verification, to improve the design, tool support, and reliability of real-world software systems.
His current work centers around three application areas: securing the Rust programming language, program verification using regular expressions, and verifying dataflow programs that run in the cloud. Caleb graduated with his PhD from the University of Pennsylvania in August 2022, and spent one year at UC San Diego as a postdoctoral researcher before joining UC Davis in 2023.
We are thrilled to be adding another brilliant mind to GGAM!
*Details for the research illustration below: Title: Regular expression derivatives Caption: A Boolean finite automaton constructed using derivatives of regular expressions for the regular expression `.*01.*`. Website link: https://web.cs.ucdavis.edu/~cdstanford/doc/2021/PLDI21.pdf
