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: | Majumdar, Rupak, Thinniyam, Ramanathan S., Zetzsche, Georg |
---|---|
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 |
Ejemplares similares
-
Cyclic transitions between higher order motifs underlie sustained asynchronous spiking in sparse recurrent networks
por: Bojanek, Kyle, et al.
Publicado: (2020) -
HORIBALFRE program: Higher Order Residue Interactions Based ALgorithm for Fold REcognition
por: Sundaramurthy, Pandurangan, et al.
Publicado: (2011) -
Pro asynchronous programming with .NET
por: Blewett, Richard, et al.
Publicado: (2014) -
Higher-order Perl: transforming programs with programs
por: Dominus, Mark Jason
Publicado: (2005) -
Editorial: Higher-Order Conditioning: Beyond Classical Conditioning
por: Busquets-Garcia, Arnau, et al.
Publicado: (2022)