default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoe Hurd
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j4]Richard J. Boulton, Joe Hurd, Konrad Slind:
Computer Assisted Reasoning. J. Autom. Reason. 43(3): 237-242 (2009)- 2005
- [j3]Joe Hurd, Annabelle McIver
, Carroll Morgan:
Probabilistic guarded commands mechanized in HOL. Theor. Comput. Sci. 346(1): 96-112 (2005) - 2003
- [j2]Joe Hurd:
Verification of the Miller-Rabin probabilistic primality test. J. Log. Algebraic Methods Program. 56(1-2): 3-21 (2003) - 2001
- [j1]Joe Hurd:
Congruence Classes with Logic Variables. Log. J. IGPL 9(1): 53-69 (2001)
Conference and Workshop Papers
- 2012
- [c16]Ramana Kumar, Joe Hurd:
Standalone Tactics Using OpenTheory. ITP 2012: 405-411 - [c15]Iago Abal, Alcino Cunha, Joe Hurd, Jorge Sousa Pinto:
Using Term Rewriting to Solve Bit-Vector Arithmetic Problems - (Poster Presentation). SAT 2012: 493-495 - 2011
- [c14]Joe Hurd:
The OpenTheory Standard Theory Library. NASA Formal Methods 2011: 177-191 - 2010
- [c13]Joe Hurd:
Evaluation Opportunities in Mechanized Theories. EMSQMS@IJCAR 2010: 1-4 - [c12]Joe Hurd:
Composable Packages for Higher Order Logic Theories. VERIFY@IJCAR 2010: 79-93 - 2009
- [c11]Joe Hurd, Guy Haworth:
Data Assurance in Opaque Computations. ACG 2009: 221-231 - 2007
- [c10]Joe Hurd:
Proof Pearl: The Termination Analysis of Terminator. TPHOLs 2007: 151-156 - 2005
- [c9]Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, Konrad Slind, Junxing Zhang:
Functional Correctness Proofs of Encryption Algorithms. LPAR 2005: 519-533 - 2004
- [c8]Joe Hurd, Annabelle McIver, Carroll Morgan:
Probabilistic Guarded Commands Mechanized in HOL. QAPL 2004: 95-111 - 2003
- [c7]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 - [c6]Konrad Slind, Joe Hurd:
Applications of Polytypism in Theorem Proving. TPHOLs 2003: 103-119 - 2002
- [c5]Joe Hurd:
An LCF-Style Interface between HOL and First-Order Logic. CADE 2002: 134-138 - [c4]Joe Hurd:
A Formal Approach to Probabilistic Termination. TPHOLs 2002: 230-245 - 2001
- [c3]Joe Hurd:
Predicate Subtyping with Predicate Sets. TPHOLs 2001: 265-280 - 2000
- [c2]Joe Hurd:
Congruence Classes with Logic Variables. ARW 2000 - 1999
- [c1]Joe Hurd:
Integrating Gandalf and HOL. TPHOLs 1999: 311-322
Editorship
- 2005
- [e1]Joe Hurd, Thomas F. Melham:
Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings. Lecture Notes in Computer Science 3603, Springer 2005, ISBN 3-540-28372-2 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
