{"id":"https://openalex.org/W2017560506","doi":"https://doi.org/10.1016/s1571-0661(05)80096-9","title":"Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking","display_name":"Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W2017560506","doi":"https://doi.org/10.1016/s1571-0661(05)80096-9","mag":"2017560506"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80096-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80096-9","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/s1571-0661(05)80096-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004637914","display_name":"Hemanthkumar Sivaraj","orcid":null},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hemanthkumar Sivaraj","raw_affiliation_strings":["School of Computing, University of Utah, Salt Lake City, USA","[School of Computing, University of Utah, Salt Lake City, USA]"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Utah, Salt Lake City, USA","institution_ids":["https://openalex.org/I223532165"]},{"raw_affiliation_string":"[School of Computing, University of Utah, Salt Lake City, USA]","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069846379","display_name":"Ganesh Gopalakrishnan","orcid":"https://orcid.org/0000-0002-3705-0031"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ganesh Gopalakrishnan","raw_affiliation_strings":["School of Computing, University of Utah, Salt Lake City, USA","[School of Computing, University of Utah, Salt Lake City, USA]"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Utah, Salt Lake City, USA","institution_ids":["https://openalex.org/I223532165"]},{"raw_affiliation_string":"[School of Computing, University of Utah, Salt Lake City, USA]","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004637914","https://openalex.org/A5069846379"],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":3.9979,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.93924685,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"89","issue":"1","first_page":"51","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9965000152587891,"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"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9962000250816345,"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/computer-science","display_name":"Computer science","score":0.7948182821273804},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6483948230743408},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5783849358558655},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5087860226631165},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.4713798463344574},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47053131461143494},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.455729603767395},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4411279559135437},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4383566379547119},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.4126688539981842},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36382678151130676},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3402659296989441}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7948182821273804},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6483948230743408},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5783849358558655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5087860226631165},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.4713798463344574},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47053131461143494},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.455729603767395},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4411279559135437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4383566379547119},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.4126688539981842},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36382678151130676},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3402659296989441},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(05)80096-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80096-9","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:CiteSeerX.psu:10.1.1.57.7817","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utah.edu/formal_verification/papers/heur-algo-tr.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80096-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80096-9","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.7099999785423279,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":70,"referenced_works":["https://openalex.org/W27540423","https://openalex.org/W101041452","https://openalex.org/W107427404","https://openalex.org/W195082763","https://openalex.org/W781716309","https://openalex.org/W1481204670","https://openalex.org/W1483156373","https://openalex.org/W1548312885","https://openalex.org/W1548575501","https://openalex.org/W1606518252","https://openalex.org/W1779513555","https://openalex.org/W1812552228","https://openalex.org/W1853488118","https://openalex.org/W1877700846","https://openalex.org/W1943389500","https://openalex.org/W1977553951","https://openalex.org/W2012935476","https://openalex.org/W2034717157","https://openalex.org/W2075648419","https://openalex.org/W2081612620","https://openalex.org/W2085467310","https://openalex.org/W2099800340","https://openalex.org/W2115309705","https://openalex.org/W2130160529","https://openalex.org/W2132536544","https://openalex.org/W2135274583","https://openalex.org/W2138620071","https://openalex.org/W2139808952","https://openalex.org/W2140735019","https://openalex.org/W2142785340","https://openalex.org/W2144690539","https://openalex.org/W2147348835","https://openalex.org/W2150119568","https://openalex.org/W2151759383","https://openalex.org/W2160083957","https://openalex.org/W2164309760","https://openalex.org/W2166158916","https://openalex.org/W2340735175","https://openalex.org/W2911748474","https://openalex.org/W2913459036","https://openalex.org/W2993781365","https://openalex.org/W3023634467","https://openalex.org/W3106729728","https://openalex.org/W3143282417","https://openalex.org/W4233598191","https://openalex.org/W4245759828","https://openalex.org/W4247198202","https://openalex.org/W4252943619","https://openalex.org/W4255617522","https://openalex.org/W4285719527","https://openalex.org/W6604135326","https://openalex.org/W6604475571","https://openalex.org/W6628868688","https://openalex.org/W6632912903","https://openalex.org/W6632997174","https://openalex.org/W6636258597","https://openalex.org/W6638074035","https://openalex.org/W6640823978","https://openalex.org/W6644794711","https://openalex.org/W6669268801","https://openalex.org/W6670589389","https://openalex.org/W6674731515","https://openalex.org/W6675354986","https://openalex.org/W6680437755","https://openalex.org/W6680816814","https://openalex.org/W6682096543","https://openalex.org/W6683339133","https://openalex.org/W6684185353","https://openalex.org/W6814292443","https://openalex.org/W6838106491"],"related_works":["https://openalex.org/W2097286495","https://openalex.org/W2080388000","https://openalex.org/W2065331859","https://openalex.org/W2155123971","https://openalex.org/W1897694601","https://openalex.org/W1845395494","https://openalex.org/W2144265691","https://openalex.org/W1835589799","https://openalex.org/W1605991620","https://openalex.org/W4385261619"],"abstract_inverted_index":{"We":[0,92,222,306,316],"explore":[1,224],"the":[2,9,40,53,76,94,115,128,138,144,147,158,164,173,176,179,195,276,285,344],"use":[3,342],"of":[4,11,78,97,104,130,140,167,175,187,211,237,249,267,343],"distributed":[5,98,205,347],"processing":[6,41],"to":[7,25,46,71,260,269,274,279,300,319,325,336,340],"enhance":[8],"performance":[10],"explicit":[12],"state":[13,31,48,141,197],"enumeration":[14,19],"based":[15,20],"safety":[16,79,119],"model-checking.":[17],"State":[18],"model-checkers":[21,35],"employ":[22,93,317],"a":[23,30,102,161,246,280],"hash-table":[24,250],"cut":[26],"off":[27],"search":[28,239,256],"when":[29],"is":[32],"revisited.":[33],"Distributed":[34],"distribute":[36],"this":[37,66,289],"table":[38],"across":[39],"nodes,":[42],"employing":[43],"inter-node":[44],"messages":[45],"perform":[47],"lookups.":[49],"This":[50,125],"approach":[51],"incurs":[52],"following":[54],"penalties:":[55],"hashing":[56],"states,":[57],"looking":[58,117],"up":[59,318],"hash-tables,":[60],"and":[61,108,134,215,241,252],"possibly":[62],"exchanging":[63],"messages.":[64],"In":[65,288],"paper,":[67,290],"we":[68,291],"study":[69,293],"how":[70],"avoid":[72],"these":[73,294],"penalties":[74],"in":[75,109],"context":[77],"model-checking,":[80],"assuming":[81],"that":[82,160,207,226,244,323],"completeness":[83],"can":[84,169],"be":[85,190,326],"sacrificed":[86],"(acceptable":[87],"for":[88,118,204],"quick":[89],"error":[90],"detection).":[91],"basic":[95],"strategy":[96],"random":[99],"walk":[100],"-":[101],"process":[103,126],"multiple":[105],"processors":[106],"randomly,":[107],"an":[110],"uncoordinated":[111],"fashion,":[112],"moving":[113],"through":[114],"state-space":[116],"violations,":[120],"without":[121],"recording":[122],"visited":[123],"states.":[124],"has":[127,284],"potential":[129],"maximizing":[131],"CPU":[132],"utilization,":[133],"consequently":[135],"greatly":[136],"increase":[137],"rate":[139],"generation,":[142],"as":[143,150,152,314],"pressure":[145],"on":[146,297,310],"memory":[148,212,268],"system":[149],"well":[151],"communication":[153],"network":[154],"are":[155,202,216,258],"minimal.":[156],"Moreover,":[157],"probability":[159],"randomwalk":[162],"repeats":[163],"same":[165],"sequence":[166],"moves":[168],"decrease":[170],"exponentially":[171],"with":[172],"length":[174],"sequence;":[177],"thus,":[178],"work":[180],"wasted":[181],"by":[182,194,218,233],"occasionally":[183],"repeating":[184],"short":[185],"sequences":[186],"searches":[188],"may":[189],"more":[191],"than":[192],"offset":[193],"increased":[196],"generation":[198],"rate.":[199],"Our":[200,331],"choices":[201],"ideal":[203],"systems":[206],"have":[208],"low":[209,219],"amounts":[210,266],"per":[213],"node,":[214],"interconnected":[217],"bandwidth":[220],"networks.":[221],"also":[223],"techniques":[225],"backoff":[227],"slightly":[228],"from":[229],"our":[230,341],"extremal":[231],"choices,":[232],"exploring":[234],"heuristic":[235,295],"combinations":[236],"breadth-first":[238],"(BFS)":[240],"random-walk":[242],"(RW)":[243],"require":[245],"modest":[247],"amount":[248],"lookup":[251],"message":[253],"exchanges.":[254],"These":[255],"methods":[257,296],"natural":[259],"combine,":[261],"since":[262],"BFS":[263],"requires":[264],"higher":[265],"maintain":[270],"queues,":[271],"but":[272],"guarantees":[273],"find":[275],"shortest":[277],"path":[278],"state,":[281],"while":[282],"RW":[283],"opposite":[286],"characteristics.":[287],"first":[292],"synthetic":[298],"benchmarks":[299],"gain":[301],"sharper":[302],"(more":[303],"quantifiable)":[304],"insights.":[305],"then":[307],"conduct":[308],"studies":[309],"some":[311],"realistic":[312],"examples":[313],"well.":[315],"10":[320],"single-processor":[321],"CPUs":[322],"happen":[324],"connected":[327],"via":[328],"100BASE-T":[329],"Ethernets.":[330],"code":[332],"was":[333],"easily":[334],"ported":[335],"other":[337],"platforms,":[338],"thanks":[339],"popular":[345],"MPI":[346],"programming":[348],"library.":[349]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}