{"publisher":"Institute of Science and Technology Austria","date_created":"2020-09-04T12:24:12Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","oa":1,"alternative_title":["ISTA Thesis"],"status":"public","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"133"},{"relation":"part_of_dissertation","id":"8012","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"8195"},{"status":"public","id":"160","relation":"part_of_dissertation"}]},"title":"Verifying concurrent programs: Refinement, synchronization, sequentialization","date_updated":"2023-09-13T08:45:08Z","supervisor":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"article_processing_charge":"No","month":"09","day":"03","degree_awarded":"PhD","type":"dissertation","file":[{"file_id":"8333","file_size":1348815,"date_created":"2020-09-04T12:17:47Z","date_updated":"2020-09-04T12:17:47Z","content_type":"application/pdf","file_name":"kragl-thesis.pdf","creator":"bkragl","access_level":"open_access","relation":"main_file","checksum":"26fe261550f691280bda4c454bf015c7"},{"creator":"bkragl","access_level":"closed","file_name":"kragl-thesis.zip","content_type":"application/zip","checksum":"b9694ce092b7c55557122adba8337ebc","relation":"source_file","date_created":"2020-09-04T13:00:17Z","file_size":372312,"file_id":"8335","date_updated":"2020-09-04T13:00:17Z"}],"abstract":[{"text":"Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. 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. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step.","lang":"eng"}],"department":[{"_id":"ToHe"}],"date_published":"2020-09-03T00:00:00Z","publication_status":"published","year":"2020","ddc":["000"],"file_date_updated":"2020-09-04T13:00:17Z","publication_identifier":{"issn":["2663-337X"]},"author":[{"orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard","last_name":"Kragl","first_name":"Bernhard"}],"has_accepted_license":"1","page":"120","doi":"10.15479/AT:ISTA:8332","_id":"8332","language":[{"iso":"eng"}],"citation":{"ieee":"B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020.","mla":"Kragl, Bernhard. <i>Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8332\">10.15479/AT:ISTA:8332</a>.","short":"B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020.","ama":"Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8332\">10.15479/AT:ISTA:8332</a>","apa":"Kragl, B. (2020). <i>Verifying concurrent programs: Refinement, synchronization, sequentialization</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8332\">https://doi.org/10.15479/AT:ISTA:8332</a>","ista":"Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.","chicago":"Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8332\">https://doi.org/10.15479/AT:ISTA:8332</a>."}}