{"abstract":[{"lang":"eng","text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier."}],"department":[{"_id":"ToHe"}],"publication_status":"published","date_published":"2020-07-14T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-09-07T13:18:00Z","article_processing_charge":"No","month":"07","day":"14","file":[{"content_type":"application/pdf","file_name":"2020_LNCS_Kragl.pdf","access_level":"open_access","creator":"dernst","relation":"main_file","file_id":"8201","success":1,"file_size":804237,"date_created":"2020-08-06T08:14:54Z","date_updated":"2020-08-06T08:14:54Z"}],"type":"conference","alternative_title":["LNCS"],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8332"}]},"status":"public","quality_controlled":"1","title":"Refinement for structured concurrent programs","scopus_import":"1","publisher":"Springer Nature","date_created":"2020-08-03T11:45:35Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"oa_version":"Published Version","language":[{"iso":"eng"}],"_id":"8195","citation":{"short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: <i>Computer Aided Verification</i>. Vol 12224. Springer Nature; 2020:275-298. doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>","ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In <i>Computer Aided Verification</i>, 12224:275–98. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>.","apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In <i>Computer Aided Verification</i> (Vol. 12224, pp. 275–298). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in <i>Computer Aided Verification</i>, 2020, vol. 12224, pp. 275–298.","mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” <i>Computer Aided Verification</i>, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>."},"publication_identifier":{"eisbn":["9783030532888"],"isbn":["9783030532871"],"eissn":["1611-3349"],"issn":["0302-9743"]},"external_id":{"isi":["000695276000014"]},"doi":"10.1007/978-3-030-53288-8_14","page":"275-298","author":[{"orcid":"0000-0001-7745-9117","last_name":"Kragl","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","publication":"Computer Aided Verification","ddc":["000"],"project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"isi":1,"acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","file_date_updated":"2020-08-06T08:14:54Z","year":"2020","volume":12224,"intvolume":"     12224"}