| 2007 |
|---|
| 13 | EE | Joe Hurd:
Proof Pearl: The Termination Analysis of Terminator.
TPHOLs 2007: 151-156 |
| 2005 |
|---|
| 12 | | Joe Hurd,
Thomas F. Melham:
Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings
Springer 2005 |
| 11 | EE | Jianjun Duan,
Joe Hurd,
Guodong Li,
Scott Owens,
Konrad Slind,
Junxing Zhang:
Functional Correctness Proofs of Encryption Algorithms.
LPAR 2005: 519-533 |
| 10 | EE | Joe Hurd,
Annabelle McIver,
Carroll Morgan:
Probabilistic Guarded Commands Mechanized in HOL.
Electr. Notes Theor. Comput. Sci. 112: 95-111 (2005) |
| 9 | EE | Joe Hurd,
Annabelle McIver,
Carroll Morgan:
Probabilistic guarded commands mechanized in HOL.
Theor. Comput. Sci. 346(1): 96-112 (2005) |
| 2003 |
|---|
| 8 | EE | Michael J. C. Gordon,
Joe Hurd,
Konrad Slind:
Executing the Formal Semantics of the Accellera Property Specification Language by Mechanised Theorem Proving.
CHARME 2003: 200-215 |
| 7 | EE | Konrad Slind,
Joe Hurd:
Applications of Polytypism in Theorem Proving.
TPHOLs 2003: 103-119 |
| 6 | EE | Joe Hurd:
Verification of the Miller-Rabin probabilistic primality test.
J. Log. Algebr. Program. 56(1-2): 3-21 (2003) |
| 2002 |
|---|
| 5 | EE | Joe Hurd:
An LCF-Style Interface between HOL and First-Order Logic.
CADE 2002: 134-138 |
| 4 | EE | Joe Hurd:
A Formal Approach to Probabilistic Termination.
TPHOLs 2002: 230-245 |
| 2001 |
|---|
| 3 | EE | Joe Hurd:
Predicate Subtyping with Predicate Sets.
TPHOLs 2001: 265-280 |
| 2 | EE | Joe Hurd:
Congruence Classes with Logic Variables.
Logic Journal of the IGPL 9(1): (2001) |
| 1999 |
|---|
| 1 | EE | Joe Hurd:
Integrating Gandalf and HOL.
TPHOLs 1999: 311-322 |
