{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T03:21:12Z","timestamp":1730258472125,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/icsm.2010.5609573","type":"proceedings-article","created":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T18:01:44Z","timestamp":1288980104000},"page":"1-5","source":"Crossref","is-referenced-by-count":4,"title":["Automatic verification of loop invariants"],"prefix":"10.1109","author":[{"given":"Olivier","family":"Ponsini","sequence":"first","affiliation":[]},{"given":"Helene","family":"Collavizza","sequence":"additional","affiliation":[]},{"given":"Carine","family":"Fedele","sequence":"additional","affiliation":[]},{"given":"Claude","family":"Michel","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Rueher","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","first-page":"168","article-title":"A tool for checking ANSI-C programs","volume":"2988","author":"clarke","year":"2004","journal-title":"TACAS Ser LNCS"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/347324.383378"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375616"},{"key":"13","first-page":"1","article-title":"Proving or disproving likely invariants with constraint reasoning","author":"denmat","year":"2005","journal-title":"WLPE"},{"key":"14","first-page":"232","article-title":"Automatic generation of program specifications","author":"nimmer","year":"2002","journal-title":"ISSTA ACM"},{"key":"11","first-page":"634","article-title":"InvGen: An efficient invariant generator","volume":"5643","author":"gupta","year":"2009","journal-title":"CAV Ser LNCS"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.01.015"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2008.22"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_21"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0433-3"},{"journal-title":"Inferring Loop Invariants Using Postconditions","year":"2010","author":"furia","key":"7"},{"key":"6","first-page":"195","article-title":"Inferring invariants by symbolic execution","volume":"259","author":"schmitt","year":"2007","journal-title":"VERIFY Ser CEUR Workshop Proc"},{"key":"5","article-title":"Mechanical inference of invariants for forloops","author":"kauer","year":"2009","journal-title":"Journal of Symbolic Computation"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24694-7_20"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-009-9089-9"}],"event":{"name":"2010 IEEE 26th International Conference on Software Maintenance (ICSM)","start":{"date-parts":[[2010,9,12]]},"location":"Timi oara, Romania","end":{"date-parts":[[2010,9,18]]}},"container-title":["2010 IEEE International Conference on Software Maintenance"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5604771\/5609528\/05609573.pdf?arnumber=5609573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T17:21:48Z","timestamp":1489857708000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5609573\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icsm.2010.5609573","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}