{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:08:38Z","timestamp":1776305318639,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643539","type":"print"},{"value":"9783030643546","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64354-6_13","type":"book-chapter","created":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T09:12:03Z","timestamp":1607418723000},"page":"313-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SymPaths: Symbolic Execution Meets Partial Order Reduction"],"prefix":"10.1007","author":[{"given":"Frank S.","family":"de Boer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3746-3618","authenticated-orcid":false,"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5382-3949","authenticated-orcid":false,"given":"Einar Broch","family":"Johnsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8763-5548","authenticated-orcid":false,"given":"Violet Ka I","family":"Pun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9948-2748","authenticated-orcid":false,"given":"S. Lizeth","family":"Tapia Tarifa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Tveito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"issue":"7","key":"13_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Ahrendt, W., Beckert, B., Bubel, R., H\u00e4hnle, R., Schmitt, P.H., Ulbrich, M. (eds.).: Deductive Software Verification - The KeY Book - From Theory to Practice, LNCS, vol. 10001. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-319-49812-6"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"50:1","DOI":"10.1145\/3182657","volume":"51","author":"R Baldoni","year":"2018","unstructured":"Baldoni, R., Coppa, E., D\u2019Elia, D.C., Demetrescu, C., Finocchi, I.: A survey of symbolic execution techniques. ACM Comput. Surv. 51(3), 50:1\u201350:39 (2018)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C Cadar","year":"2013","unstructured":"Cadar, C., Sen, K.: Symbolic execution for software testing: three decades later. Commun. ACM 56(2), 82\u201390 (2013)","journal-title":"Commun. ACM"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: Sarkar, V., Hall, M.W. (eds.) Proceedings ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u20192005), pp. 213\u2013223. ACM (2005)","DOI":"10.1145\/1064978.1065036"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Cadar, C., Ganesh, V., Pawlowski, P.M., Dill, D.L., Engler, D.R.: EXE: automatically generating inputs of death. In: Juels, A., Wright, R.N., di Vimercati, S.D.C. (eds.) Proceedings 13th ACM Conference on Computer and Communications Security (CCS\u20192006), pp. 322\u2013335. ACM (2006)","DOI":"10.1145\/1180405.1180445"},{"key":"13_CR7","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: Draves, R., van Renesse, R. (eds.) Proceedings 8th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2008), pp. 209\u2013224. USENIX Association (2008)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-30942-8_6","volume-title":"Formal Methods \u2013 The Next 30 Years","author":"FS de Boer","year":"2019","unstructured":"de Boer, F.S., Bonsangue, M.M.: On the nature of symbolic execution. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) FM 2019. LNCS, vol. 11800, pp. 64\u201380. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8_6"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","year":"1996","unstructured":"Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60761-7"},{"key":"13_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (October Foundations of Computing), Cambridge (2000)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71999-1","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71999-1"},{"key":"13_CR12","volume-title":"Model Checking","author":"EM Clarke","year":"2011","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2011)"},{"key":"13_CR13","volume-title":"Concurrent Programming - Principles and Practice","author":"GR Andrews","year":"1991","unstructured":"Andrews, G.R.: Concurrent Programming - Principles and Practice. Benjamin\/Cummings, San Francisco (1991)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"SS Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Inf. 6, 319\u2013340 (1976)","journal-title":"Acta Inf."},{"key":"13_CR15","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-745-5","volume-title":"Verification of Sequential and Concurrent Programs","author":"KR Apt","year":"2009","unstructured":"Apt, K.R., de Boer, F.S., Olderog, E.: Verification of Sequential and Concurrent Programs. Texts in Computer Science. Springer, Heidelberg (2009)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ic.2013.08.004","volume":"231","author":"J Meseguer","year":"2013","unstructured":"Meseguer, J., Rosu, G.: The rewriting logic semantics project: a progress report. Inf. Comput. 231, 38\u201369 (2013)","journal-title":"Inf. Comput."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-25271-6_8","volume-title":"Formal Methods for Components and Objects","author":"EB Johnsen","year":"2011","unstructured":"Johnsen, E.B., H\u00e4hnle, R., Sch\u00e4fer, J., Schlatte, R., Steffen, M.: ABS: a core language for abstract behavioral specification. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol. 6957, pp. 142\u2013164. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25271-6_8"},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1007\/s10270-014-0446-9","volume":"15","author":"S de Gouw","year":"2016","unstructured":"de Gouw, S., de Boer, F.S., Ahrendt, W., Bubel, R.: Integrating deductive verification and symbolic execution for abstract object creation in dynamic logic. Softw. Syst. Modeling 15(4), 1117\u20131140 (2016)","journal-title":"Softw. Syst. Modeling"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Steele, G.L.: Making asynchronous parallelism safe for the world. In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1990), pp. 218\u2013231. ACM (1989)","DOI":"10.1145\/96709.96731"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Li, Y., Su, Z., Wang, L., Li, X.: Steering symbolic execution to less traveled paths. In: Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA 2013), pp. 19\u201332. ACM (2013)","DOI":"10.1145\/2544173.2509553"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Guo, S., Kusano, M., Wang, C., Yang, Z., Gupta, A.: Assertion guided symbolic execution of multithreaded programs. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering (ESEC\/FSE 2015), pp. 854\u2013865. ACM (2015)","DOI":"10.1145\/2786805.2786841"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Kuznetsov, V., Kinder, J., Bucur, S., Candea, G.: Efficient state merging in symbolic execution. In Vitek, J., Lin, H., Tip, F. (eds.) Proceedings ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u20192012), pp. 193\u2013204. ACM (2012)","DOI":"10.1145\/2345156.2254088"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-47846-3_5","volume-title":"Formal Methods and Software Engineering","author":"D Scheurer","year":"2016","unstructured":"Scheurer, D., H\u00e4hnle, R., Bubel, R.: A general lattice model for merging symbolic execution branches. In: Ogata, K., Lawford, M., Liu, S. (eds.) ICFEM 2016. LNCS, vol. 10009, pp. 57\u201373. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47846-3_5"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-78800-3_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Boonstoppel","year":"2008","unstructured":"Boonstoppel, P., Cadar, C., Engler, D.: RWset: attacking path explosion in constraint-based test generation. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 351\u2013366. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_27"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2005), pp. 110\u2013121. ACM (2005)","DOI":"10.1145\/1047659.1040315"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Khurshid, S., Pasareanu, C.S., Visser, W.: Generalized symbolic execution for model checking and testing. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 553\u2013568. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_40","DOI":"10.1007\/3-540-36577-X_40"},{"key":"13_CR27","unstructured":"Visser, W., Pasareanu, C.S., Khurshid, S.: Test input generation with Java PathFinder. SIGSOFT Softw. Eng. Notes 29(4), 97\u2013107 (2004)"},{"key":"13_CR28","unstructured":"Bruns, D.: Deductive verification of concurrent programs. Technical Report 3, Karlsruher Institut f\u00fcr Technologie (KIT) (2015)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Beckert, B., Klebanov, V.: A dynamic logic for deductive verification of concurrent programs. In: Proceedings Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), pp. 141\u2013150. IEEE Computer Society (2007)","DOI":"10.1109\/SEFM.2007.1"},{"issue":"12","key":"13_CR30","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1016\/j.scico.2010.08.003","volume":"77","author":"W Ahrendt","year":"2012","unstructured":"Ahrendt, W., Dylla, M.: A system for compositional verification of asynchronous objects. Sci. Comput. Program. 77(12), 1289\u20131309 (2012)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2006.07.031","volume":"365","author":"EB Johnsen","year":"2006","unstructured":"Johnsen, E.B., Owe, O., Yu, I.C.: Creol: a type-safe object-oriented model for distributed concurrent systems. Theoretical Comput. Sci. 365(1), 23\u201366 (2006)","journal-title":"Theoretical Comput. Sci."},{"issue":"3","key":"13_CR32","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.entcs.2008.04.084","volume":"203","author":"J Dovland","year":"2008","unstructured":"Dovland, J., Johnsen, E.B., Owe, O.: Observable behavior of dynamic systems: component reasoning for concurrent objects. Electr. Notes Theor. Comput. Sci. 203(3), 19\u201334 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Concurrent dynamic logic. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing (STOC 1985), pp. 232\u2013239. ACM (1985)","DOI":"10.1145\/22145.22172"},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0022-0000(87)90035-3","volume":"35","author":"D Peleg","year":"1987","unstructured":"Peleg, D.: Communication in concurrent dynamic logic. J. Comput. Syst. Sci. 35(1), 23\u201358 (1987)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"13_CR35","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1093\/logcom\/exu001","volume":"24","author":"MRF Benevides","year":"2014","unstructured":"Benevides, M.R.F., Schechter, L.M.: Propositional dynamic logics for communicating concurrent programs with CCS\u2019s parallel operator. J. Log. Comput. 24(4), 919\u2013951 (2014)","journal-title":"J. Log. Comput."}],"container-title":["Lecture Notes in Computer Science","Deductive Software Verification: Future Perspectives"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64354-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T09:23:54Z","timestamp":1607419434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64354-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643539","9783030643546"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64354-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}