ÂÜÀòÂÒÂ×

Brandon Moore completed his Ph.D. at UIUC, working with Grigore to develop formal verification techniques which require only a language definition to verify programs against specific implementations or versions of a programming language. He uses proof assistants like Coq, Isabelle and Agda, on a regular basis, and thinks that proofs by coinduction are beautiful and elegant. Before UIUC he worked at Yahoo! Inc. on latency-critical servers. Brandon received his B.S. in computer science and in mathematics at Caltech.