Cargando…
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show dec...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979193/ http://dx.doi.org/10.1007/978-3-030-72016-2_24 |
_version_ | 1783667240198995968 |
---|---|
author | Majumdar, Rupak Thinniyam, Ramanathan S. Zetzsche, Georg |
author_facet | Majumdar, Rupak Thinniyam, Ramanathan S. Zetzsche, Georg |
author_sort | Majumdar, Rupak |
collection | PubMed |
description | The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes. As a main consequence, we show decidability of safety, termination and boundedness verification for higher-order asynchronous programs—such as OCaml programs using Lwt—and undecidability of liveness verification already for order-2 asynchronous programs. We show that under mild assumptions, surprisingly, safety and termination verification of asynchronous programs with handlers from a language class are decidable iff emptiness is decidable for the underlying language class. Moreover, we show that configuration reachability and liveness (fair termination) verification are equivalent, and decidability of these problems implies decidability of the well-known “equal-letters” problem on languages. Our results close the decidability frontier for asynchronous programs. |
format | Online Article Text |
id | pubmed-7979193 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
record_format | MEDLINE/PubMed |
spelling | pubmed-79791932021-03-23 General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond Majumdar, Rupak Thinniyam, Ramanathan S. Zetzsche, Georg Tools and Algorithms for the Construction and Analysis of Systems Article The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes. As a main consequence, we show decidability of safety, termination and boundedness verification for higher-order asynchronous programs—such as OCaml programs using Lwt—and undecidability of liveness verification already for order-2 asynchronous programs. We show that under mild assumptions, surprisingly, safety and termination verification of asynchronous programs with handlers from a language class are decidable iff emptiness is decidable for the underlying language class. Moreover, we show that configuration reachability and liveness (fair termination) verification are equivalent, and decidability of these problems implies decidability of the well-known “equal-letters” problem on languages. Our results close the decidability frontier for asynchronous programs. 2021-03-01 /pmc/articles/PMC7979193/ http://dx.doi.org/10.1007/978-3-030-72016-2_24 Text en © The Author(s) 2021 Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. |
spellingShingle | Article Majumdar, Rupak Thinniyam, Ramanathan S. Zetzsche, Georg General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond |
title | General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond |
title_full | General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond |
title_fullStr | General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond |
title_full_unstemmed | General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond |
title_short | General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond |
title_sort | general decidability results for asynchronous shared-memory programs: higher-order and beyond |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979193/ http://dx.doi.org/10.1007/978-3-030-72016-2_24 |
work_keys_str_mv | AT majumdarrupak generaldecidabilityresultsforasynchronoussharedmemoryprogramshigherorderandbeyond AT thinniyamramanathans generaldecidabilityresultsforasynchronoussharedmemoryprogramshigherorderandbeyond AT zetzschegeorg generaldecidabilityresultsforasynchronoussharedmemoryprogramshigherorderandbeyond |