{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:07Z","timestamp":1750308127869,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"11","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"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":["SIGPLAN Not."],"published-print":{"date-parts":[[2005,11]]},"abstract":"<jats:p>Loop dead variables are the variables, which are defined in a loop, but not used in that loop. On successive execution of loop, these get different value, however all values (except last value) are not used. Hence in optimized program, the definition of a loop dead variable can be moved outside the loop (after the loop), rather than computing every time, inside the loop. In our discussion, we have assumed only simple loop. Every loop has one entry and one exit point.<\/jats:p>","DOI":"10.1145\/1107541.1107545","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T18:14:10Z","timestamp":1139249650000},"page":"18-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An improved algorithm for loop dead optimization"],"prefix":"10.1145","volume":"40","author":[{"given":"Chandan Kumar","family":"Behera","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, Kharagpur"}]},{"given":"Pawan","family":"Kumar","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Kharagpur"}]}],"member":"320","published-online":{"date-parts":[[2005,11]]},"reference":[{"volume-title":"Ullman","year":"1986","author":"Aho Alfred V.","key":"e_1_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1145\/1052659.1052665"},{"volume-title":"Advance Compiler Design and Implementation","year":"1997","author":"Muchnik Steve","key":"e_1_2_1_3_1"}],"container-title":["ACM SIGPLAN Notices"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1107541.1107545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1107541.1107545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:26Z","timestamp":1750262906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1107541.1107545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":3,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["10.1145\/1107541.1107545"],"URL":"https:\/\/doi.org\/10.1145\/1107541.1107545","relation":{},"ISSN":["0362-1340","1558-1160"],"issn-type":[{"type":"print","value":"0362-1340"},{"type":"electronic","value":"1558-1160"}],"subject":[],"published":{"date-parts":[[2005,11]]},"assertion":[{"value":"2005-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}