Xenu's Link Sleuth
Developer(s) | Tilman Hausherr |
---|---|
Stable release | 1.3.8
/ September 4, 2010 |
Written in | C++ |
Operating system | Microsoft Windows |
Available in | English |
Website | home |
Xenu, or Xenu's Link Sleuth, is a computer program that checks websites for broken hyperlinks.[1] It is written by Tilman Hausherr and is proprietary software available at no charge. The program is named after Xenu, the galactic ruler from Scientology scripture.
Format
Link Sleuth runs on
Reception
Xenu's Link Sleuth software was called the "fastest link-checking software" by
Xenu's Link Sleuth has also been cited by Rossett's The ASTD E-Learning Handbook,[9] Zhong's Intelligent Technologies for Information Analysis,[10] Gerrard's Risk-Based E-Business Testing,[11] Reynolds' The Complete E-Commerce Book,[12] Slocombe's Max Hits: Websites that Work,[13] George's The ABC of SEO,[14] as well as the German books Homepage-Erfolg,[15] and Einführung in XHTML CSS und Webdesign,[16] and Italian books, Plasmare il web,[17] and Il check-up dei siti Web.[18]
References
- ^ "Looking for link validator.", New Straits Times, May 1, 2000.
- ^ Gunther, D., Recommendation on Quality Assurance and Selection of resources for the ETB network Archived September 27, 2007, at the Wayback Machine, European Treasury Browser, P. 48., 2002, retrieved 3/7/07[clarify].
- ^ McCoy, Linda., Link Sleuth, Deccan Herald, August 24, 2005, Retrieved 23 May 2014
- ^ Mruck, Katja., Qualitative Research Networking: FQS as an Example, Qualitative Social Research, Volume 1, No. 3, December 2000.
- ^ Mickiewicz, Matt., Download of the Week, SitePoint Tribune, Issue 279., SitePoint, February 5, 2004.
- PC Magazine, April 23, 2002.
- ^ Visual Communications eNews, University of Wyoming, June 2005., retrieved 3/7/07[clarify].
- ^ Grissom, Scott., The Trials and Tribulations of Usability Testing, Grand Valley State University, October 8, 2003.
- ISBN 0-07-138796-X.
- ISBN 3-540-40677-8.
- ISBN 1-58053-314-0.
- ISBN 1-57820-312-0.
- ISBN 2-88046-543-5.
- ISBN 1-4116-2251-0.
- ISBN 3-8330-0643-9.
- ISBN 3-8273-2477-7.
- ISBN 88-503-2511-8.
- ISBN 88-503-2282-8.