25,161
edits
Changes
Created page with "'''Home * People * Joe Leslie-Hurd''' FILE:joehurd.jpg|border|right|thumb|link=https://scholar.google.com/citations?user=iGScUhoAAAAJ&hl=en| Joe Leslie-H..."
'''[[Main Page|Home]] * [[People]] * Joe Leslie-Hurd'''
[[FILE:joehurd.jpg|border|right|thumb|link=https://scholar.google.com/citations?user=iGScUhoAAAAJ&hl=en| Joe Leslie-Hurd <ref>[https://scholar.google.com/citations?user=iGScUhoAAAAJ&hl=en Joe Leslie-Hurd - Google Scholar]</ref> ]]
'''Joe Leslie-Hurd''',<br/>
a British computer scientist and formal verification engineer at [[Intel|Intel Corporation]], [https://en.wikipedia.org/wiki/Portland,_Oregon Portland, Oregon]. He holds a Ph.D. in CS from [https://en.wikipedia.org/wiki/University_of_Cambridge University of Cambridge]
in 2003 on [https://en.wikipedia.org/wiki/Formal_verification formal verification] of [https://en.wikipedia.org/wiki/Randomized_algorithm probabilistic algorithms] <ref>[http://www.gilith.com/about/cv.html Joe Leslie-Hurd - CV]</ref>.
As a chess player, he enjoys solving chess problems, studies, and [[Retrograde Analysis|retrograde analysis]] <ref>[http://www.gilith.com/chess/ Gilith - Chess]</ref>,
and formalized chess in [https://en.wikipedia.org/wiki/Higher-order_logic Higher Order Logic (HOL)] to construct formally verified [[Endgame Tablebases|endgame databases]] <ref>[[Joe Leslie-Hurd|Joe Hurd]] ('''2005'''). ''Formal Verification of Chess Endgame Databases''. Technical Report PRG-RR-05-02, [http://de.wikipedia.org/wiki/University_of_Oxford Oxford University] Computing Laboratory, [http://www.gilith.com/research/papers/chess.pdf pdf]</ref>.
Joe Leslie-Hurd is further author of the open source [[Go]] playing program ''Gomi'', written in [https://en.wikipedia.org/wiki/Standard_ML Standard ML]
<ref>[http://www.gilith.com/software/gomi/ Gomi Go Player]</ref>, and the chess diagram tool ''fen2img'', which reads [[Forsyth-Edwards Notation|FEN]] to output diagrams in [https://en.wikipedia.org/wiki/Netpbm_format portable pixmap format (PPM)] image format, also written in SML
<ref>[http://www.gilith.com/software/fen2img/ fen2img Chess Diagram Maker]</ref> <ref>[http://www.gilith.com/chess/diagrams/ Gilith - Chess Diagram Maker]</ref>.
__FORCETOC__
=Selected Publications=
<ref>[http://www.gilith.com/research/papers/ Gilith - Research Papers]</ref> <ref>[https://dblp.uni-trier.de/pid/29/4239.html dblp: Joe Hurd]</ref>
* [[Joe Leslie-Hurd|Joe Hurd]] ('''2003'''). ''Formal verification of probabilistic algorithms''. Ph.D. thesis, UCAM-CL-TR-566, [https://en.wikipedia.org/wiki/University_of_Cambridge University of Cambridge], [https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-566.pdf pdf]
* [[Joe Leslie-Hurd|Joe Hurd]] ('''2005'''). ''Formal Verification of Chess Endgame Databases''. Technical Report PRG-RR-05-02, [http://de.wikipedia.org/wiki/University_of_Oxford Oxford University] Computing Laboratory, [http://www.gilith.com/research/papers/chess.pdf pdf]
* [[Joe Leslie-Hurd|Joe Hurd]], [[Guy Haworth]] ('''2010'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-12993-3_20 Data Assurance in Opaque Computations]''. [[Advances in Computer Games 12]], [http://www.gilith.com/research/papers/egt.pdf pdf]
* [https://scholar.google.co.uk/citations?user=OyX1-qYAAAAJ&hl=en Ramana Kumar], [[Joe Leslie-Hurd|Joe Hurd]] ('''2012'''). ''Standalone Tactics Using OpenTheory''. [https://dblp.uni-trier.de/db/conf/itp/itp2012.html ITP 2012], [http://www.gilith.com/research/papers/cloud.pdf pdf] <ref>[https://en.wikipedia.org/wiki/HOL_%28proof_assistant%29 HOL (proof assistant) from Wikipedia]</ref>
* Iago Abal, Alcino Cunha, [[Joe Leslie-Hurd|Joe Hurd]], Jorge Sousa Pinto ('''2012'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-31612-8_51 Using Term Rewriting to Solve Bit-Vector Arithmetic Problems]''. [https://dblp.uni-trier.de/db/conf/sat/sat2012.html#AbalCHP12 SAT 2012]
* [[Joe Leslie-Hurd]] ('''2013'''). ''Formally Verified Endgame Tables''. Guest Lecture, Combinatorial Games, [https://en.wikipedia.org/wiki/Portland_State_University Portland State University], [http://www.gilith.com/research/talks/psu2013.pdf slides as pdf]
* [[Joe Leslie-Hurd]], [[Guy Haworth]] ('''2013'''). ''Computer Theorem Proving and HoTT''. [[ICGA Journal#36_2|ICGA Journal, Vol. 36, No. 2]] <ref>[https://homotopytypetheory.org/ Homotopy Type Theory]</ref>
=External Links=
* [https://scholar.google.com/citations?user=iGScUhoAAAAJ&hl=en Joe Leslie-Hurd - Google Scholar]
* [http://www.gilith.com/ Gilith - Welcome]
* [http://www.gilith.com/about/ Gilith - Joe Leslie-Hurd]
* [http://www.gilith.com/chess/ Gilith - Chess]
* [http://www.gilith.com/chess/coaching/ Gilith - Chess Coaching]
* [http://www.gilith.com/chess/endgames/ Gilith - Chess Endgames]
* [http://www.gilith.com/go/ Gilith - Go]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Leslie-Hurd]]
[[Category:Chess Programmer|Leslie-Hurd]]
[[Category:Go Programmer|Leslie-Hurd]]
[[Category:Chess Player|Leslie-Hurd]]
[[FILE:joehurd.jpg|border|right|thumb|link=https://scholar.google.com/citations?user=iGScUhoAAAAJ&hl=en| Joe Leslie-Hurd <ref>[https://scholar.google.com/citations?user=iGScUhoAAAAJ&hl=en Joe Leslie-Hurd - Google Scholar]</ref> ]]
'''Joe Leslie-Hurd''',<br/>
a British computer scientist and formal verification engineer at [[Intel|Intel Corporation]], [https://en.wikipedia.org/wiki/Portland,_Oregon Portland, Oregon]. He holds a Ph.D. in CS from [https://en.wikipedia.org/wiki/University_of_Cambridge University of Cambridge]
in 2003 on [https://en.wikipedia.org/wiki/Formal_verification formal verification] of [https://en.wikipedia.org/wiki/Randomized_algorithm probabilistic algorithms] <ref>[http://www.gilith.com/about/cv.html Joe Leslie-Hurd - CV]</ref>.
As a chess player, he enjoys solving chess problems, studies, and [[Retrograde Analysis|retrograde analysis]] <ref>[http://www.gilith.com/chess/ Gilith - Chess]</ref>,
and formalized chess in [https://en.wikipedia.org/wiki/Higher-order_logic Higher Order Logic (HOL)] to construct formally verified [[Endgame Tablebases|endgame databases]] <ref>[[Joe Leslie-Hurd|Joe Hurd]] ('''2005'''). ''Formal Verification of Chess Endgame Databases''. Technical Report PRG-RR-05-02, [http://de.wikipedia.org/wiki/University_of_Oxford Oxford University] Computing Laboratory, [http://www.gilith.com/research/papers/chess.pdf pdf]</ref>.
Joe Leslie-Hurd is further author of the open source [[Go]] playing program ''Gomi'', written in [https://en.wikipedia.org/wiki/Standard_ML Standard ML]
<ref>[http://www.gilith.com/software/gomi/ Gomi Go Player]</ref>, and the chess diagram tool ''fen2img'', which reads [[Forsyth-Edwards Notation|FEN]] to output diagrams in [https://en.wikipedia.org/wiki/Netpbm_format portable pixmap format (PPM)] image format, also written in SML
<ref>[http://www.gilith.com/software/fen2img/ fen2img Chess Diagram Maker]</ref> <ref>[http://www.gilith.com/chess/diagrams/ Gilith - Chess Diagram Maker]</ref>.
__FORCETOC__
=Selected Publications=
<ref>[http://www.gilith.com/research/papers/ Gilith - Research Papers]</ref> <ref>[https://dblp.uni-trier.de/pid/29/4239.html dblp: Joe Hurd]</ref>
* [[Joe Leslie-Hurd|Joe Hurd]] ('''2003'''). ''Formal verification of probabilistic algorithms''. Ph.D. thesis, UCAM-CL-TR-566, [https://en.wikipedia.org/wiki/University_of_Cambridge University of Cambridge], [https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-566.pdf pdf]
* [[Joe Leslie-Hurd|Joe Hurd]] ('''2005'''). ''Formal Verification of Chess Endgame Databases''. Technical Report PRG-RR-05-02, [http://de.wikipedia.org/wiki/University_of_Oxford Oxford University] Computing Laboratory, [http://www.gilith.com/research/papers/chess.pdf pdf]
* [[Joe Leslie-Hurd|Joe Hurd]], [[Guy Haworth]] ('''2010'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-12993-3_20 Data Assurance in Opaque Computations]''. [[Advances in Computer Games 12]], [http://www.gilith.com/research/papers/egt.pdf pdf]
* [https://scholar.google.co.uk/citations?user=OyX1-qYAAAAJ&hl=en Ramana Kumar], [[Joe Leslie-Hurd|Joe Hurd]] ('''2012'''). ''Standalone Tactics Using OpenTheory''. [https://dblp.uni-trier.de/db/conf/itp/itp2012.html ITP 2012], [http://www.gilith.com/research/papers/cloud.pdf pdf] <ref>[https://en.wikipedia.org/wiki/HOL_%28proof_assistant%29 HOL (proof assistant) from Wikipedia]</ref>
* Iago Abal, Alcino Cunha, [[Joe Leslie-Hurd|Joe Hurd]], Jorge Sousa Pinto ('''2012'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-31612-8_51 Using Term Rewriting to Solve Bit-Vector Arithmetic Problems]''. [https://dblp.uni-trier.de/db/conf/sat/sat2012.html#AbalCHP12 SAT 2012]
* [[Joe Leslie-Hurd]] ('''2013'''). ''Formally Verified Endgame Tables''. Guest Lecture, Combinatorial Games, [https://en.wikipedia.org/wiki/Portland_State_University Portland State University], [http://www.gilith.com/research/talks/psu2013.pdf slides as pdf]
* [[Joe Leslie-Hurd]], [[Guy Haworth]] ('''2013'''). ''Computer Theorem Proving and HoTT''. [[ICGA Journal#36_2|ICGA Journal, Vol. 36, No. 2]] <ref>[https://homotopytypetheory.org/ Homotopy Type Theory]</ref>
=External Links=
* [https://scholar.google.com/citations?user=iGScUhoAAAAJ&hl=en Joe Leslie-Hurd - Google Scholar]
* [http://www.gilith.com/ Gilith - Welcome]
* [http://www.gilith.com/about/ Gilith - Joe Leslie-Hurd]
* [http://www.gilith.com/chess/ Gilith - Chess]
* [http://www.gilith.com/chess/coaching/ Gilith - Chess Coaching]
* [http://www.gilith.com/chess/endgames/ Gilith - Chess Endgames]
* [http://www.gilith.com/go/ Gilith - Go]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Leslie-Hurd]]
[[Category:Chess Programmer|Leslie-Hurd]]
[[Category:Go Programmer|Leslie-Hurd]]
[[Category:Chess Player|Leslie-Hurd]]
