Joe Hurd (2005). Formal Verification of Chess Endgame Databases. in Joe Hurd, Edward Smith, Ashish DarbariTheorem proving in higher order logics: Emerging trends proceedings. Technical Report PRG-RR-05-02, Oxford University Computing Laboratory, pdf
^Joe Hurd (2005). Formal Verification of Chess Endgame Databases. in Joe Hurd, Edward Smith, Ashish DarbariTheorem proving in higher order logics: Emerging trends proceedings. Technical Report PRG-RR-05-02, Oxford University Computing Laboratory, pdf
a British computer scientist, Ph.D. in CS from University of Cambridge in 2003 on formal verification of probabilistic algorithms [1], and component design engineer at Intel Corporation, Portland, Oregon. As a chess player, he enjoys solving chess problems, studies, and retrograde analysis [2], and formalized chess in Higher Order Logic (HOL) to construct formally verified endgame databases [3]. Joe Leslie-Hurd is further author of the open source Go playing program Gomi, written in Standard ML [4], and the chess diagram maker fen2img, which reads FEN to output diagrams in portable pixmap format (PPM) image format, also written in SML [5] [6].
Table of Contents
Selected Publications
[8] [9]External Links
References
What links here?
Up one level