{"id":"https://openalex.org/W2405109576","doi":"https://doi.org/10.1109/fmcad.2015.7542254","title":"Pushing to the top","display_name":"Pushing to the top","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2405109576","doi":"https://doi.org/10.1109/fmcad.2015.7542254","mag":"2405109576"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2015.7542254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2015.7542254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016223670","display_name":"Alexander Ivrii","orcid":"https://orcid.org/0000-0002-5205-3580"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander Ivrii","raw_affiliation_strings":["IBM Research"],"affiliations":[{"raw_affiliation_string":"IBM Research","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046834577","display_name":"Arie Gurfinkel","orcid":"https://orcid.org/0000-0002-5964-6792"},"institutions":[{"id":"https://openalex.org/I114772536","display_name":"Software Engineering Institute","ror":"https://ror.org/01xqjjn94","country_code":"US","type":"facility","lineage":["https://openalex.org/I114772536","https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arie Gurfinkel","raw_affiliation_strings":["Software Engineering Institute"],"affiliations":[{"raw_affiliation_string":"Software Engineering Institute","institution_ids":["https://openalex.org/I114772536"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016223670"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9588,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.96863055,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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.9988999962806702,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9763000011444092,"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/computer-science","display_name":"Computer science","score":0.7467005252838135},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5258013606071472},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4487098157405853},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.322644978761673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16021698713302612}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7467005252838135},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5258013606071472},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4487098157405853},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.322644978761673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16021698713302612},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2015.7542254","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2015.7542254","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W35008586","https://openalex.org/W81626549","https://openalex.org/W170466186","https://openalex.org/W427023237","https://openalex.org/W1498946538","https://openalex.org/W1525907025","https://openalex.org/W1528837436","https://openalex.org/W1539325982","https://openalex.org/W1549166962","https://openalex.org/W1566132409","https://openalex.org/W1783770095","https://openalex.org/W1815155750","https://openalex.org/W2025995266","https://openalex.org/W2035009264","https://openalex.org/W2118791871","https://openalex.org/W2123736383","https://openalex.org/W2396495791","https://openalex.org/W2514073783","https://openalex.org/W3138459719","https://openalex.org/W4230009915","https://openalex.org/W6631227289","https://openalex.org/W6631725144","https://openalex.org/W6632141176","https://openalex.org/W6632737755","https://openalex.org/W6634008005","https://openalex.org/W6638477975","https://openalex.org/W6677926612","https://openalex.org/W6712500670"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2349952486","https://openalex.org/W1489260687","https://openalex.org/W2775700832","https://openalex.org/W2587222766","https://openalex.org/W3204670144","https://openalex.org/W2163101548","https://openalex.org/W1988934358","https://openalex.org/W4389574038"],"abstract_inverted_index":{"IC3":[0,19,107,141],"is":[1,83,166,194],"undoubtedly":[2],"one":[3],"of":[4,24,27,59,67,106,116,123,148,156,178,182,214],"the":[5,33,60,65,68,102,127,146,192,210,231],"most":[6,34],"successful":[7],"and":[8,17,45,151,203,221],"important":[9],"recent":[10,28],"techniques":[11,223],"for":[12],"unbounded":[13],"model":[14],"checking.":[15],"Understanding":[16],"improving":[18],"has":[20],"been":[21],"a":[22,25,76,95,120,164,195],"subject":[23],"lot":[26],"research.":[29],"In":[30,71,134],"this":[31,72,124,138],"regard,":[32],"fundamental":[35],"questions":[36,56],"are":[37],"how":[38,46],"to":[39,42,47,54,85,93,108,145,168,218,227],"choose":[40],"Counterexamples":[41],"Induction":[43],"(CTIs)":[44],"generalize":[48],"them":[49],"into":[50],"(blocking)":[51],"lemmas.":[52,133,171],"Answers":[53],"both":[55],"influence":[57],"performance":[58],"algorithm":[61,128],"by":[62,139,152],"directly":[63],"affecting":[64],"quality":[66],"lemmas":[69,92,113],"learned.":[70],"paper,":[73],"we":[74,136],"present":[75],"new":[77,117,211,222],"IC3-based":[78],"algorithm,":[79],"called":[80],"QUIP1,":[81],"that":[82,161,191,224],"designed":[84],"more":[86,204],"aggressively":[87],"propagate":[88],"(or":[89],"push)":[90],"learned":[91,149],"obtain":[94],"safe":[96],"inductive":[97],"invariant":[98],"faster.":[99],"QUIP":[100,175,193,215],"modifies":[101],"recursive":[103],"blocking":[104],"procedure":[105],"prioritize":[109],"pushing":[110],"already":[111],"discovered":[112],"over":[114,207],"learning":[115],"ones.":[118],"However,":[119],"naive":[121],"implementation":[122,181],"strategy":[125],"floods":[126],"with":[129,142],"too":[130],"many":[131],"useless":[132],"QUIP,":[135],"solve":[137],"extending":[140],"may-proof-obligations":[143],"(corresponding":[144],"negations":[147],"lemmas),":[150],"using":[153],"an":[154,179],"under-approximation":[155],"reachable":[157],"states":[158,160],"(i.e.,":[159],"witness":[162],"why":[163],"may-proof-obligation":[165],"satisfiable)":[167],"prune":[169],"non-inductive":[170],"We":[172],"have":[173],"implemented":[174],"on":[176,187],"top":[177],"industrial-strength":[180],"IC3.":[183,208],"The":[184],"experimental":[185],"evaluation":[186],"HWMCC":[188],"benchmarks":[189],"shows":[190],"significant":[196],"improvement":[197],"(at":[198],"least":[199],"2x":[200],"in":[201,230],"runtime":[202],"properties":[205],"solved)":[206],"Furthermore,":[209],"reasoning":[212],"capabilities":[213],"naturally":[216],"lead":[217,226],"additional":[219],"optimizations":[220],"can":[225],"further":[228],"improvements":[229],"future.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}