{"id":"https://openalex.org/W4414433663","doi":"https://doi.org/10.1109/fdl68117.2025.11165268","title":"BDD Meets SAT: Binary Hybrid Diagrams for Efficient Generation of Multiple Solutions","display_name":"BDD Meets SAT: Binary Hybrid Diagrams for Efficient Generation of Multiple Solutions","publication_year":2025,"publication_date":"2025-09-10","ids":{"openalex":"https://openalex.org/W4414433663","doi":"https://doi.org/10.1109/fdl68117.2025.11165268"},"language":"en","primary_location":{"id":"doi:10.1109/fdl68117.2025.11165268","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fdl68117.2025.11165268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Forum on Specification & Design Languages (FDL)","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/A5024372634","display_name":"Rune Krauss","orcid":"https://orcid.org/0000-0001-6549-4652"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rune Krauss","raw_affiliation_strings":["DFKI,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"DFKI,Bremen,Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102361174","display_name":"L.O. Muller","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luca M\u00fcller","raw_affiliation_strings":["DFKI,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"DFKI,Bremen,Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119704502","display_name":"Marius Marach","orcid":null},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marius Marach","raw_affiliation_strings":["University of Bremen,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"University of Bremen,Bremen,Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071742136","display_name":"Rolf Drechsler","orcid":"https://orcid.org/0000-0002-9872-1740"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rolf Drechsler","raw_affiliation_strings":["DFKI,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"DFKI,Bremen,Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024372634"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27474685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9876999855041504,"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"}},"topics":[{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9876999855041504,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.95169997215271,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9334999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/binary-decision-diagram","display_name":"Binary decision diagram","score":0.8759999871253967},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5888000130653381},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5497999787330627},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5311999917030334},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.515999972820282},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.49309998750686646},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.42239999771118164},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.41119998693466187}],"concepts":[{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.8759999871253967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6873999834060669},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5888000130653381},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5497999787330627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5422999858856201},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5311999917030334},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.515999972820282},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.49309998750686646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.474700003862381},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.41119998693466187},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.40230000019073486},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4009999930858612},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.33889999985694885},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.3305000066757202},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.31610000133514404},{"id":"https://openalex.org/C81843906","wikidata":"https://www.wikidata.org/wiki/Q173156","display_name":"Digital electronics","level":3,"score":0.3107999861240387},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C20837028","wikidata":"https://www.wikidata.org/wiki/Q623966","display_name":"Influence diagram","level":3,"score":0.2888000011444092},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C530198007","wikidata":"https://www.wikidata.org/wiki/Q80831","display_name":"Integrated circuit","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.25589999556541443}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fdl68117.2025.11165268","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fdl68117.2025.11165268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Forum on Specification & Design Languages (FDL)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321408","display_name":"Ministry of Education","ror":"https://ror.org/01p262204"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,38],"hardware":[1],"complexity":[2],"in":[3,9,43],"electronic":[4],"devices":[5,22],"has":[6],"increased":[7],"significantly":[8],"recent":[10],"decades":[11],"due":[12],"to":[13,76,147],"technological":[14],"advancements.":[15],"To":[16,92],"ensure":[17],"correct":[18],"behavior":[19],"of":[20,74,109,117],"such":[21],"and":[23,30,51,119,122],"meet":[24],"time-to-market":[25],"constraints,":[26],"modern":[27],"circuit":[28],"verification":[29],"testing":[31],"tools":[32],"rely":[33],"on":[34],"formal":[35],"proof":[36],"techniques.":[37],"two":[39],"most":[40],"popular":[41],"methods":[42,59],"this":[44],"context":[45],"are":[46,64,82,134],"Binary":[47,100],"Decision":[48],"Diagrams":[49],"(BDDs)":[50],"Boolean":[52],"Satisfiability":[53],"(SAT)":[54],"solvers.":[55],"Even":[56],"though":[57],"these":[58,94],"share":[60],"some":[61],"similarities,":[62],"they":[63,85],"fundamentally":[65],"different.":[66],"Whereas":[67],"BDDs":[68,118],"usually":[69],"require":[70],"a":[71,89,96],"large":[72],"amount":[73],"memory":[75,142],"represent":[77],"all":[78],"solutions,":[79],"SAT":[80,120],"solvers":[81],"memory-efficient":[83],"but":[84],"typically":[86],"compute":[87],"only":[88],"single":[90],"solution.":[91],"tackle":[93],"issues,":[95],"hybrid":[97],"approach":[98],"called":[99],"Hybrid":[101],"Diagram":[102],"(BHD)":[103],"is":[104],"proposed":[105],"for":[106],"efficient":[107],"generation":[108],"multiple":[110],"solutions.":[111],"BHDs":[112,139],"combine":[113],"the":[114,141],"major":[115],"advantages":[116],"solvers,":[121],"generate":[123],"distinct":[124],"solutions":[125,133],"heuristically":[126],"via":[127],"algorithms.":[128],"Experiments":[129],"demonstrate":[130],"that":[131],"feasible":[132],"generated":[135],"rapidly":[136],"by":[137],"using":[138],"while":[140],"requirement":[143],"remains":[144],"small":[145],"compared":[146],"state-of-the-art":[148],"methods.":[149]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}