{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:32Z","timestamp":1750221272858,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T00:00:00Z","timestamp":1515628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSOFT Softw. Eng. Notes"],"published-print":{"date-parts":[[2018,1,11]]},"abstract":"<jats:p>The future of model checking lies in parallel and distributed computing, but parallel graph search algorithms tailored to directed model checking remains an underdeveloped area of research. In this work, we examine the application of parallel Monte Carlo Tree Search algorithms. We demonstrate how exploratory, randomly sampled rollouts of the search space, coordinated through a minimally communicating work-sharing protocol, can enable us to push the boundaries on the scope and scale of problems amenable to serial search.<\/jats:p>","DOI":"10.1145\/3149485.3149495","type":"journal-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T13:49:50Z","timestamp":1515764990000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Scalable Parallel Model Checking via Monte-Carlo Tree Search"],"prefix":"10.1145","volume":"42","author":[{"given":"Reed M.","family":"Milewicz","sequence":"first","affiliation":[{"name":"Sandia National Laboratories 1451 Innovation Pkwy SE Albuquerque, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Poulding","sequence":"additional","affiliation":[{"name":"Software Engineering Research Lab Blekinge Institute of Technology Karlskrona"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_2_1_2_1","first-page":"C2","article-title":"Why software is eating the world","volume":"20","author":"Andreessen Marc","year":"2011","journal-title":"The Wall Street Journal"},{"key":"e_1_2_1_3_1","first-page":"12","article-title":"Alphago beats human go champ in milestone for artificial intelligence","author":"Borowiec S","year":"2016","journal-title":"Los Angeles Times"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJCCBS.2012.045076"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"volume-title":"Coping with the state explosion problem in formal methods: Advanced abstraction techniques and big data approaches","year":"2015","author":"Camilli Matteo","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","first-page":"456","volume-title":"Proc. 21st Int'l Joint Conf. Arti cial Intelligence (IJCAI)","author":"Cazenave Tristan","year":"2009"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_6"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.11.015"},{"key":"e_1_2_1_10_1","first-page":"72","volume-title":"International Conference on Computers and Games","author":"Coulom R\u00e9mi","year":"2006"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-005-3861-2"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.62"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382756.2382799"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/566171.566175"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_18"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70724"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_11"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2088123"},{"key":"e_1_2_1_19_1","first-page":"442","volume-title":"2017 IEEE International Conference on","author":"Milewicz Reed","year":"2017"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081180.1081193"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754767"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11334-013-0196-9"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1831708.1831732"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2010.24"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008771324652"}],"container-title":["ACM SIGSOFT Software Engineering Notes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149485.3149495","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3149485.3149495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:07Z","timestamp":1750212667000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149485.3149495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,11]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,1,11]]}},"alternative-id":["10.1145\/3149485.3149495"],"URL":"https:\/\/doi.org\/10.1145\/3149485.3149495","relation":{},"ISSN":["0163-5948"],"issn-type":[{"type":"print","value":"0163-5948"}],"subject":[],"published":{"date-parts":[[2018,1,11]]},"assertion":[{"value":"2018-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}