{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:50:40Z","timestamp":1761562240302},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"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-59647-1_20","type":"book-chapter","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:53:30Z","timestamp":1494629610000},"page":"255-271","source":"Crossref","is-referenced-by-count":4,"title":["Concurrent Program Verification with Lazy Sequentialization and Interval Analysis"],"prefix":"10.1007","author":[{"given":"Truc L.","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Bernd","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Salvatore","family":"La Torre","sequence":"additional","affiliation":[]},{"given":"Gennaro","family":"Parlato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Agesen, O., Detlefs, D., Flood, C.H., Garthwaite, A., Martin, P.A., Shavit, N., Steele Jr., G.L.: Dcas-based concurrent deques. In: SPAA, pp. 137\u2013146 (2000)","DOI":"10.1145\/341800.341817"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Canet, G., Cuoq, P., Monate, B.: A value analysis for C programs. In: SPAA, pp. 123\u2013124 (2009)","DOI":"10.1109\/SCAM.2009.22"},{"key":"20_CR3","unstructured":"Chaki, S., Gurfinkel, A., Strichman, O.: Time-bounded analysis of real-time systems. In: FMCAD, pp. 72\u201380 (2011)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10515-013-0127-x","volume":"21","author":"O Chebaro","year":"2014","unstructured":"Chebaro, O., Cuoq, P., Kosmatov, N., Marre, B., Pacalet, A., Williams, N., Yakobowski, B.: Behind the scenes in SANTE: a combination of static and dynamic analyses. Autom. Softw. Eng. 21(1), 107\u2013143 (2014)","journal-title":"Autom. Softw. Eng."},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-21768-5_7","volume-title":"Tests and Proofs","author":"O Chebaro","year":"2011","unstructured":"Chebaro, O., Kosmatov, N., Giorgetti, A., Julliand, J.: The SANTE tool: value analysis, program slicing and test generation for C program debugging. In: Gogolla, M., Wolff, B. (eds.) TAP 2011. LNCS, vol. 6706, pp. 78\u201383. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21768-5_7"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24730-2_15"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"issue":"3","key":"20_CR8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10703-009-0089-6","volume":"35","author":"P Cousot","year":"2009","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Rival, X.: Why does astr\u00e9e scale up? Formal Methods Syst. Des. 35(3), 229\u2013264 (2009)","journal-title":"Formal Methods Syst. Des."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, B., Inverso, O., Parlato, G.: CSeq: a concurrency pre-processor for sequential C verification tools. In: ASE, pp. 710\u2013713 (2013)","DOI":"10.1109\/ASE.2013.6693139"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-36742-7_46","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Fischer","year":"2013","unstructured":"Fischer, B., Inverso, O., Parlato, G.: CSeq: a sequentialization tool for C. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 616\u2013618. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36742-7_46"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-16164-3_17","volume-title":"Model Checking Software","author":"N Ghafari","year":"2010","unstructured":"Ghafari, N., Hu, A.J., Rakamari\u0107, Z.: Context-bounded translations for concurrent software: an empirical evaluation. In: Pol, J., Weber, M. (eds.) SPIN 2010. LNCS, vol. 6349, pp. 227\u2013244. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16164-3_17"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: SPAA, pp. 206\u2013215. ACM (2004)","DOI":"10.1145\/1007912.1007944"},{"issue":"2","key":"20_CR13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/2560217.2560218","volume":"57","author":"GJ Holzmann","year":"2014","unstructured":"Holzmann, G.J.: Mars code. Commun. ACM 57(2), 64\u201373 (2014)","journal-title":"Commun. ACM"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49122-5_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"GJ Holzmann","year":"2016","unstructured":"Holzmann, G.J.: Cloud-based verification of concurrent software. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 311\u2013327. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49122-5_15"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Inverso, O., Nguyen, T.L., Fischer, B., La Torre, S., Parlato, G.: Lazy-cseq: a context-bounded model checking tool for multi-threaded c-programs. In: ASE, pp. 807\u2013812 (2015)","DOI":"10.1109\/ASE.2015.108"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-319-08867-9_39","volume-title":"Computer Aided Verification","author":"O Inverso","year":"2014","unstructured":"Inverso, O., Tomasco, E., Fischer, B., La Torre, S., Parlato, G.: Bounded model checking of multi-threaded C programs via lazy sequentialization. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 585\u2013602. Springer, Cham (2014). doi: 10.1007\/978-3-319-08867-9_39"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-54862-8_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Inverso","year":"2014","unstructured":"Inverso, O., Tomasco, E., Fischer, B., La Torre, S., Parlato, G.: Lazy-CSeq: a lazy sequentialization tool for C. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 398\u2013401. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54862-8_29"},{"key":"20_CR18","unstructured":"ISO\/IEC: Information technology\u2013portable operating system interface (POSIX) base specifications, Issue 7. ISO\/IEC\/IEEE 9945:2009 (2009)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Analyzing recursive programs using a fixed-point calculus. In: PLDI, pp. 211\u2013222 (2009)","DOI":"10.1145\/1542476.1542500"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-02658-4_36","volume-title":"Computer Aided Verification","author":"S La Torre","year":"2009","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Reducing context-bounded concurrent reachability to sequential reachability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 477\u2013492. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02658-4_36"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-642-14295-6_54","volume-title":"Computer Aided Verification","author":"S La Torre","year":"2010","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Model-checking parameterized concurrent programs using linear interfaces. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 629\u2013644. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14295-6_54"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Sequentializing parameterized programs. In: FIT, pp. 34\u201347 (2012)","DOI":"10.4204\/EPTCS.87.4"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-31424-7_32","volume-title":"Computer Aided Verification","author":"A Lal","year":"2012","unstructured":"Lal, A., Qadeer, S., Lahiri, S.K.: A solver for reachability modulo theories. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 427\u2013443. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31424-7_32"},{"key":"20_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10703-009-0078-9","volume":"1","author":"A Lal","year":"2009","unstructured":"Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods Syst. Des. 1, 73\u201397 (2009)","journal-title":"Formal Methods Syst. Des."},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-46520-3_12","volume-title":"Automated Technology for Verification and Analysis","author":"TL Nguyen","year":"2016","unstructured":"Nguyen, T.L., Fischer, B., La Torre, S., Parlato, G.: Lazy sequentialization for the safety verification of unbounded concurrent programs. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 174\u2013191. Springer, Cham (2016). doi: 10.1007\/978-3-319-46520-3_12"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-662-54580-5_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"TL Nguyen","year":"2017","unstructured":"Nguyen, T.L., Inverso, O., Fischer, B., La Torre, S., Parlato, G.: Lazy-CSeq 2.0: combining lazy sequentialization with abstract interpretation. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 375\u2013379. Springer, Heidelberg (2017). doi: 10.1007\/978-3-662-54580-5_26"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-21690-4_24","volume-title":"Computer Aided Verification","author":"M Oulamara","year":"2015","unstructured":"Oulamara, M., Venet, A.J.: Abstract interpretation with higher-dimensional ellipsoids and conic extrapolation. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 415\u2013430. Springer, Cham (2015). doi: 10.1007\/978-3-319-21690-4_24"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Post, H., Sinz, C., Kaiser, A., Gorges, T.: Reducing false positives by combining abstract interpretation and bounded model checking. In: ASE, pp. 188\u2013197 (2008)","DOI":"10.1109\/ASE.2008.29"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Qadeer, S., Wu, D.: KISS: keep it simple and sequential. In: PLDI, pp. 14\u201324 (2004)","DOI":"10.1145\/996841.996845"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Thomson, P., Donaldson, A.F., Betts, A.: Concurrency testing using schedule bounding: an empirical study. In: PPoPP, pp. 15\u201328 (2014)","DOI":"10.1145\/2555243.2555260"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-54862-8_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Tomasco","year":"2014","unstructured":"Tomasco, E., Inverso, O., Fischer, B., La Torre, S., Parlato, G.: MU-CSeq: sequentialization of C programs by shared memory unwindings. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 402\u2013404. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54862-8_30"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-662-46681-0_38","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Tomasco","year":"2015","unstructured":"Tomasco, E., Inverso, O., Fischer, B., La Torre, S., Parlato, G.: MU-CSeq 0.3: sequentialization by read-implicit and coarse-grained memory unwindings. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 436\u2013438. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46681-0_38"},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-662-46681-0_52","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Tomasco","year":"2015","unstructured":"Tomasco, E., Inverso, O., Fischer, B., La Torre, S., Parlato, G.: Verifying concurrent programs by memory unwinding. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 551\u2013565. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46681-0_52"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Tomasco, E., Nguyen, T.L., Inverso, O., Fischer, B., La Torre, S., Parlato, G.: Lazy sequentialization for TSO and PSO via shared memory abstractions. In: FMCAD, pp. 193\u2013200 (2016)","DOI":"10.1109\/FMCAD.2016.7886679"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1007\/978-3-662-49674-9_65","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Tomasco","year":"2016","unstructured":"Tomasco, E., Nguyen, T.L., Inverso, O., Fischer, B., La Torre, S., Parlato, G.: MU-CSeq 0.4: individual memory location unwindings. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 938\u2013941. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49674-9_65"},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-31424-7_15","volume-title":"Computer Aided Verification","author":"AJ Venet","year":"2012","unstructured":"Venet, A.J.: The gauge domain: scalable analysis of linear inequality invariants. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 139\u2013154. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31424-7_15"},{"key":"20_CR37","unstructured":"Vyukov, D.: Bug with a context switch bound 5 (2010)"},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Wu, X., Chen, L., Min\u00e9, A., Dong, W., Wang, J.: Numerical static analysis of interrupt-driven programs via sequentialization. In: EMSOFT, pp. 55\u201364 (2015)","DOI":"10.1109\/EMSOFT.2015.7318260"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T11:58:07Z","timestamp":1569326287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}