Joe Leslie-hurd
Formal Verification Engineer
Portland, Oregon, United States
Summary
👤
Senior🎓
Top SchoolJoe Leslie-Hurd is a formal verification engineer at Intel in Portland with 24 years of experience applying mathematical rigor to hardware and software reliability. He designs and verifies critical many-core processor components, including vector floating-point units, and previously led formal methods at Galois where he brought semantic techniques to security-critical systems. A Cambridge PhD on the formal verification of probabilistic programs underpins his work on verified artifacts—from a formally verified chess endgame database to a HOL4 theorem-prover contributor who added core tactics and logical features. Comfortable at the intersection of research and production, he builds tools and proofs that move from deep theory to silicon-grade assurance.
24 years of coding experience
2 years of employment as a software developer
B.A. (Hons), Mathematics, B.A. (Hons), Mathematics at University of Cambridge
Stackoverflow
1reputation
0reached
0answers
0questions
Github Skills (7)
theorem-proving10
lambda-calculus10
higher-order-functions10
logic9
symbolic-logic9
logical9
develop8
Programming languages (1)
Github contributions (5)
HOL-Theorem-Prover/HOL
Oct 2001 - May 2010
Canonical sources for HOL4 theorem-proving system. Branch develop is where “mainline development” occurs; when develop passes our regression tests, master is merged forward to catch up.
Role in this project:
Back-end Developer
Back-end DeveloperContributions:225 commits, 1 comment in 8 years 8 months
Contributions summary:Joe primarily contributed to the development of the HOL4 theorem-proving system by adding new definitions and theorems within the system's source code. They introduced features such as set complementation, various tactical operators (THEN1, REVERSE), and the Q_TAC tactical for parsing in the context of a goal. Furthermore, the user implemented bug fixes for CNF_CONV and added new type abbreviations and definitions for restricted quantifiers, reflecting a deep understanding of the project's theorem-proving domain.
theorem-provinglambda-calculushigher-order-logic
gilith/hol-light
Oct 2010 - Feb 2020
Contributions:923 commits, 40 pushes in 9 years 5 months
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.