{"id":"https://openalex.org/W4238843037","doi":"https://doi.org/10.1109/iccad.2003.1257811","title":"Iterative abstraction using SAT-based BMC with proof analysis","display_name":"Iterative abstraction using SAT-based BMC with proof analysis","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W4238843037","doi":"https://doi.org/10.1109/iccad.2003.1257811"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2003.1257811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2003.1257811","pdf_url":null,"source":{"id":"https://openalex.org/S4363608282","display_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","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/A5041231710","display_name":"Aarti Gupta","orcid":"https://orcid.org/0000-0001-6676-9400"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Gupta","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085310714","display_name":"Malay Ganai","orcid":"https://orcid.org/0000-0003-0593-3419"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Ganai","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087186760","display_name":"Zijiang Yang","orcid":"https://orcid.org/0000-0001-6469-5217"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zijiang Yang","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060336834","display_name":"Pranav Ashar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Ashar","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.2062,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.99591837,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"416","last_page":"423"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9965999722480774,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7923212051391602},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7834566831588745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7468574047088623},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.702004611492157},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.69154292345047},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5818707346916199},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5787309408187866},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.49359166622161865},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4935837984085083},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.49289584159851074},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4817828834056854},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.46558845043182373},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4515700042247772},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.44982922077178955},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4131196439266205},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4123006761074066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4077778160572052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18215614557266235},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09417501091957092}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7923212051391602},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7834566831588745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7468574047088623},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.702004611492157},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.69154292345047},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5818707346916199},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5787309408187866},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.49359166622161865},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4935837984085083},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.49289584159851074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4817828834056854},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.46558845043182373},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4515700042247772},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.44982922077178955},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4131196439266205},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4123006761074066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4077778160572052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18215614557266235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09417501091957092},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iccad.2003.1257811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2003.1257811","pdf_url":null,"source":{"id":"https://openalex.org/S4363608282","display_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.112.5535","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.5535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wmich.edu/~zijiang/pub/iccad03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1495266209","https://openalex.org/W1498403163","https://openalex.org/W1510368738","https://openalex.org/W1536007121","https://openalex.org/W1605593319","https://openalex.org/W1787074469","https://openalex.org/W1836483134","https://openalex.org/W2044560939","https://openalex.org/W2062897452","https://openalex.org/W2080267935","https://openalex.org/W2103351789","https://openalex.org/W2110737535","https://openalex.org/W2114092850","https://openalex.org/W2158395308","https://openalex.org/W4245385551","https://openalex.org/W4247585869","https://openalex.org/W4251625379","https://openalex.org/W4252315883","https://openalex.org/W4254342428","https://openalex.org/W4254983540","https://openalex.org/W4300021588","https://openalex.org/W6638020115","https://openalex.org/W6674427772","https://openalex.org/W6675375035","https://openalex.org/W6681501361","https://openalex.org/W6683398262"],"related_works":["https://openalex.org/W1505872263","https://openalex.org/W2867457158","https://openalex.org/W1945774704","https://openalex.org/W4241145878","https://openalex.org/W2141151670","https://openalex.org/W2765641823","https://openalex.org/W4297908618","https://openalex.org/W3111646971","https://openalex.org/W3186878187","https://openalex.org/W2985048382"],"abstract_inverted_index":{"Resolution-based":[0],"proof":[1,38],"analysis":[2,39],"techniques":[3,27],"have":[4,24],"been":[5],"proposed":[6],"recently":[7],"to":[8,28,89,95],"identify":[9],"a":[10,19,31,58],"sufficient":[11],"set":[12],"of":[13,92,105],"reasons":[14],"for":[15,99],"unsatisfiability":[16],"derived":[17],"by":[18],"CNF-based":[20],"SAT":[21,33],"solver.":[22,34],"We":[23,35,75,101],"adapted":[25],"these":[26,84],"work":[29],"with":[30,41],"hybrid":[32],"use":[36],"the":[37,63,103],"technique":[40],"SAT-based":[42,78],"BMC,":[43],"in":[44,57,87],"order":[45,88],"to,":[46],"generate":[47],"useful":[48],"abstract":[49,73,85],"models.":[50,74],"Our":[51],"abstraction":[52],"procedure":[53],"is":[54],"used":[55],"iteratively":[56],"top-down":[59],"framework,":[60],"starting":[61],"from":[62],"concrete":[64],"design,":[65],"where":[66],"we":[67],"apply":[68,76],"BMC":[69],"on":[70,83,109],"increasingly":[71],"more":[72],"various":[77],"and":[79],"BDD-based":[80],"verification":[81],"methods":[82],"models,":[86],"obtain":[90],"proofs":[91],"correctness,":[93],"or":[94],"perform":[96],"deeper":[97],"searches":[98],"counterexamples.":[100],"demonstrate":[102],"effectiveness":[104],"our":[106],"prototype":[107],"implementation":[108],"several":[110],"large":[111],"industry":[112],"designs.":[113]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}