{"id":"https://openalex.org/W2736293034","doi":"https://doi.org/10.1145/3092282.3092284","title":"Distributed binary decision diagrams for symbolic reachability","display_name":"Distributed binary decision diagrams for symbolic reachability","publication_year":2017,"publication_date":"2017-07-13","ids":{"openalex":"https://openalex.org/W2736293034","doi":"https://doi.org/10.1145/3092282.3092284","mag":"2736293034"},"language":"en","primary_location":{"id":"doi:10.1145/3092282.3092284","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3092282.3092284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software","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/A5059599642","display_name":"Wytse Oortwijn","orcid":"https://orcid.org/0000-0002-5244-2519"},"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":"Wytse Oortwijn","raw_affiliation_strings":["University of Twente, Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Twente, Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043493738","display_name":"Tom van Dijk","orcid":"https://orcid.org/0000-0002-5366-1051"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom van Dijk","raw_affiliation_strings":["JKU Linz, Austria"],"affiliations":[{"raw_affiliation_string":"JKU Linz, Austria","institution_ids":[]}]},{"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":false,"raw_author_name":"Jaco van de Pol","raw_affiliation_strings":["University of Twente, Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Twente, Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059599642"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":null,"apc_paid":null,"fwci":1.4219,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83495941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"30"},"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/T11424","display_name":"Security and Verification in Computing","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9327330589294434},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8586375713348389},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6528710126876831},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.6441547274589539},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5296820402145386},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5097145438194275},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4747360646724701},{"id":"https://openalex.org/keywords/distributed-hash-table","display_name":"Distributed hash table","score":0.4456160068511963},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38804900646209717},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.3389512300491333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33335059881210327},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12009555101394653}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9327330589294434},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8586375713348389},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6528710126876831},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.6441547274589539},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5296820402145386},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5097145438194275},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4747360646724701},{"id":"https://openalex.org/C2780224649","wikidata":"https://www.wikidata.org/wiki/Q863506","display_name":"Distributed hash table","level":3,"score":0.4456160068511963},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38804900646209717},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.3389512300491333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33335059881210327},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12009555101394653},{"id":"https://openalex.org/C534932454","wikidata":"https://www.wikidata.org/wiki/Q161410","display_name":"Peer-to-peer","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3092282.3092284","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3092282.3092284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software","raw_type":"proceedings-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/1c7dd725-328c-47f4-b4cd-99f5a5ccdc52","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/1c7dd725-328c-47f4-b4cd-99f5a5ccdc52","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Oortwijn, W, van Dijk, T & van de Pol, J 2017, Distributed Binary Decision Diagrams for Symbolic Reachability. in SPIN 2017 Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software. Association for Computing Machinery, pp. 21-30, 24th International SPIN Symposium 2017, Santa Barbara, California, United States, 13/07/17. https://doi.org/10.1145/3092282.3092284","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5400000214576721,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G2879914166","display_name":null,"funder_award_id":"612.001.101,612.001.403","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G3658169213","display_name":null,"funder_award_id":"612.001.101","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8488583251","display_name":null,"funder_award_id":"S11408-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W73507577","https://openalex.org/W125115239","https://openalex.org/W136095187","https://openalex.org/W1514712409","https://openalex.org/W1532546444","https://openalex.org/W1579329775","https://openalex.org/W1617448086","https://openalex.org/W1864649459","https://openalex.org/W1902001185","https://openalex.org/W1971362265","https://openalex.org/W2019380637","https://openalex.org/W2019496807","https://openalex.org/W2032401773","https://openalex.org/W2046814629","https://openalex.org/W2063799188","https://openalex.org/W2078620789","https://openalex.org/W2080267935","https://openalex.org/W2099800340","https://openalex.org/W2103780026","https://openalex.org/W2104696223","https://openalex.org/W2129554014","https://openalex.org/W2133491672","https://openalex.org/W2139498362","https://openalex.org/W2146381930","https://openalex.org/W2159952265","https://openalex.org/W2165499617","https://openalex.org/W2167003842","https://openalex.org/W2167366517","https://openalex.org/W2190212846","https://openalex.org/W2195169990","https://openalex.org/W2278409140","https://openalex.org/W2294467636","https://openalex.org/W2491060903","https://openalex.org/W2534303543","https://openalex.org/W2610996097","https://openalex.org/W2949298199","https://openalex.org/W4245640662","https://openalex.org/W7071761065"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2360647157","https://openalex.org/W2803843036","https://openalex.org/W1591638986","https://openalex.org/W2542904743","https://openalex.org/W1583869287","https://openalex.org/W2078737901","https://openalex.org/W2471151559","https://openalex.org/W2611966366","https://openalex.org/W2584649593"],"abstract_inverted_index":{"Decision":[0],"diagrams":[1],"are":[2],"used":[3],"in":[4],"symbolic":[5,14],"verification":[6,15],"to":[7,67,120],"concisely":[8],"represent":[9],"state":[10],"spaces.":[11],"A":[12],"crucial":[13],"algorithm":[16],"is":[17,36,107],"reachability:":[18],"systematically":[19],"exploring":[20],"all":[21,75,99,144],"reachable":[22],"system":[23],"states.":[24],"Although":[25],"both":[26],"parallel":[27],"and":[28,91],"distributed":[29,84],"reachability":[30,43],"algorithms":[31,44,55,127],"exist,":[32],"a":[33,83,111],"combined":[34],"solution":[35],"relatively":[37],"unexplored.":[38],"This":[39],"paper":[40],"contributes":[41],"BDD-based":[42],"targeting":[45],"compute":[46,139],"clusters:":[47],"high-performance":[48],"networks":[49],"of":[50,61,114,135],"multi-core":[51],"machines.":[52,124],"The":[53,105,125],"proposed":[54,126],"may":[56],"use":[57],"the":[58,101,132],"entire":[59],"memory":[60,137],"every":[62],"machine,":[63],"allowing":[64],"larger":[65],"models":[66],"be":[68],"processed":[69],"while":[70],"increasing":[71],"performance":[72],"by":[73],"using":[74],"available":[76,136,145],"computational":[77,146],"power.":[78],"To":[79],"do":[80],"this":[81],"effectively,":[82],"hash":[85],"table,":[86],"cluster-based":[87],"work":[88],"stealing":[89],"algorithms,":[90],"several":[92],"caching":[93],"structures":[94],"have":[95],"been":[96],"designed":[97],"that":[98],"utilise":[100],"newest":[102],"networking":[103],"technology.":[104],"approach":[106],"evaluated":[108],"extensively":[109],"on":[110,138],"large":[112,133],"collection":[113],"models,":[115],"thereby":[116],"demonstrating":[117],"speedups":[118],"up":[119],"51,1x":[121],"with":[122],"32":[123],"not":[128],"only":[129],"benefit":[130],"from":[131,143],"amounts":[134],"clusters,":[140],"but":[141],"also":[142],"resources.":[147]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}