{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:10:49Z","timestamp":1774987849312,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319088662","type":"print"},{"value":"9783319088679","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08867-9_38","type":"book-chapter","created":{"date-parts":[[2014,6,28]],"date-time":"2014-06-28T07:37:30Z","timestamp":1403941050000},"page":"568-584","source":"Crossref","is-referenced-by-count":16,"title":["Regression-Free Synthesis for Concurrency"],"prefix":"10.1007","author":[{"given":"Pavol","family":"\u010cern\u00fd","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"given":"Arjun","family":"Radhakrishna","sequence":"additional","affiliation":[]},{"given":"Leonid","family":"Ryzhyk","sequence":"additional","affiliation":[]},{"given":"Thorsten","family":"Tarrach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"CBMC, http:\/\/www.cprover.org\/cbmc\/"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-39799-8_9","volume-title":"Computer Aided Verification","author":"J. Alglave","year":"2013","unstructured":"Alglave, J., Kroening, D., Tautschnig, M.: Partial Orders for Efficient Bounded Model Checking of Concurrent Software. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 141\u2013157. Springer, Heidelberg (2013)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Bod\u00edk, R., Juniwal, G., Martin, M., Raghothaman, M., Seshia, S., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A.: Syntax-guided synthesis. In: FMCAD, pp. 1\u201317 (2013)","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"38_CR4","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.\u00a08044, pp. 951\u2013967. Springer, Heidelberg (2013)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Cherem, S., Chilimbi, T., Gulwani, S.: Inferring locks for atomic sections. In: PLDI 2008 (2008)","DOI":"10.1145\/1375581.1375619"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Deshmukh, J., Ramalingam, G., Ranganath, V.P., Vaswani, K.: Logical Concurrency Control from Sequential Proofs. In: LMCS (2010)","DOI":"10.1007\/978-3-642-11957-6_13"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/978-3-642-39799-8_64","volume-title":"Computer Aided Verification","author":"C. Essen von","year":"2013","unstructured":"von Essen, C., Jobstmann, B.: Program repair without regret. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 896\u2013911. Springer, Heidelberg (2013)"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Farzan, A., Kincaid, Z., Podelski, A.: Inductive data flow graphs. In: POPL, pp. 129\u2013142 (2013)","DOI":"10.1145\/2429069.2429086"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/11817963_33","volume-title":"Computer Aided Verification","author":"A. Griesmayer","year":"2006","unstructured":"Griesmayer, A., Bloem, R., Cook, B.: Repair of boolean programs with an application to C. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 358\u2013371. Springer, Heidelberg (2006)"},{"key":"38_CR10","unstructured":"Jin, G., Zhang, W., Deng, D., Liblit, B., Lu, S.: Automated Concurrency-Bug Fixing. In: OSDI 2012 (2012)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11513988_23","volume-title":"Computer Aided Verification","author":"B. Jobstmann","year":"2005","unstructured":"Jobstmann, B., Griesmayer, A., Bloem, R.: Program repair as a game. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 226\u2013238. Springer, Heidelberg (2005)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Samanta, R., Deshmukh, J., Emerson, A.: Automatic generation of local repairs for boolean programs. In: FMCAD, pp. 1\u201310 (2008)","DOI":"10.1109\/FMCAD.2008.ECP.31"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Sen, K.: Race Directed Random Testing of Concurrent Programs. In: PLDI 2008 (2008)","DOI":"10.1145\/1375581.1375584"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Sinha, N., Wang, C.: On Interference Abstractions. In: POPL 2011 (2011)","DOI":"10.1145\/1926385.1926433"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Sinha, N., Wang, C.: Staged concurrent program analysis. In: FSE 2010 (2010)","DOI":"10.1145\/1882291.1882301"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Jones, C., Bod\u00edk, R.: Sketching concurrent data structures. In: PLDI, pp. 136\u2013148 (2008)","DOI":"10.1145\/1379022.1375599"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Tancau, L., Bod\u00edk, R., Seshia, S.A., Saraswat, V.A.: Combinatorial sketching for finite programs. In: ASPLOS 2006 (2006)","DOI":"10.1145\/1168857.1168907"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Vechev, M., Yahav, E., Yorsh, G.: Abstraction-guided synthesis of synchronization. In: POPL 2010 (2010)","DOI":"10.1145\/1706299.1706338"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08867-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T20:48:57Z","timestamp":1565556537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08867-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319088662","9783319088679"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08867-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}