{"id":"https://openalex.org/W2590761278","doi":"https://doi.org/10.23919/date.2017.7927103","title":"Busy man's synthesis: Combinational delay optimization with SAT","display_name":"Busy man's synthesis: Combinational delay optimization with SAT","publication_year":2017,"publication_date":"2017-03-01","ids":{"openalex":"https://openalex.org/W2590761278","doi":"https://doi.org/10.23919/date.2017.7927103","mag":"2590761278"},"language":"en","primary_location":{"id":"doi:10.23919/date.2017.7927103","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2017.7927103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/132798","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084007478","display_name":"Mathias Soeken","orcid":"https://orcid.org/0000-0002-0229-8766"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mathias Soeken","raw_affiliation_strings":["Integrated Systems Laboratory, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Integrated Systems Laboratory, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072927296","display_name":"Giovanni De Micheli","orcid":"https://orcid.org/0000-0002-7827-3215"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Giovanni De Micheli","raw_affiliation_strings":["Integrated Systems Laboratory, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Integrated Systems Laboratory, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110450560","display_name":"Alan Mishchenko","orcid":"https://orcid.org/0009-0004-1303-6261"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Mishchenko","raw_affiliation_strings":["Department of EECS, UC Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of EECS, UC Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"830","last_page":"835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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.9980999827384949,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9947999715805054,"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/rewriting","display_name":"Rewriting","score":0.7453150749206543},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7202562689781189},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6099535226821899},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5873914957046509},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5312568545341492},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.5035631060600281},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.487648606300354},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4817916750907898},{"id":"https://openalex.org/keywords/logic-optimization","display_name":"Logic optimization","score":0.4775424897670746},{"id":"https://openalex.org/keywords/elmore-delay","display_name":"Elmore delay","score":0.47704023122787476},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4429868757724762},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4155541956424713},{"id":"https://openalex.org/keywords/delay-calculation","display_name":"Delay calculation","score":0.4144671559333801},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.41347020864486694},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.412424772977829},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3316463232040405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2964857816696167},{"id":"https://openalex.org/keywords/propagation-delay","display_name":"Propagation delay","score":0.2767993211746216}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.7453150749206543},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7202562689781189},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6099535226821899},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5873914957046509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5312568545341492},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.5035631060600281},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.487648606300354},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4817916750907898},{"id":"https://openalex.org/C28449271","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Logic optimization","level":4,"score":0.4775424897670746},{"id":"https://openalex.org/C84434228","wikidata":"https://www.wikidata.org/wiki/Q4531332","display_name":"Elmore delay","level":4,"score":0.47704023122787476},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4429868757724762},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4155541956424713},{"id":"https://openalex.org/C174086752","wikidata":"https://www.wikidata.org/wiki/Q5253471","display_name":"Delay calculation","level":3,"score":0.4144671559333801},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.41347020864486694},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.412424772977829},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3316463232040405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2964857816696167},{"id":"https://openalex.org/C90806461","wikidata":"https://www.wikidata.org/wiki/Q1144416","display_name":"Propagation delay","level":2,"score":0.2767993211746216},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/date.2017.7927103","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2017.7927103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.tind.io:224352","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/132798","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:224352","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/132798","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W145815032","https://openalex.org/W1526394790","https://openalex.org/W1528837436","https://openalex.org/W1995997000","https://openalex.org/W1996198117","https://openalex.org/W2025617772","https://openalex.org/W2100465945","https://openalex.org/W2105715355","https://openalex.org/W2106950603","https://openalex.org/W2108633588","https://openalex.org/W2123710050","https://openalex.org/W2129183345","https://openalex.org/W2145126108","https://openalex.org/W2465457706","https://openalex.org/W2482661504","https://openalex.org/W2752061190","https://openalex.org/W3145367831","https://openalex.org/W6605920132"],"related_works":["https://openalex.org/W2114232017","https://openalex.org/W1691923927","https://openalex.org/W2020200124","https://openalex.org/W2380365775","https://openalex.org/W2109891029","https://openalex.org/W2182628752","https://openalex.org/W4211170193","https://openalex.org/W4238419543","https://openalex.org/W2206152988","https://openalex.org/W1995135231"],"abstract_inverted_index":{"Boolean":[0,16],"SAT":[1,22,55,87],"solving":[2],"can":[3,57],"be":[4,58,77],"used":[5,59],"to":[6,24,60,64,76,92],"find":[7,25],"a":[8,13,26,49,70,85,103],"minimum-size":[9,27],"logic":[10,62,67,80],"network":[11,28],"for":[12,102],"given":[14,35,97,104],"small":[15],"function.":[17,105],"This":[18],"paper":[19],"extends":[20],"the":[21,43,53,66,79,96,119],"formulation":[23,56,88],"under":[29],"delay":[30,98],"constraints.":[31],"Delay":[32],"constraints":[33,99],"are":[34,100],"in":[36],"terms":[37],"of":[38,69],"input":[39],"arrival":[40],"times":[41],"and":[42,89],"maximum":[44],"depth.":[45],"After":[46],"integration":[47],"into":[48],"depth-optimizing":[50],"mapping":[51],"algorithm,":[52],"proposed":[54,107],"perform":[61],"rewriting":[63,81],"reduce":[65],"depth":[68],"network.":[71],"It":[72],"is":[73,109,116],"shown":[74],"that":[75],"effective":[78],"algorithm":[82,108],"requires":[83],"(i)":[84],"fast":[86],"(ii)":[90],"heuristics":[91],"quickly":[93],"determine":[94],"whether":[95],"feasible":[101],"The":[106],"more":[110],"versatile":[111],"than":[112],"previous":[113],"algorithms,":[114],"which":[115],"confirmed":[117],"by":[118],"experimental":[120],"results.":[121]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}