Joe Leslie-Hurd

opentheory   •   metis   •   chess

Selected Blog Posts [more]

• Fox & Hounds (solving a game is not the same thing as playing it well)
• The Slowest Software Development Methodology in the World
• Large Knight's Tours (scaling up is easy when you have a universal tile)

Selected Talks [more]

• Formally Verified Endgame Tables, Guest Lecture, Combinatorial Games, Portland State University, Portland, Oregon, USA.
• Theory Engineering Using Composable Packages, Invited Talk, SVARM 2013, Rome, Italy.
• Visualizing Information Flow through C Programs, Invited Talk, SSV '10, Vancouver, Canada.
• Visual Mathematics, Ignite Portland 9, Portland, Oregon, USA. [video] [script]
• Mathematics of Cryptography: A Guided Tour, Galois Tech Talk, Portland, Oregon, USA.

Selected Publications [more]

• Theo Drane, Samuel Coward, Mertcan Temel, and Joe Leslie-Hurd. On the systematic creation of faithfully rounded commutative truncated booth multipliers. In Proceedings of the 31st Symposium on Computer Arithmetic (ARITH 2024), pages 108–115. IEEE Computer Society, June 2024. [preprint] [bibtex]
• Warren E. Ferguson, Jesse Bingham, Levent Erkok, John R. Harrison, and Joe Leslie-Hurd. Digit serial methods with applications to division and square root. IEEE Transactions on Computers, 67(3):449–456, March 2018. [preprint] [bibtex]
• Jesse Bingham and Joe Leslie-Hurd. Verifying Relative Error Bounds Using Symbolic Simulation. In Armin Biere and Roderick Bloem, editors, Proceedings of the 26th International Conference on Computer Aided Verification (CAV 2014), volume 8559 of Lecture Notes in Computer Science, pages 277–292. Springer, July 2014. [paper] [bibtex] [talk]

Conferences [more]

• Interactive Theorem Proving (ITP 2019), PC Member.
• NASA Formal Methods Symposium (NFM 2019), PC Member.
• Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2018), PC Member.