{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T03:13:21Z","timestamp":1730258001048,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icsmc.2004.1399773","type":"proceedings-article","created":{"date-parts":[[2005,3,31]],"date-time":"2005-03-31T18:26:51Z","timestamp":1112293611000},"page":"1125-1130","source":"Crossref","is-referenced-by-count":0,"title":["Experiments in abstract interpretation-based code certification for pervasive systems"],"prefix":"10.1109","volume":"2","author":[{"given":"E.","family":"Albert","sequence":"first","affiliation":[]},{"given":"G.","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"M.","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0991-94"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1023\/B:JARS.0000021015.15794.82"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45789-5_10"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263712"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/10722311_2"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.01.031"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90035-2"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44898-5_8"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/349214.349216"},{"key":"3","article-title":"The ciao prolog system. Reference manual (v1.8)","volume":"clip4 2002 1","author":"bueno","year":"2002","journal-title":"Technical Report"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)80001-T"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.01.032"},{"key":"10","first-page":"243","article-title":"Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs","author":"gallagher","year":"2002","journal-title":"Proc of PADL'02"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58485-4_45"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90030-7"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/174625.174627"},{"key":"9","first-page":"599","article-title":"Fast and precise regular approximations of logic programs","author":"gallagher","year":"1994","journal-title":"Proc ICLP 94"},{"key":"8","first-page":"291","article-title":"Lower bound cost estimation for logic programs","author":"debray","year":"1997","journal-title":"Proc of ILPS-97"}],"event":{"name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","acronym":"ICSMC-04","location":"The Hague, Netherlands"},"container-title":["2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9622\/30422\/01399773.pdf?arnumber=1399773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T18:13:00Z","timestamp":1489515180000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1399773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2004.1399773","relation":{},"subject":[]}}