{"id":"https://openalex.org/W2000807481","doi":"https://doi.org/10.1016/s1571-0661(05)82559-9","title":"Verifying Invariants by Approximate Image Computation","display_name":"Verifying Invariants by Approximate Image Computation","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2000807481","doi":"https://doi.org/10.1016/s1571-0661(05)82559-9","mag":"2000807481"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)82559-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82559-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)82559-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114013288","display_name":"Felice Balarin","orcid":null},"institutions":[{"id":"https://openalex.org/I66217453","display_name":"Cadence Design Systems (United States)","ror":"https://ror.org/04w8xa018","country_code":"US","type":"company","lineage":["https://openalex.org/I66217453"]},{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Felice Balarin","raw_affiliation_strings":["Cadence Berkeley Laboratories, Berkeley, USA","Cadence Berkeley Laboratories, Berkeley, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Cadence Berkeley Laboratories, Berkeley, USA","institution_ids":["https://openalex.org/I66217453","https://openalex.org/I148283060"]},{"raw_affiliation_string":"Cadence Berkeley Laboratories, Berkeley, USA#TAB#","institution_ids":["https://openalex.org/I148283060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5114013288"],"corresponding_institution_ids":["https://openalex.org/I148283060","https://openalex.org/I66217453"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13050105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"2","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9818000197410583,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9166311025619507},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7972515821456909},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.7489286661148071},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.6262755393981934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5556994080543518},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.509725034236908},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.504365086555481},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47724437713623047},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.43299970030784607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3490086495876312},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.2935786843299866}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9166311025619507},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7972515821456909},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.7489286661148071},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.6262755393981934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5556994080543518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.509725034236908},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.504365086555481},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47724437713623047},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.43299970030784607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3490086495876312},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.2935786843299866},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)82559-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82559-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)82559-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)82559-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1576648414","https://openalex.org/W1605593319","https://openalex.org/W1637976039","https://openalex.org/W1995691455","https://openalex.org/W2002089154","https://openalex.org/W2150621341","https://openalex.org/W2884976657","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W2884574904","https://openalex.org/W2746645407"],"abstract_inverted_index":{"Automatic":[0],"formal":[1],"verification":[2,136],"of":[3,11,29,46,60,85,134],"safety":[4],"properties":[5],"typically":[6],"requires":[7],"computing":[8],"reachable":[9,30],"states":[10,31],"a":[12,25,83,131],"system.":[13,48],"A":[14],"more":[15],"efficient":[16],"(and":[17],"less":[18],"automatic)":[19],"alternative":[20],"is":[21,32],"to":[22,57,69,95,124,128,143],"check":[23],"whether":[24,36,100],"user":[26],"suggested":[27,102,121],"superset":[28,84],"an":[33],"invariant,":[34],"i.e.":[35],"it":[37,88],"contains":[38,104],"its":[39,105],"image":[40,61,72,117,149],"specified":[41],"by":[42],"the":[43,47,58,80,86,98,101,115,120,135,146],"transition":[44],"relation":[45],"Still,":[49],"this":[50,65],"approach":[51],"may":[52],"be":[53,93,159],"prohibitively":[54],"expensive":[55],"due":[56],"complexity":[59],"computation.":[62],"To":[63],"alleviate":[64],"problem":[66],"we":[67,75,109,139],"suggest":[68],"use":[70,140],"approximate":[71,116,148,155],"computations,":[73],"and":[74,119],"show":[76,144],"that":[77,114,145],"even":[78],"though":[79],"approximation":[81],"computes":[82],"image,":[87],"can,":[89],"in":[90,126],"certain":[91],"cases,":[92],"used":[94,160],"answer":[96],"categorically":[97],"question":[99],"invariant":[103,122,163],"image.":[106],"More":[107],"precisely,":[108],"first":[110],"establish":[111],"sufficient":[112],"conditions":[113],"computation":[118,150],"need":[123],"satisfy":[125],"order":[127],"always":[129],"reach":[130],"conclusive":[132],"result":[133],"process.":[137],"Then,":[138],"these":[141],"results":[142],"three":[147],"methods":[151],"proposed":[152],"previously":[153],"for":[154,161],"reachability":[156],"analysis":[157],"could":[158],"exact":[162],"verification.":[164]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}