{"id":"https://openalex.org/W2123710050","doi":"https://doi.org/10.1109/iccad.2004.1382541","title":"DAG-aware circuit compression for formal verification","display_name":"DAG-aware circuit compression for formal verification","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W2123710050","doi":"https://doi.org/10.1109/iccad.2004.1382541","mag":"2123710050"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2004.1382541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5059074630","display_name":"Per Bjesse","orcid":null},"institutions":[{"id":"https://openalex.org/I1335490905","display_name":"Synopsys (Switzerland)","ror":"https://ror.org/03mb54f81","country_code":"CH","type":"company","lineage":["https://openalex.org/I1335490905","https://openalex.org/I4210088951"]},{"id":"https://openalex.org/I4210088951","display_name":"Synopsys (United States)","ror":"https://ror.org/013by2m91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210088951"]}],"countries":["CH","US"],"is_corresponding":false,"raw_author_name":"P. Bjesse","raw_affiliation_strings":["Synopsys, Inc., USA","Synopsys, Inc. Mountain View, CA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Synopsys, Inc., USA","institution_ids":["https://openalex.org/I4210088951"]},{"raw_affiliation_string":"Synopsys, Inc. Mountain View, CA USA","institution_ids":["https://openalex.org/I1335490905"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013476277","display_name":"Arne Bor\u00e4lv","orcid":null},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]},{"id":"https://openalex.org/I4210155980","display_name":"Prover Technology (Sweden)","ror":"https://ror.org/04hrwfn20","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210155980"]}],"countries":["SE","US"],"is_corresponding":false,"raw_author_name":"A. Boralv","raw_affiliation_strings":["Prover Technology, Inc","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Prover Technology, Inc","institution_ids":["https://openalex.org/I4210155980"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7792854309082031},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.7595483064651489},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6743079423904419},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5679651498794556},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5674846768379211},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5487150549888611},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.547616720199585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5033280253410339},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5007755756378174},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4864165782928467},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4658418893814087},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.421644389629364},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4214681088924408},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4186279773712158},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.32706141471862793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15877783298492432},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13669037818908691},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.0960816740989685}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7792854309082031},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.7595483064651489},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6743079423904419},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5679651498794556},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5674846768379211},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5487150549888611},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.547616720199585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5033280253410339},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5007755756378174},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4864165782928467},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4658418893814087},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.421644389629364},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4214681088924408},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4186279773712158},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.32706141471862793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15877783298492432},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13669037818908691},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0960816740989685},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2004.1382541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4099999964237213,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W110658366","https://openalex.org/W1489391022","https://openalex.org/W1494481937","https://openalex.org/W1505590927","https://openalex.org/W1510368738","https://openalex.org/W1511688816","https://openalex.org/W1518271219","https://openalex.org/W1549820563","https://openalex.org/W1574896545","https://openalex.org/W1605593319","https://openalex.org/W1814068099","https://openalex.org/W1983083911","https://openalex.org/W2069560114","https://openalex.org/W2080267935","https://openalex.org/W2087656024","https://openalex.org/W2103351789","https://openalex.org/W2110737535","https://openalex.org/W2146662253","https://openalex.org/W2151793720","https://openalex.org/W2152640882","https://openalex.org/W2168974500","https://openalex.org/W2520093650","https://openalex.org/W4237300772","https://openalex.org/W4241530675","https://openalex.org/W4248224315","https://openalex.org/W4250884204","https://openalex.org/W4252315883","https://openalex.org/W4285719527","https://openalex.org/W6604455467","https://openalex.org/W6630511988","https://openalex.org/W6630623413","https://openalex.org/W6631095228","https://openalex.org/W6634259564"],"related_works":["https://openalex.org/W2152752131","https://openalex.org/W2122355433","https://openalex.org/W2106507440","https://openalex.org/W2105710452","https://openalex.org/W2150974517","https://openalex.org/W2162615969","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W2728195892","https://openalex.org/W2096723742"],"abstract_inverted_index":{"The":[0,182],"choice":[1],"of":[2,20,40,89,125,138,154,168,170,184,193],"representation":[3,22,113,190],"for":[4,16,45,71],"circuits":[5],"and":[6,75,132],"Boolean":[7,72],"formulae":[8],"in":[9,26,57,80],"a":[10,87,159,200],"formal":[11,50],"verification":[12,51],"tool":[13],"is":[14,24,35,61,130,205],"important":[15],"two":[17],"reasons.":[18],"First":[19],"all,":[21],"compactness":[23],"necessary":[25],"order":[27],"to":[28,55,85,97],"keep":[29],"the":[30,38,58,81,111,123,135,139,151,188,194,211],"memory":[31],"consumption":[32],"low.":[33],"This":[34],"witnessed":[36],"by":[37,157],"importance":[39],"maximum":[41],"processable":[42],"design":[43,59],"size":[44,114],"equivalence":[46],"checkers.":[47],"Second,":[48],"many":[49],"algorithms":[52],"are":[53],"sensitive":[54],"redundancies":[56,177],"that":[60,94,122,134,164,204],"processed.":[62],"To":[63],"address":[64],"these":[65,92],"concerns,":[66],"three":[67,212],"different":[68],"auto-compressing":[69],"representations":[70],"circuit":[73],"networks":[74],"formulas":[76],"have":[77,179,197],"been":[78,180],"suggested":[79],"literature.":[82],"We":[83,149],"attempt":[84],"find":[86],"blend":[88],"features":[90],"from":[91],"alternatives":[93,195],"allows":[95],"us":[96],"remove":[98,166],"as":[99,102,208,210],"much":[100],"redundancy":[101],"possible":[103],"while":[104],"not":[105],"sacrificing":[106],"runtime.":[107],"By":[108],"studying":[109],"how":[110],"network":[112],"varies":[115],"when":[116],"we":[117,120,196],"change":[118],"parameters,":[119],"show":[121],"use":[124],"only":[126],"one":[127],"operator":[128],"node":[129],"suboptimal,":[131],"demonstrate":[133],"most":[136],"powerful":[137],"proposed":[140],"reduction":[141],"rules,":[142],"two-level":[143,155],"minimization,":[144],"actually":[145],"can":[146,165],"be":[147],"harmful.":[148],"correct":[150],"bad":[152],"behavior":[153],"optimization":[156],"devising":[158],"simple":[160],"linear":[161],"simplification":[162],"algorithm":[163],"tens":[167],"thousands":[169],"nodes":[171],"on":[172],"examples":[173],"where":[174],"all":[175,192],"obvious":[176],"already":[178],"removed.":[181],"combination":[183],"our":[185],"compactor":[186],"with":[187,199],"simplest":[189],"outperforms":[191],"studied,":[198],"theoretical":[201],"runtime":[202],"bound":[203],"at":[206],"least":[207],"good":[209],"studied":[213],"representations.":[214]},"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":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}