{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:33Z","timestamp":1750308213383,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"52","license":[{"start":{"date-parts":[[1975,6,1]],"date-time":"1975-06-01T00:00:00Z","timestamp":170812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGART Bull."],"published-print":{"date-parts":[[1975,6]]},"abstract":"<jats:p>The Boyer-Moore Pure LISP Theorem Prover ([1], [2], and [3]) has recently proved the correctness of a program implementing binary addition with a carry flag. Because of the relative complexity of the binary addition algorithm and the automatic nature of the proof, this result was thought interesting enough to warrant this technical note.<\/jats:p>","DOI":"10.1145\/1045236.1045238","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"13-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Automatic proof of correctness of a binary addition algorithm"],"prefix":"10.1145","author":[{"given":"J. Strother","family":"Moore","sequence":"first","affiliation":[{"name":"Xerox Palo Alto Research Center, Palo Alto, CA"}]}],"member":"320","published-online":{"date-parts":[[1975,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321864.321875"},{"volume-title":"University of Edinburgh, 1973","year":"1975","author":"Moore J. S.","key":"e_1_2_1_2_1"},{"volume-title":"Ca.","year":"1974","author":"Moore J. S.","key":"e_1_2_1_3_1"}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1045236.1045238","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1045236.1045238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:06Z","timestamp":1750264266000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1045236.1045238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,6]]},"references-count":3,"journal-issue":{"issue":"52","published-print":{"date-parts":[[1975,6]]}},"alternative-id":["10.1145\/1045236.1045238"],"URL":"https:\/\/doi.org\/10.1145\/1045236.1045238","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1975,6]]},"assertion":[{"value":"1975-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}