{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:40:32Z","timestamp":1753890032601,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,9,29]],"date-time":"2012-09-29T00:00:00Z","timestamp":1348876800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"name":"National Science Foundation","award":["0926181"],"award-info":[{"award-number":["0926181"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We address the predicate generation problem in the context of loop invariant\ninference. Motivated by the interpolation-based abstraction refinement\ntechnique, we apply the interpolation theorem to synthesize predicates\nimplicitly implied by program texts. Our technique is able to improve the\neffectiveness and efficiency of the learning-based loop invariant inference\nalgorithm in [14]. We report experiment results of examples from Linux,\nSPEC2000, and Tar utility.<\/jats:p>","DOI":"10.2168\/lmcs-8(3:25)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T08:17:46Z","timestamp":1385713066000},"source":"Crossref","is-referenced-by-count":1,"title":["Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference"],"prefix":"10.46298","volume":"Volume 8, Issue 3","author":[{"given":"Wonchan","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yungbum","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bow-yaw","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwangkuen","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2012,9,29]]},"reference":[{"key":"682:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1035\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1035\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:01:48Z","timestamp":1681243308000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,29]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(3:25)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1207.7167","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1207.7167","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-030-29436-6_11","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,9,29]]},"article-number":"1035"}}