Difference between revisions of "Joe Leslie-Hurd"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 22: | Line 22: | ||
* [[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] | * [[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> | * [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] | + | * [https://scholar.google.es/citations?user=ZHdqNg0AAAAJ&hl=en Iago Abal], [https://alcinocunha.github.io/ Alcino Cunha], [[Joe Leslie-Hurd|Joe Hurd]], [https://scholar.google.com/citations?user=45QPIOIAAAAJ&hl=en 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]] ('''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> | * [[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> | ||
| Line 41: | Line 41: | ||
[[Category:Researcher|Leslie-Hurd]] | [[Category:Researcher|Leslie-Hurd]] | ||
[[Category:Chess Player|Leslie-Hurd]] | [[Category:Chess Player|Leslie-Hurd]] | ||
| + | [[Category:Chess Programmer|Leslie-Hurd]] | ||
| + | [[Category:Go Programmer|Leslie-Hurd]] | ||
Latest revision as of 22:34, 8 May 2021
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].
Selected Publications
2000 ...
- 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
2010 ...
- 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
- Joe Leslie-Hurd - Formal Verification Engineer - Intel Corporation | LinkedIn
- Joe Leslie-Hurd - Google Scholar
- Gilith - Welcome
- Gilith - Joe Leslie-Hurd
- Gilith - Chess
- Gilith - Chess Coaching
- Gilith - Chess Endgames
- Gilith - Go
References
- ↑ Gilith - Joe Leslie-Hurd
- ↑ Joe Leslie-Hurd - CV
- ↑ Gilith - Chess
- ↑ Joe Hurd (2005). Formal Verification of Chess Endgame Databases. Technical Report PRG-RR-05-02, Oxford University Computing Laboratory, pdf
- ↑ Gomi Go Player
- ↑ fen2img Chess Diagram Maker
- ↑ Gilith - Chess Diagram Maker
- ↑ Gilith - Research Papers
- ↑ dblp: Joe Hurd
- ↑ HOL (proof assistant) from Wikipedia
- ↑ Homotopy Type Theory
