{"id":"https://openalex.org/W4241670525","doi":"https://doi.org/10.1109/iccad.2005.1560218","title":"Scalable compositional minimization via static analysis","display_name":"Scalable compositional minimization via static analysis","publication_year":2005,"publication_date":"2005-12-22","ids":{"openalex":"https://openalex.org/W4241670525","doi":"https://doi.org/10.1109/iccad.2005.1560218"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2005.1560218","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560218","pdf_url":null,"source":{"id":"https://openalex.org/S4363608058","display_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","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-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","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/A5010806171","display_name":"Fadi A. Zaraket","orcid":"https://orcid.org/0000-0001-5909-6375"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"F. Zaraket","raw_affiliation_strings":["IBM Systems and Technology Group, USA"],"affiliations":[{"raw_affiliation_string":"IBM Systems and Technology Group, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070678192","display_name":"J. Baumgartner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Baumgartner","raw_affiliation_strings":["IBM Systems and Technology Group, USA"],"affiliations":[{"raw_affiliation_string":"IBM Systems and Technology Group, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011986740","display_name":"A. Aziz","orcid":"https://orcid.org/0000-0002-2255-3752"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Aziz","raw_affiliation_strings":["University of Texas, Austin, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010806171"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7994,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74269006,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1060","last_page":"1067"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9969000220298767,"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/T10260","display_name":"Software Engineering Research","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/netlist","display_name":"Netlist","score":0.8680806159973145},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.7907366156578064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7169598340988159},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6319370865821838},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5673952102661133},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5525123476982117},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5449870228767395},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5398802757263184},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5257145762443542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48814496397972107},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.46640744805336},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.45092979073524475},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44386690855026245},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.44319984316825867},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.43171262741088867},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.42513808608055115},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.18947014212608337},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18744665384292603},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17857488989830017},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.1481531858444214},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09489795565605164}],"concepts":[{"id":"https://openalex.org/C177650935","wikidata":"https://www.wikidata.org/wiki/Q1760303","display_name":"Netlist","level":2,"score":0.8680806159973145},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.7907366156578064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7169598340988159},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6319370865821838},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5673952102661133},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5525123476982117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5449870228767395},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5398802757263184},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5257145762443542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48814496397972107},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.46640744805336},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.45092979073524475},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44386690855026245},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.44319984316825867},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.43171262741088867},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.42513808608055115},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.18947014212608337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18744665384292603},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17857488989830017},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.1481531858444214},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09489795565605164},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"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/iccad.2005.1560218","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560218","pdf_url":null,"source":{"id":"https://openalex.org/S4363608058","display_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","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-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W105381148","https://openalex.org/W1499277573","https://openalex.org/W1504192541","https://openalex.org/W1532701284","https://openalex.org/W1544872225","https://openalex.org/W1601250460","https://openalex.org/W1601517679","https://openalex.org/W1662204117","https://openalex.org/W1761632011","https://openalex.org/W2009965218","https://openalex.org/W2054151020","https://openalex.org/W2108065216","https://openalex.org/W2109356398","https://openalex.org/W2110737535","https://openalex.org/W2111982322","https://openalex.org/W2120490412","https://openalex.org/W2122724240","https://openalex.org/W2123710050","https://openalex.org/W2128871797","https://openalex.org/W2166856993","https://openalex.org/W4213060883","https://openalex.org/W4237314320","https://openalex.org/W6636058009","https://openalex.org/W6676143505"],"related_works":["https://openalex.org/W21388859","https://openalex.org/W4213243744","https://openalex.org/W3046927439","https://openalex.org/W2360029815","https://openalex.org/W2895905110","https://openalex.org/W2788911029","https://openalex.org/W2125763413","https://openalex.org/W4234123702","https://openalex.org/W2295023886","https://openalex.org/W1971664049"],"abstract_inverted_index":{"State-equivalence":[0],"based":[1],"reduction":[2,70],"techniques,":[3],"e.g.":[4],"bisimulation":[5],"minimization,":[6],"can":[7],"be":[8],"used":[9],"to":[10,16,58,86,99,118],"reduce":[11],"a":[12,46,62,73],"state":[13,30],"transition":[14],"system":[15],"facilitate":[17],"subsequent":[18],"verification":[19],"tasks.":[20],"However,":[21],"the":[22,26,41,83,102],"complexity":[23],"of":[24,28,35,89],"computing":[25],"set":[27],"equivalent":[29],"pairs":[31],"often":[32],"exceeds":[33],"that":[34,65,113],"performing":[36],"symbolic":[37],"property":[38],"checking":[39],"on":[40,123],"original":[42],"system.":[43],"We":[44,76],"introduce":[45],"fully-automated":[47],"efficient":[48],"compositional":[49],"minimization":[50],"approach":[51,60],"which":[52,81],"requires":[53],"only":[54],"static":[55],"analysis.":[56],"Key":[57],"our":[59,114],"is":[61,116],"heuristic":[63],"algorithm":[64],"identifies":[66],"components":[67],"with":[68],"high":[69],"potential":[71],"in":[72],"bit-level":[74],"netlist.":[75],"next":[77],"inject":[78],"combinational":[79],"logic":[80],"restricts":[82],"component's":[84],"inputs":[85],"selected":[87],"representatives":[88],"symbolically-computed":[90],"equivalence":[91],"classes":[92],"thereof.":[93],"Finally,":[94],"we":[95],"use":[96],"existing":[97],"transformations":[98],"synergistically":[100],"exploit":[101],"dramatic":[103],"netlist":[104],"reductions":[105,122],"enabled":[106],"by":[107],"these":[108],"input":[109],"filters.":[110],"Experiments":[111],"confirm":[112],"technique":[115],"able":[117],"efficiently":[119],"yield":[120],"substantial":[121],"large":[124],"industrial":[125],"netlists.":[126]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}