{"id":"https://openalex.org/W2167903312","doi":"https://doi.org/10.1016/j.entcs.2013.07.009","title":"Multi-Core BDD Operations for Symbolic Reachability","display_name":"Multi-Core BDD Operations for Symbolic Reachability","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2167903312","doi":"https://doi.org/10.1016/j.entcs.2013.07.009","mag":"2167903312"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2013.07.009","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2013.07.009","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.entcs.2013.07.009","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043493738","display_name":"Tom van Dijk","orcid":"https://orcid.org/0000-0002-5366-1051"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Tom van Dijk","raw_affiliation_strings":["Formal Methods and Tools, Dept. of EEMCS, University of Twente, P.O.-box 217, 7500 AE Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Formal Methods and Tools, Dept. of EEMCS, University of Twente, P.O.-box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018667026","display_name":"Alfons Laarman","orcid":"https://orcid.org/0000-0002-2433-4174"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Alfons Laarman","raw_affiliation_strings":["Formal Methods and Tools, Dept. of EEMCS, University of Twente, P.O.-box 217, 7500 AE Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Formal Methods and Tools, Dept. of EEMCS, University of Twente, P.O.-box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"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/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jaco van de Pol","raw_affiliation_strings":["Formal Methods and Tools, Dept. of EEMCS, University of Twente, P.O.-box 217, 7500 AE Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Formal Methods and Tools, Dept. of EEMCS, University of Twente, P.O.-box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012697499","https://openalex.org/A5018667026","https://openalex.org/A5043493738"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":null,"apc_paid":null,"fwci":4.483,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94939936,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"296","issue":null,"first_page":"127","last_page":"143"},"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.998199999332428,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9242925643920898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8707200288772583},{"id":"https://openalex.org/keywords/memoization","display_name":"Memoization","score":0.6530361175537109},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.5974716544151306},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5434662103652954},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5042120218276978},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45526647567749023},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.44425371289253235},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.43372589349746704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.389851838350296},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31500399112701416},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.27224236726760864},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1667151153087616}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9242925643920898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8707200288772583},{"id":"https://openalex.org/C79516417","wikidata":"https://www.wikidata.org/wiki/Q1376168","display_name":"Memoization","level":4,"score":0.6530361175537109},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.5974716544151306},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5434662103652954},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5042120218276978},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45526647567749023},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.44425371289253235},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.43372589349746704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.389851838350296},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31500399112701416},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.27224236726760864},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1667151153087616},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.entcs.2013.07.009","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2013.07.009","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:publications/4810091a-0b05-4c6e-b496-040eb79e51a8","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/4810091a-0b05-4c6e-b496-040eb79e51a8","pdf_url":"https://ris.utwente.nl/ws/files/5301295/pdmc-submitted.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van Dijk, T, Laarman, A & van de Pol, J C 2012, Multi-Core BDD Operations for Symbolic Reachability. in K Heljanko & W J Knottenbelt (eds), 11th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC 2012. Electronic Notes in Theoretical Computer Science, vol. 296, Elsevier, Amsterdam, pp. 127-143, 11th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC 2012, London, United Kingdom, 17/09/12. https://doi.org/10.1016/j.entcs.2013.07.009","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2013.07.009","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2013.07.009","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W79426772","https://openalex.org/W125115239","https://openalex.org/W136095187","https://openalex.org/W188891428","https://openalex.org/W212786159","https://openalex.org/W1513489646","https://openalex.org/W1517635912","https://openalex.org/W1568683624","https://openalex.org/W1606621385","https://openalex.org/W1617448086","https://openalex.org/W1626572155","https://openalex.org/W1770434780","https://openalex.org/W1850929791","https://openalex.org/W1902001185","https://openalex.org/W1971362265","https://openalex.org/W1973377835","https://openalex.org/W1983572666","https://openalex.org/W1994143452","https://openalex.org/W2053619330","https://openalex.org/W2078620789","https://openalex.org/W2079071129","https://openalex.org/W2080267935","https://openalex.org/W2097094127","https://openalex.org/W2099120582","https://openalex.org/W2099800340","https://openalex.org/W2103780026","https://openalex.org/W2133491672","https://openalex.org/W2135453964","https://openalex.org/W2139076938","https://openalex.org/W2139498362","https://openalex.org/W2157632109","https://openalex.org/W2164202841","https://openalex.org/W2171775336","https://openalex.org/W2294467636","https://openalex.org/W2404897795","https://openalex.org/W2484804204","https://openalex.org/W2500165681","https://openalex.org/W2949298199","https://openalex.org/W3141768825","https://openalex.org/W4238789642","https://openalex.org/W4285719527","https://openalex.org/W6605518534","https://openalex.org/W6607599502","https://openalex.org/W6630791553","https://openalex.org/W6633931335","https://openalex.org/W6636354120","https://openalex.org/W6638903731","https://openalex.org/W6639819749","https://openalex.org/W6643607122","https://openalex.org/W6674731515","https://openalex.org/W6676067444","https://openalex.org/W6679879947","https://openalex.org/W6680437210","https://openalex.org/W6680459248","https://openalex.org/W6681826641","https://openalex.org/W6682886487","https://openalex.org/W6684411668","https://openalex.org/W6685400827","https://openalex.org/W6697041156","https://openalex.org/W6792961117","https://openalex.org/W6793025919"],"related_works":["https://openalex.org/W2966056201","https://openalex.org/W2182406401","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2772415251","https://openalex.org/W2150194458","https://openalex.org/W2884574904","https://openalex.org/W2538794329"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"scalable":[3],"parallel":[4],"BDD":[5,33,39,48,96,109,168],"operations":[6,34,40,49],"for":[7,144],"modern":[8],"multi-core":[9,95,108],"hardware.":[10],"We":[11,60,100,119,182],"aim":[12],"at":[13,46],"increasing":[14],"the":[15,21,38,43,88,102,112,115,121,124,131,159,172,176,189,196],"performance":[16,190],"of":[17,23,105,114,123,141,191],"reachability":[18,125,162,193],"analysis":[19],"in":[20,57,111,179],"context":[22],"model":[24,116,133],"checking.":[25],"Existing":[26],"approaches":[27],"focus":[28],"on":[29,127,135],"performing":[30],"multiple":[31],"independent":[32],"rather":[35],"than":[36],"parallelizing":[37,47],"themselves.":[41],"In":[42,155],"past,":[44],"attempts":[45],"have":[50],"been":[51],"unsuccessful":[52],"due":[53],"to":[54,70,152,164,201],"communication":[55],"costs":[56],"shared":[58],"memory.":[59],"solved":[61],"this":[62,107,185],"problem":[63],"by":[64,77,199],"extending":[65],"an":[66],"existing":[67],"lockless":[68,80,85],"hashtable":[69],"support":[71],"BDDs":[72],"and":[73,76,87,175,194],"garbage":[74],"collection":[75],"implementing":[78],"a":[79,94,136,149,166],"memoization":[81],"table.":[82],"Using":[83],"these":[84],"hashtables":[86],"work-stealing":[89],"framework":[90,113],"Wool,":[91],"we":[92,157],"implemented":[93],"package":[97,110],"called":[98],"Sylvan.":[99],"provide":[101],"experimental":[103],"results":[104],"using":[106],"checker":[117],"LTSmin.":[118],"measured":[120],"runtime":[122],"algorithm":[126,163,187],"several":[128],"models":[129],"from":[130],"BEEM":[132],"database":[134],"48-core":[137],"machine,":[138],"demonstrating":[139],"speedups":[140],"over":[142],"30":[143],"some":[145],"models,":[146],"which":[147],"is":[148],"breakthrough":[150],"compared":[151],"earlier":[153],"work.":[154],"addition,":[156],"improved":[158],"standard":[160],"symbolic":[161,192],"use":[165],"modified":[167],"operation":[169],"that":[170,184],"calculates":[171],"relational":[173],"product":[174],"variable":[177],"substitution":[178],"one":[180],"step.":[181],"show":[183],"new":[186],"improves":[188],"decreases":[195],"memory":[197],"requirements":[198],"up":[200],"40%.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}