{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:24Z","timestamp":1740098964145,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319667058"},{"type":"electronic","value":"9783319667065"}],"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-66706-5_3","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:13:26Z","timestamp":1503015206000},"page":"46-65","source":"Crossref","is-referenced-by-count":3,"title":["Abstract Semantic Diffing of Evolving Concurrent Programs"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[]},{"given":"Shuvendu K.","family":"Lahiri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theor. Comput. Sci. 82(2), 253\u2013284 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","year":"2014","unstructured":"Biere, A., Bloem, R. (eds.): CAV 2014. LNCS, vol. 8559. Springer, Cham (2014)"},{"key":"3_CR3","unstructured":"Bouajjani, A., Derevenetc, E., Meyer, R.: Robustness against relaxed memory models. In: Hasselbring, W., Ehmke, N.C. (eds.) Software Engineering 2014, Kiel, Deutschland, GI. LNI, vol. 227, pp. 85\u201386 (2014)"},{"key":"3_CR4","first-page":"107","volume":"2008","author":"S Burckhardt","year":"2008","unstructured":"Burckhardt, S., Musuvathi, M.: Effective program verification for relaxed memory models. CAV 2008, 107\u2013120 (2008)","journal-title":"CAV"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1007\/978-3-642-39799-8_68","volume-title":"Computer Aided Verification","author":"P \u010cern\u00fd","year":"2013","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A., Ryzhyk, L., Tarrach, T.: Efficient synthesis for concurrency by semantics-preserving transformations. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 951\u2013967. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39799-8_68"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A., Ryzhyk, L., Tarrach, T.: Regression-free synthesis for concurrency. In: Biere and Bloem [3], pp. 568\u2013584","DOI":"10.1007\/978-3-319-08867-9_38"},{"issue":"3","key":"3_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10703-015-0237-0","volume":"47","author":"S Chaki","year":"2015","unstructured":"Chaki, S., Gurfinkel, A., Strichman, O.: Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation). Formal Methods Syst. Des. 47(3), 287\u2013301 (2015)","journal-title":"Formal Methods Syst. Des."},{"key":"3_CR8","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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Farzan, A., Kincaid, Z., Podelski, A.: Inductive data flow graphs. In: Giacobazzi, R., Cousot, R. (eds.) The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, 23\u201325 January 2013, pp. 129\u2013142. ACM (2013)","DOI":"10.1145\/2429069.2429086"},{"issue":"6","key":"3_CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00236-008-0075-2","volume":"45","author":"B Godlin","year":"2008","unstructured":"Godlin, B., Strichman, O.: Inference rules for proving the equivalence of recursive procedures. Acta Inf. 45(6), 403\u2013439 (2008)","journal-title":"Acta Inf."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Inverso, O., Nguyen, T.L., Fischer, B., Torre, S.L., Parlato, G.: Lazy-CSeq: a context-bounded model checking tool for multi-threaded c-programs. In: Cohen, M.B., Grunske, L., Whalen, M. (eds.) 30th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2015, Lincoln, NE, USA, 9\u201313 November 2015, pp. 807\u2013812. IEEE Computer Society (2015)","DOI":"10.1109\/ASE.2015.108"},{"key":"3_CR12","doi-asserted-by":"crossref","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 and Bloem, pp. 585\u2013602","DOI":"10.1007\/978-3-319-08867-9_39"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Jackson, D., Ladd, D.A.: Semantic Diff: a tool for summarizing the effects of modifications. In: Proceedings of the International Conference on Software Maintenance, ICSM 1994, Victoria, BC, Canada, September 1994, pp. 243\u2013252. IEEE Computer Society (1994)","DOI":"10.1109\/ICSM.1994.336770"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Joshi, S., Lahiri, S.K., Lal, A.: Underspecified harnesses and interleaved bugs. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, 22\u201328 January 2012, pp. 19\u201330. ACM (2012)","DOI":"10.1145\/2103656.2103662"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Lahiri, S.K., Hawblitzel, C., Kawaguchi, M., Reb\u00ealo, H.: SYMDIFF: a language-agnostic semantic diff tool for imperative programs. In: Proceedings of the 24th International Conference on Computer Aided Verification, CAV 2012 (2012)","DOI":"10.1007\/978-3-642-31424-7_54"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Lahiri, S.K., McMillan, K.L., Sharma, R., Hawblitzel, C.: Differential assertion checking. In: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC\/FSE 2013, Saint Petersburg, Russian Federation, 18\u201326 August 2013, pp. 345\u2013355. ACM (2013)","DOI":"10.1145\/2491411.2491452"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Logozzo, F., Lahiri, S.K., F\u00e4hndrich, M., Blackshear, S.: Verification modulo versions: towards usable verification. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, Edinburgh, United Kingdom, 09\u201311 June 2014, p. 32. ACM (2014)","DOI":"10.1145\/2666356.2594326"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Lu, S., Park, S., Seo, E., Zhou, Y.: Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. In: Eggers, S.J., Larus, J.R. (eds.) Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2008, Seattle, WA, USA, 1\u20135 March 2008, pp. 329\u2013339. ACM (2008)","DOI":"10.1145\/1346281.1346323"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Marinescu, P.D., Cadar, K.C.: high-coverage testing of software patches. In: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC\/FSE 2013, Saint Petersburg, Russian Federation, 18\u201326 August 2013, pp. 235\u2013245. ACM (2013)","DOI":"10.1145\/2491411.2491438"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Person, S., Dwyer, M.B., Elbaum, S.G., Pasareanu, C.S.: Differential symbolic execution. In: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2008, Atlanta, Georgia, USA, 9\u201314 November 2008, pp. 226\u2013237. ACM (2008)","DOI":"10.1145\/1453101.1453131"},{"issue":"2","key":"3_CR21","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/42190.42277","volume":"10","author":"D Shasha","year":"1988","unstructured":"Shasha, D., Snir, M.: Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst. 10(2), 282\u2013312 (1988)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66706-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T10:39:46Z","timestamp":1570012786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66706-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319667058","9783319667065"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66706-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}