{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:10:51Z","timestamp":1743048651534,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544938"},{"type":"electronic","value":"9783662544945"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54494-5_20","type":"book-chapter","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T00:09:02Z","timestamp":1490141342000},"page":"356-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Workarounds from Java Program Specifications Based on SAT Solving"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Uva","sequence":"first","affiliation":[]},{"given":"Pablo","family":"Ponzio","sequence":"additional","affiliation":[]},{"given":"Germ\u00e1n","family":"Regis","sequence":"additional","affiliation":[]},{"given":"Nazareno","family":"Aguirre","sequence":"additional","affiliation":[]},{"given":"Marcelo F.","family":"Frias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"20_CR1","unstructured":"Replication package for Automated Workarounds from Java Program Specifications based on SAT Solving. http:\/\/dc.exa.unrc.edu.ar\/staff\/naguirre\/sat-workarounds\/"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Abad, P., Aguirre, N., Bengolea, V., Ciolek, D., Frias, M., Galeotti, J., Maibaum, T., Moscato, M., Rosner, N., Vissani, I.: Improving test generation under rich contracts by tight bounds and incremental SAT solving. In: Proceedings of 6th IEEE International Conference on Software Testing, Verification and Validation, ICST 2013, Luxembourg City, Luxembourg. IEEE (2013)","DOI":"10.1109\/ICST.2013.46"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Belt, J., Robby, Deng, X.: Sireum\/Topi LDP: a lightweight semi-decision procedure for optimizing symbolic execution-based analyses. In: Proceedings of the 7th Joint Meeting of the European Software Engineering Conference and The ACM SIGSOFT International Symposium on Foundations of Software Engineering ESEC\/FSE 2009. ACM (2009)","DOI":"10.1145\/1595696.1595762"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Carzaniga, A., Gorla, A., Pezz\u00e8, M.: Self-healing by means of automatic workarounds. In: Proceedings of 2008 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems, SEAMS 2008, Leipzig, Germany, 12\u201313 May. ACM (2008)","DOI":"10.1145\/1370018.1370023"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Carzaniga, A., Gorla, A., Perino, N., Pezz\u00e8, M.: Automatic workarounds for web applications. In: Proceedings of the 18th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2010, Santa Fe (NM), USA. ACM (2010)","DOI":"10.1145\/1882291.1882327"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Carzaniga, A., Gorla, A., Perino, N., Pezz\u00e8, M.: RAW: runtime automatic workarounds. In: Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering, ICSE 2010. ACM, New York (2010)","DOI":"10.1145\/1810295.1810371"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Carzaniga, A., Gorla, A., Mattavelli, A., Perino, N., Pezz\u00e8, M.: Automatic recovery from runtime failures. In: Proceedings of the 35th International Conference on Software Engineering ICSE 2013. IEEE\/ACM, San Francisco (2013)","DOI":"10.1109\/ICSE.2013.6606624"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Carzaniga, A., Gorla, A., Perino, N., Pezz\u00e8, M.: Automatic workarounds: exploiting the intrinsic redundancy of web applications. ACM Trans. Softw. Eng. Methodol. 24(3) (2015). ACM","DOI":"10.1145\/2755970"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/11804192_16","volume-title":"Formal Methods for Components and Objects","author":"P Chalin","year":"2006","unstructured":"Chalin, P., Kiniry, J.R., Leavens, G.T., Poll, E.: Beyond assertions: advanced specification and verification with JML and ESC\/Java2. In: Boer, F.S., Bonsangue, M.M., Graf, S., Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 342\u2013363. Springer, Heidelberg (2006). doi:10.1007\/11804192_16"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Debroy, V., Wong, W.E.: Using mutation to automatically suggest fixes to faulty programs. In: ICST 2010, pp. 65\u201374 (2010)","DOI":"10.1109\/ICST.2010.66"},{"key":"20_CR11","unstructured":"Demsky, B., Rinard, M.: Static specification analysis for termination of specification-based data structure repair. In: Proceedings of the 2003 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, OOPSLA 2003. ACM (2003)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Frias, M., Galeotti, J., L\u00f3pez Pombo, C., Aguirre, N.: DynAlloy: upgrading alloy with actions. In: Proceedings of International Conference on Software Engineering, ICSE 2005, St. Louis, Missouri, USA. ACM (2005)","DOI":"10.1145\/1062455.1062535"},{"key":"20_CR13","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-0-387-39388-9_24","volume-title":"Software Engineering Techniques: Design for Quality","author":"JP Galeotti","year":"2006","unstructured":"Galeotti, J.P., Frias, M.F.: DynAlloy as a formal method for the analysis of Java programs. In: Sacha, K. (ed.) Software Engineering Techniques: Design for Quality. IFIP, vol. 227, pp. 249\u2013260. Springer, Boston (2006). doi:10.1007\/978-0-387-39388-9_24"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Galeotti, J.P., Rosner, N., L\u00f3pez Pombo, C., Frias, M.: Analysis of invariants for efficient bounded verification. In: Proceedings of the Nineteenth International Symposium on Software Testing and Analysis, ISSTA 2010, Trento, Italy, 12\u201316 July. ACM (2010)","DOI":"10.1145\/1831708.1831712"},{"issue":"9","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1109\/TSE.2013.15","volume":"39","author":"JP Galeotti","year":"2013","unstructured":"Galeotti, J.P., Rosner, N., L\u00f3pez Pombo, C., Frias, M.: TACO: efficient SAT-based bounded verification using symmetry breaking and tight bounds. IEEE Trans. Softw. Eng. 39(9), 1283\u20131307 (2013). IEEE","journal-title":"IEEE Trans. Softw. Eng."},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-38088-4_16","volume-title":"NASA Formal Methods","author":"J Geldenhuys","year":"2013","unstructured":"Geldenhuys, J., Aguirre, N., Frias, M.F., Visser, W.: Bounded lazy initialization. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 229\u2013243. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38088-4_16"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Hussain, I., Csallner, C.: Dynamic symbolic data structure repair. In: Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering, ICSE 2010. ACM (2010)","DOI":"10.1145\/1810295.1810333"},{"key":"20_CR18","volume-title":"Software Abstractions: Logic, Language, and Analysis","author":"D Jackson","year":"2006","unstructured":"Jackson, D.: Software Abstractions: Logic, Language, and Analysis. The MIT Press, Cambridge (2006)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/11537328_12","volume-title":"Model Checking Software","author":"S Khurshid","year":"2005","unstructured":"Khurshid, S., Garc\u00eda, I., Suen, Y.L.: Repairing structurally complex data. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol. 3639, pp. 123\u2013138. Springer, Heidelberg (2005). doi:10.1007\/11537328_12"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Kim, D., Nam, J., Song, J., Kim, S.: Automatic patch generation learned from human-written patches. In: ICSE 2013, pp. 802\u2013811 (2013)","DOI":"10.1109\/ICSE.2013.6606626"},{"key":"20_CR21","volume-title":"Program Development in Java: Abstraction, Specification and Object-Oriented Design","author":"B Liskov","year":"2000","unstructured":"Liskov, B., Guttag, J.: Program Development in Java: Abstraction, Specification and Object-Oriented Design. Addison-Wesley, Boston (2000)"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Pacheco, C., Lahiri, S.K., Ernst, M.D., Ball, T.: Feedback-directed random test generation. In: Proceedings of International Conference on Software Engineering, ICSE 2007. IEEE (2007)","DOI":"10.1109\/ICSE.2007.37"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Qi, Z., Long, F., Achour, S., Rinard, M.C.: An analysis of patch plausibility and correctness for generate-and-validate patch generation systems. In: Proceedings of the 2015 International Symposium on Software Testing and Analysis, ISSTA 2015, Baltimore, MD, USA, 12\u201317 July 2015, pp. 24\u201336 (2015)","DOI":"10.1145\/2771783.2771791"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Rosner, N., Bengolea, V., Ponzio, P., Khalek, S., Aguirre, N., Frias, M., Khurshid, S.: Bounded Exhaustive test input generation from hybrid invariants. In: Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA 2014. ACM (2014)","DOI":"10.1145\/2660193.2660232"},{"issue":"7","key":"20_CR25","first-page":"639","volume":"41","author":"N Rosner","year":"2015","unstructured":"Rosner, N., Geldenhuys, J., Aguirre, N., Visser, W., Frias, M.: BLISS: improved symbolic execution by bounded lazy initialization with SAT support. IEEE Trans. Softw. Eng. 41(7), 639\u2013660 (2015). IEEE","journal-title":"IEEE Trans. Softw. Eng."},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-14107-2_26","volume-title":"ECOOP 2010 \u2013 Object-Oriented Programming","author":"H Samimi","year":"2010","unstructured":"Samimi, H., Aung, E.D., Millstein, T.: Falling back on executable specifications. In: D\u2019Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 552\u2013576. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14107-2_26"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Smith, E.K., Barr, E., Le Goues, C., Brun, Y.: Is the cure worse than the disease? overfitting in automated program repair. In: Symposium on the Foundations of Software Engineering (FSE) (2015)","DOI":"10.1145\/2786805.2786825"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Visser, W., Pasareanu, C., Pel\u00e1nek, R.: Test input generation for java containers using state matching. In: Proceedings of the ACM\/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2006. ACM (2006)","DOI":"10.1145\/1146238.1146243"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Weimer, W., Nguyen, T., Le Goues, C., Forrest, S.: Automatically finding patches using genetic programming. In: ICSE 2009, pp. 364\u2013374 (2009)","DOI":"10.1109\/ICSE.2009.5070536"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-14107-2_27","volume-title":"ECOOP 2010 \u2013 Object-Oriented Programming","author":"R Nokhbeh Zaeem","year":"2010","unstructured":"Nokhbeh Zaeem, R., Khurshid, S.: Contract-based data structure repair using alloy. In: D\u2019Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 577\u2013598. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14107-2_27"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-28756-5_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Nokhbeh Zaeem","year":"2012","unstructured":"Nokhbeh Zaeem, R., Gopinath, D., Khurshid, S., McKinley, K.S.: History-aware data structure repair using SAT. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 2\u201317. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28756-5_2"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54494-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T02:22:15Z","timestamp":1618971735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54494-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544938","9783662544945"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54494-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"22 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}