{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:41:50Z","timestamp":1761964910849,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631202"},{"type":"electronic","value":"9783319631219"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63121-9_26","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T04:05:15Z","timestamp":1500869115000},"page":"516-536","source":"Crossref","is-referenced-by-count":5,"title":["Comparing Source Sets and Persistent Sets for Partial Order Reduction"],"prefix":"10.1007","author":[{"given":"Parosh","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Stavros","family":"Aronis","sequence":"additional","affiliation":[]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[]},{"given":"Konstantinos","family":"Sagonas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-662-46681-0_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2015","unstructured":"Abdulla, P.A., Aronis, S., Atig, M.F., Jonsson, B., Leonardsson, C., Sagonas, K.: Stateless model checking for TSO and PSO. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 353\u2013367. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46681-0_28"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Aronis, S., Jonsson, B., Sagonas, K.: Optimal dynamic partial order reduction. In: Proceeedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, pp. 373\u2013384. ACM, New York (2014)","DOI":"10.1145\/2535838.2535845"},{"key":"26_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"CONCUR\u201998 Concurrency Theory","author":"J Bengtsson","year":"1998","unstructured":"Bengtsson, J., Jonsson, B., Lilius, J., Yi, W.: Partial order reductions for timed systems. In: Sangiorgi, D., Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 485\u2013500. Springer, Heidelberg (1998). doi: 10.1007\/BFb0055643"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0020949","volume-title":"Hybrid Systems III","author":"J Bengtsson","year":"1996","unstructured":"Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W.: UPPAAL \u2014 a tool suite for automatic verification of real-time systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 232\u2013243. Springer, Heidelberg (1996). doi: 10.1007\/BFb0020949"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logics specification: a practical approach. In: Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, pp. 117\u2013126. ACM Press (1983). http:\/\/doi.acm.org\/10.1145\/567067.567080","DOI":"10.1145\/567067.567080"},{"issue":"3","key":"26_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s100090050035","volume":"2","author":"EM Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Minea, M., Peled, D.: State space reduction using partial order techniques. Int. J. Softw. Tools Technol. Transf. 2(3), 279\u2013287 (1999). http:\/\/dx.doi.org\/10.1007\/s100090050035","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"26_CR8","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 (2005). http:\/\/doi.acm.org\/10.1145\/1040305.1040315","DOI":"10.1145\/1040305.1040315"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem. Ph.D. thesis, University of Li\u00e8ge (1996). Also, vol. 1032 of LNCS, Springer","DOI":"10.1007\/3-540-60761-7"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-55179-4_32","volume-title":"Computer Aided Verification","author":"P Godefroid","year":"1992","unstructured":"Godefroid, P., Wolper, P.: Using partial orders for the efficient verification of deadlock freedom and safety properties. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 332\u2013342. Springer, Heidelberg (1992). doi: 10.1007\/3-540-55179-4_32"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Holzmann, G.: The model checker SPIN. IEEE Trans. Softw. Eng. SE-23(5), 279\u2013295 (1997)","DOI":"10.1109\/32.588521"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Huang, J.: Stateless model checking concurrent programs with maximal causality reduction. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2015, pp. 165\u2013174. ACM, New York (2015). http:\/\/doi.acm.org\/10.1145\/2737924.2737975","DOI":"10.1145\/2737924.2737975"},{"issue":"4","key":"26_CR13","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10515-014-0150-6","volume":"22","author":"K K\u00e4hk\u00f6nen","year":"2015","unstructured":"K\u00e4hk\u00f6nen, K., Saarikivi, O., Heljanko, K.: Unfolding based automated testing of multithreaded programs. Autom. Softw. Eng. 22(4), 475\u2013515 (2015). http:\/\/dx.doi.org\/10.1007\/s10515-014-0150-6","journal-title":"Autom. Softw. Eng."},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-12029-9_22","volume-title":"Fundamental Approaches to Software Engineering","author":"S Lauterburg","year":"2010","unstructured":"Lauterburg, S., Karmani, R.K., Marinov, D., Agha, G.: Evaluating ordering heuristics for dynamic partial-order reduction techniques. In: Rosenblum, D.S., Taentzer, G. (eds.) FASE 2010. LNCS, vol. 6013, pp. 308\u2013322. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12029-9_22"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-17906-2_30","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"A Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278\u2013324. Springer, Heidelberg (1987). doi: 10.1007\/3-540-17906-2_30"},{"issue":"1","key":"26_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"KL McMillan","year":"1995","unstructured":"McMillan, K.L., Probst, D.K.: A technique of a state space search based on unfolding. Form. Methods Syst. Des. 6(1), 45\u201365 (1995)","journal-title":"Form. Methods Syst. Des."},{"key":"26_CR17","unstructured":"Overman, W.: Verification of concurrent systems: function and timing. Ph.D. thesis, UCLA, August 1981"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409\u2013423. Springer, Heidelberg (1993). doi: 10.1007\/3-540-56922-7_34"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"JP Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 337\u2013351. Springer, Heidelberg (1982). doi: 10.1007\/3-540-11494-7_22"},{"key":"26_CR20","unstructured":"Rodr\u00edguez, C., Sousa, M., Sharma, S., Kroening, D.: Unfolding-based partial order reduction. In: 26th International Conference on Concurrency Theory, CONCUR 2015. LIPIcs, vol. 42, pp. 456\u2013469. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). http:\/\/dx.doi.org\/10.4230\/LIPIcs.CONCUR.2015.456"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Saarikivi, O., K\u00e4hk\u00f6nen, K., Heljanko, K.: Improving dynamic partial order reductions for concolic testing. In: 12th International Conference on Application of Concurrency to System Design (ACSD), pp. 132\u2013141. IEEE, Los Alamitos, June 2012","DOI":"10.1109\/ACSD.2012.18"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11817949_31","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"RB Salah","year":"2006","unstructured":"Salah, R.B., Bozga, M., Maler, O.: On interleaving in timed automata. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 465\u2013476. Springer, Heidelberg (2006). doi: 10.1007\/11817949_31"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11693017_25","volume-title":"Fundamental Approaches to Software Engineering","author":"K Sen","year":"2006","unstructured":"Sen, K., Agha, G.: Automated systematic testing of open distributed programs. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 339\u2013356. Springer, Heidelberg (2006). doi: 10.1007\/11693017_25"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-70889-6_13","volume-title":"Hardware and Software, Verification and Testing","author":"K Sen","year":"2007","unstructured":"Sen, K., Agha, G.: A race-detection and flipping algorithm for automated testing of multi-threaded programs. In: Bin, E., Ziv, A., Ur, S. (eds.) HVC 2006. LNCS, vol. 4383, pp. 166\u2013182. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-70889-6_13"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-35632-2_16","volume-title":"Runtime Verification","author":"TF \u015eerb\u0103nu\u0163\u0103","year":"2013","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.F., Chen, F., Ro\u015fu, G.: Maximal Causal Models for Sequentially Consistent Systems. In: Qadeer, S., Tasiran, S. (eds.) RV 2012. LNCS, vol. 7687, pp. 136\u2013150. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-35632-2_16"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-30793-5_14","volume-title":"Formal Techniques for Distributed Systems","author":"S Tasharofi","year":"2012","unstructured":"Tasharofi, S., Karmani, R.K., Lauterburg, S., Legay, A., Marinov, D., Agha, G.: TransDPOR: a novel dynamic partial-order reduction technique for testing actor programs. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE -2012. LNCS, vol. 7273, pp. 219\u2013234. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-30793-5_14"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) ICATPN 1989. LNCS, vol. 483, pp. 491\u2013515. Springer, Heidelberg (1991). doi: 10.1007\/3-540-53863-1_36"}],"container-title":["Lecture Notes in Computer Science","Models, Algorithms, Logics and Tools"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63121-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T09:29:49Z","timestamp":1569922189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63121-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631202","9783319631219"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63121-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}