J Strother Moore
||This biographical article needs additional citations for verification. (February 2013)|
J Strother Moore (his first name is the alphabetic character "J" – not an abbreviated "J.") is a computer scientist, and he is a co-developer of the Boyer–Moore string search algorithm and the Boyer–Moore automated theorem prover, Nqthm. An example of the workings of the Boyer–Moore string search algorithm is given in Moore's website. Moore received his SB in mathematics at Massachusetts Institute of Technology in 1970 and his Ph.D in computational logic at University of Edinburgh in Scotland in 1973.
In addition, Moore is a co-author of the ACL2 automated theorem prover. He and others used ACL2 to prove the correctness of the floating point division operations of the AMD K5 microprocessor in the wake of the Pentium FDIV bug.
For his contributions to automated deduction, Moore received the 1999 Herbrand Award with Robert S. Boyer, and in 2006 he was inducted as a Fellow of the Association for Computing Machinery. Moore was elected to the National Academy of Engineering in 2007, and is a Fellow of the AAAI. 
Before joining the Department of Computer Sciences as the chair, he formed a company, Computational Logic Inc., along with others including his close friend at the University of Texas at Austin and one of the highly regarded professors in the field of Automated Reasoning, Robert S. Boyer.
|Wikimedia Commons has media related to J Strother Moore.|
|This biographical article relating to a computer specialist in the United States is a stub. You can help Wikipedia by expanding it.|