{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:49:47Z","timestamp":1767995387698,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319929699","type":"print"},{"value":"9783319929705","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92970-5_8","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T08:54:12Z","timestamp":1527584052000},"page":"123-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Monte Carlo Tree Search for Finding Costly Paths in Programs"],"prefix":"10.1007","author":[{"given":"Kasper","family":"Luckow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corina S.","family":"P\u0103s\u0103reanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem","family":"Visser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., Powley, E., Whitehouse, D., Lucas, S.M., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Burnim, J., Juvekar, S., Sen, K.: Wise: automated test generation for worst-case complexity. In: IEEE 31st International Conference on Software Engineering, ICSE 2009, pp. 463\u2013473, May 2009","DOI":"10.1109\/ICSE.2009.5070545"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-642-74688-8_10","volume-title":"5. \u00d6sterreichische Artificial-Intelligence-Tagung","author":"W Ertel","year":"1989","unstructured":"Ertel, W., Schumann, J.M.P., Suttner, C.B.: Learning heuristics for a theorem prover using back propagation. In: Retti, J., Leidlmair, K. (eds.) 5. \u00d6sterreichische Artificial-Intelligence-Tagung, pp. 87\u201395. Springer, Heidelberg (1989)"},{"key":"8_CR4","unstructured":"Kocsis, L., Szepesv\u00e1ri, C., Willemson, J.: Improved Monte-Carlo search. University Tartu, Estonia, Technical report, 1 (2006)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/978-3-319-47106-8_27","volume-title":"Search Based Software Engineering","author":"J Lim","year":"2016","unstructured":"Lim, J., Yoo, S.: Field report: applying Monte Carlo Tree Search for program synthesis. In: Sarro, F., Deb, K. (eds.) SSBSE 2016. LNCS, pp. 304\u2013310. Springer, Cham (2016)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Luckow, K., Kersten, R., P\u0103s\u0103reanu, C.: Symbolic complexity analysis using context-preserving histories. In: 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST), pp. 58\u201368, March 2017","DOI":"10.1109\/ICST.2017.13"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Luckow, K., P\u0103s\u0103reanu, C.S., Dwyer, M.B., Filieri, A., Visser, W.: Exact and approximate probabilistic symbolic execution for nondeterministic programs. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering, ASE 2014, pp. 575\u2013586, New York, NY, USA. ACM (2014)","DOI":"10.1145\/2642937.2643011"},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/stvr.294","volume":"14","author":"P McMinn","year":"2004","unstructured":"McMinn, P.: Search-based software test data generation: a survey: research articles. Softw. Test. Verification Reliab. 14(2), 105\u2013156 (2004)","journal-title":"Softw. Test. Verification Reliab."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10515-013-0122-2","volume":"20","author":"CS Pasareanu","year":"2013","unstructured":"Pasareanu, C.S., Visser, W., Bushnell, D.H., Geldenhuys, J., Mehlitz, P.C., Rungta, N.: Symbolic pathfinder: integrating symbolic execution with model checking for Java bytecode analysis. Autom. Softw. Eng. 20, 391\u2013425 (2013)","journal-title":"Autom. Softw. Eng."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Poulding, S., Feldt, R.: Heuristic model checking using a Monte-Carlo Tree Search Algorithm. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1359\u20131366, New York, NY, USA. ACM (2015)","DOI":"10.1145\/2739480.2754767"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Shen, D., Luo, Q., Poshyvanyk, D., Grechanik, M.: Automating performance bottleneck detection using search-based application profiling. In: Proceedings of the 2015 International Symposium on Software Testing and Analysis, ISSTA 2015, pp. 270\u2013281, New York, NY, USA. ACM (2015)","DOI":"10.1145\/2771783.2771816"},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., Huang, A., Maddison, C.J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., Dieleman, S., Grewe, D., Nham, J., Kalchbrenner, N., Sutskever, I., Lillicrap, T., Leach, M., Kavukcuoglu, K., Graepel, T., Hassabis, D.: Mastering the game of go with deep neural networks and tree search. Nature 529, 484\u2013503 (2016)","journal-title":"Nature"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"White, D.R., Yoo, S., Singer, J.: The programming game: evaluating MCTS as an alternative to GP for symbolic regression. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1521\u20131522, New York, NY, USA. ACM (2015)","DOI":"10.1145\/2739482.2764655"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, P., Elbaum, S.G., Dwyer, M.B.: Automatic generation of load tests. In: 26th IEEE\/ACM International Conference on Automated Software Engineering (ASE 2011), Lawrence, KS, USA, 6\u201310 November 2011, pp. 43\u201352 (2011)","DOI":"10.1109\/ASE.2011.6100093"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92970-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T15:23:32Z","timestamp":1571412212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92970-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319929699","9783319929705"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92970-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}