{"quality_controlled":"1","pubrep_id":"313","alternative_title":["LNCS"],"status":"public","day":"01","date_published":"2014-09-01T00:00:00Z","scopus_import":1,"doi":"10.1007/978-3-319-10936-7_17","citation":{"chicago":"Samanta, Roopsha, Oswaldo Olivo, and Emerson Allen. “Cost-Aware Automatic Program Repair.” edited by Markus Müller-Olm and Helmut Seidl, 8723:268–84. Springer, 2014. https://doi.org/10.1007/978-3-319-10936-7_17.","ieee":"R. Samanta, O. Olivo, and E. Allen, “Cost-aware automatic program repair,” presented at the SAS: Static Analysis Symposium, Munich, Germany, 2014, vol. 8723, pp. 268–284.","ama":"Samanta R, Olivo O, Allen E. Cost-aware automatic program repair. In: Müller-Olm M, Seidl H, eds. Vol 8723. Springer; 2014:268-284. doi:10.1007/978-3-319-10936-7_17","apa":"Samanta, R., Olivo, O., & Allen, E. (2014). Cost-aware automatic program repair. In M. Müller-Olm & H. Seidl (Eds.) (Vol. 8723, pp. 268–284). Presented at the SAS: Static Analysis Symposium, Munich, Germany: Springer. https://doi.org/10.1007/978-3-319-10936-7_17","short":"R. Samanta, O. Olivo, E. Allen, in:, M. Müller-Olm, H. Seidl (Eds.), Springer, 2014, pp. 268–284.","ista":"Samanta R, Olivo O, Allen E. 2014. Cost-aware automatic program repair. SAS: Static Analysis Symposium, LNCS, vol. 8723, 268–284.","mla":"Samanta, Roopsha, et al. Cost-Aware Automatic Program Repair. Edited by Markus Müller-Olm and Helmut Seidl, vol. 8723, Springer, 2014, pp. 268–84, doi:10.1007/978-3-319-10936-7_17."},"conference":{"location":"Munich, Germany","start_date":"2014-09-11","name":"SAS: Static Analysis Symposium","end_date":"2014-09-14"},"language":[{"iso":"eng"}],"publist_id":"5221","abstract":[{"text":"We present a formal framework for repairing infinite-state, imperative, sequential programs, with (possibly recursive) procedures and multiple assertions; the framework can generate repaired programs by modifying the original erroneous program in multiple program locations, and can ensure the readability of the repaired program using user-defined expression templates; the framework also generates a set of inductive assertions that serve as a proof of correctness of the repaired program. As a step toward integrating programmer intent and intuition in automated program repair, we present a cost-aware formulation - given a cost function associated with permissible statement modifications, the goal is to ensure that the total program modification cost does not exceed a given repair budget. As part of our predicate abstractionbased solution framework, we present a sound and complete algorithm for repair of Boolean programs. We have developed a prototype tool based on SMT solving and used it successfully to repair diverse errors in benchmark C programs.","lang":"eng"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:45:19Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"title":"Cost-aware automatic program repair","_id":"1875","volume":8723,"page":"268 - 284","date_updated":"2021-01-12T06:53:46Z","month":"09","date_created":"2018-12-11T11:54:29Z","type":"conference","year":"2014","ddc":["000","005"],"author":[{"first_name":"Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","last_name":"Samanta","full_name":"Samanta, Roopsha"},{"first_name":"Oswaldo","full_name":"Olivo, Oswaldo","last_name":"Olivo"},{"last_name":"Allen","full_name":"Allen, Emerson","first_name":"Emerson"}],"editor":[{"first_name":"Markus","last_name":"Müller-Olm","full_name":"Müller-Olm, Markus"},{"last_name":"Seidl","full_name":"Seidl, Helmut","first_name":"Helmut"}],"publication_status":"published","oa":1,"oa_version":"Submitted Version","has_accepted_license":"1","intvolume":" 8723","file":[{"relation":"main_file","file_name":"IST-2014-313-v1+1_SOE.SAS14.pdf","file_id":"4650","date_created":"2018-12-12T10:07:51Z","content_type":"application/pdf","date_updated":"2020-07-14T12:45:19Z","creator":"system","access_level":"open_access","file_size":409485,"checksum":"78ec4ea1bdecc676cd3e8cad35c6182c"}]}