Joe LeslieHurd

Home * People * Joe Leslie-Hurd

Joe Leslie-Hurd [1] Joe Leslie-Hurd,

a British computer scientist and formal verification engineer at Intel Corporation, Portland, Oregon. He holds a Ph.D. in CS from University of Cambridge in 2003 on formal verification of probabilistic algorithms [2]. As a chess player, he enjoys solving chess problems, studies, and retrograde analysis [3], and formalized chess in Higher Order Logic (HOL) to construct formally verified endgame databases [4]. Joe Leslie-Hurd is further author of the open source Go playing program Gomi, written in Standard ML [5], and the chess diagram tool fen2img, which reads FEN to output diagrams in portable pixmap format (PPM) image format, also written in SML [6] [7].

Joe Hurd (2000). Congruence Classes with Logic Variables. ARW 2000
Joe Hurd (2001). Congruence Classes with Logic Variables. ogic Journal of the IGPL, Vol. 9, No. 1, pdf
Joe Hurd (2003). Formal verification of probabilistic algorithms. Ph.D. thesis, UCAM-CL-TR-566, University of Cambridge, pdf
Joe Hurd (2005). Formal Verification of Chess Endgame Databases. Technical Report PRG-RR-05-02, Oxford University Computing Laboratory, pdf

Joe Hurd, Guy Haworth (2010). Data Assurance in Opaque Computations. Advances in Computer Games 12, pdf
Ramana Kumar, Joe Hurd (2012). Standalone Tactics Using OpenTheory. ITP 2012, pdf [10]
Iago Abal, Alcino Cunha, Joe Hurd, Jorge Sousa Pinto (2012). Using Term Rewriting to Solve Bit-Vector Arithmetic Problems. SAT 2012
Joe Leslie-Hurd (2013). Formally Verified Endgame Tables. Guest Lecture, Combinatorial Games, Portland State University, slides as pdf
Joe Leslie-Hurd, Guy Haworth (2013). Computer Theorem Proving and HoTT. ICGA Journal, Vol. 36, No. 2 [11]

External Links