{"publist_id":"7761","intvolume":"     10981","file":[{"content_type":"application/pdf","file_size":1603844,"relation":"main_file","file_name":"2018_LNCS_Kragl.pdf","access_level":"open_access","checksum":"c64fff560fe5a7532ec10626ad1c215e","date_created":"2018-12-17T12:52:12Z","date_updated":"2020-07-14T12:45:04Z","creator":"dernst","file_id":"5705"}],"language":[{"iso":"eng"}],"title":"Layered Concurrent Programs","scopus_import":"1","quality_controlled":"1","oa_version":"Published Version","year":"2018","publisher":"Springer","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"18","date_published":"2018-07-18T00:00:00Z","license":"https://creativecommons.org/licenses/by/4.0/","volume":10981,"date_updated":"2023-09-13T08:45:09Z","has_accepted_license":"1","type":"conference","isi":1,"author":[{"first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"doi":"10.1007/978-3-319-96145-3_5","conference":{"location":"Oxford, UK","name":"CAV: Computer Aided Verification","end_date":"2018-07-17","start_date":"2018-07-14"},"_id":"160","alternative_title":["LNCS"],"related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]},"publication_status":"published","abstract":[{"lang":"eng","text":"We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. These programs are expressed in the ordinary syntax of imperative concurrent programs using gated atomic actions, sequencing, choice, and (recursive) procedure calls. Each concurrent program is automatically extracted from the layered program. We reduce refinement to the safety of a sequence of concurrent checker programs, one each to justify the connection between every two consecutive concurrent programs. These checker programs are also automatically extracted from the layered program. Layered concurrent programs have been implemented in the CIVL verifier which has been successfully used for the verification of several complex concurrent programs."}],"article_processing_charge":"No","department":[{"_id":"ToHe"}],"citation":{"ista":"Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>.","apa":"Kragl, B., &#38; Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>","short":"B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.","mla":"Kragl, Bernhard, and Shaz Qadeer. <i>Layered Concurrent Programs</i>. Vol. 10981, Springer, 2018, pp. 79–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>.","ama":"Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>","ieee":"B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102."},"date_created":"2018-12-11T11:44:57Z","month":"07","page":"79 - 102","status":"public","project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"external_id":{"isi":["000491481600005"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["000"],"file_date_updated":"2020-07-14T12:45:04Z","oa":1}