{"id":"https://openalex.org/W4387755458","doi":"https://doi.org/10.1007/978-3-031-45332-8_4","title":"Predicting Memory Demands of\u00a0BDD Operations Using Maximum Graph Cuts","display_name":"Predicting Memory Demands of\u00a0BDD Operations Using Maximum Graph Cuts","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4387755458","doi":"https://doi.org/10.1007/978-3-031-45332-8_4"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-45332-8_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-45332-8_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.scopus.com/pages/publications/85176003250","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006113421","display_name":"Steffan Christ S\u00f8lvsten","orcid":"https://orcid.org/0000-0003-0963-6569"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Steffan Christ S\u00f8lvsten","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-0963-6569","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012697499","display_name":"Jaco van de Pol","orcid":"https://orcid.org/0000-0003-4305-0625"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jaco van de Pol","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-4305-0625","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006113421"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.7746,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.93785833,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"92"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9941999912261963,"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.9941999912261963,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9858999848365784,"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/T12288","display_name":"Optimization and Search Problems","score":0.9746999740600586,"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/computer-science","display_name":"Computer science","score":0.8644417524337769},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5527822971343994},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39872854948043823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3600837290287018},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3595784902572632}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8644417524337769},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5527822971343994},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39872854948043823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3600837290287018},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3595784902572632}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-031-45332-8_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-45332-8_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire/55ccbb64-d0e2-40f3-8c66-a085f2ee78f8","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85176003250","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"S\u00f8lvsten, S & van de Pol, J 2023, Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. in \u00c9 Andr\u00e9 & J Sun (eds), Automated technology for verification and analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, vol. 14216, pp. 72-92, 21st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.org/10.1007/978-3-031-45332-8_4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/55ccbb64-d0e2-40f3-8c66-a085f2ee78f8","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/55ccbb64-d0e2-40f3-8c66-a085f2ee78f8","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"S\u00f8lvsten, S & van de Pol, J 2023, Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. in \u00c9 Andr\u00e9 & J Sun (eds), Automated technology for verification and analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, vol. 14216, pp. 72-92, 21st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.org/10.1007/978-3-031-45332-8_4","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/55ccbb64-d0e2-40f3-8c66-a085f2ee78f8","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85176003250","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"S\u00f8lvsten, S & van de Pol, J 2023, Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. in \u00c9 Andr\u00e9 & J Sun (eds), Automated technology for verification and analysis : Part II. Springer, Cham, Lecture Notes in Computer Science, vol. 14216, pp. 72-92, 21st International Symposium of Automated Technology for Verification and Analysis, Singapore, Singapore, 24/10/2023. https://doi.org/10.1007/978-3-031-45332-8_4","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6700000166893005,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1487258612","https://openalex.org/W1507793072","https://openalex.org/W1526390868","https://openalex.org/W1617448086","https://openalex.org/W1864649459","https://openalex.org/W1967608240","https://openalex.org/W1975335740","https://openalex.org/W2001289891","https://openalex.org/W2031522732","https://openalex.org/W2037348602","https://openalex.org/W2038142281","https://openalex.org/W2038225707","https://openalex.org/W2049379258","https://openalex.org/W2068700117","https://openalex.org/W2079071129","https://openalex.org/W2080267935","https://openalex.org/W2133491672","https://openalex.org/W2149379116","https://openalex.org/W2534303543","https://openalex.org/W2731750870","https://openalex.org/W3136791784","https://openalex.org/W3178381410","https://openalex.org/W4214723139","https://openalex.org/W4226192590","https://openalex.org/W4229995174","https://openalex.org/W4240731499","https://openalex.org/W4248313368","https://openalex.org/W4255413535","https://openalex.org/W4256317073","https://openalex.org/W4313591937","https://openalex.org/W4379177135","https://openalex.org/W4387755458","https://openalex.org/W4393621733","https://openalex.org/W4393668904","https://openalex.org/W4393791856","https://openalex.org/W6600213211","https://openalex.org/W6603942782","https://openalex.org/W6968749645"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"The":[0,47],"BDD":[1,93],"package":[2],"Adiar":[3],"manipulates":[4],"Binary":[5],"Decision":[6],"Diagrams":[7],"(BDDs)":[8],"in":[9,60,140],"external":[10,33],"memory.":[11,46],"This":[12,26],"enables":[13],"handling":[14],"big":[15],"BDDs,":[16,137],"but":[17],"the":[18,70,73,77,116,131,135,145,157,170,177,179],"performance":[19],"suffers":[20],"when":[21],"dealing":[22],"with":[23],"moderate-sized":[24,136],"BDDs.":[25],"is":[27,159],"mostly":[28],"due":[29],"to":[30,56],"initializing":[31],"expensive":[32],"memory":[34,113],"data":[35,52,118],"structures,":[36],"even":[37,160],"if":[38],"their":[39,88],"contents":[40,48],"can":[41,107,120],"fit":[42],"entirely":[43],"inside":[44],"internal":[45,112],"of":[49,72,79,115,144,151,166,176],"these":[50,67,80,98,104],"auxiliary":[51,117],"structures":[53,119],"always":[54],"correspond":[55],"a":[57,110],"graph":[58],"cut":[59],"an":[61,141],"input":[62],"or":[63],"output":[64],"BDD.":[65,74],"Specifically,":[66],"cuts":[68,81],"respect":[69],"levels":[71],"We":[75,95],"formalise":[76],"shape":[78],"and":[82],"prove":[83],"sound":[84],"upper":[85,99],"bounds":[86,100],"on":[87],"maximum":[89],"size":[90],"for":[91,134,174],"each":[92],"operation.":[94],"have":[96],"implemented":[97],"within":[101],"Adiar.":[102],"With":[103],"bounds,":[105],"it":[106],"predict":[108],"whether":[109],"faster":[111],"variant":[114],"be":[121],"used.":[122],"In":[123,154],"practice,":[124],"this":[125,138],"improves":[126],"Adiar\u2019s":[127],"running":[128],"time":[129,147,180],"across":[130],"board.":[132],"Specifically":[133],"results":[139],"average":[142],"reduction":[143],"computation":[146],"by":[148,183],"$$86.1\\%$$":[149],"(median":[150],"$$89.7\\%$$":[152],").":[153],"some":[155],"cases,":[156],"difference":[158],"$$99.9\\%$$":[161],".":[162],"When":[163],"checking":[164],"equivalence":[165],"hardware":[167],"circuits":[168],"from":[169],"EPFL":[171],"Benchmark":[172],"Suite,":[173],"one":[175],"instances":[178],"was":[181],"decreased":[182],"52":[184],"h.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2023-10-19T00:00:00"}