The Autonomous Data Language – Concepts, design and formal verification
Nowadays, the main advances in computational power are due to parallelism. However, most parallel languages have been designed with a focus on processors and threads. This makes dealing with data and memory in programs hard, which distances the implementation from its original algorithm. We propose a new paradigm for parallel programming, the data-autonomous paradigm, where computation is performed by autonomous data elements. Programs in this paradigm are focused on making the data collaborate in a highly parallel fashion. We furthermore present AuDaLa, the first data autonomous programming language, and provide a full formalisation that includes a type system and operational semantics. Programming in AuDaLais very natural, as illustrated by examples, albeit in a style very different from sequential and contemporary parallel programming. Additionally, it lends itself for the formal verification of parallel programs, which we demonstrate.
Authors
- Thomas Neele (ORCID: https://orcid.org/0000-0001-6117-9129)
- Jan Friso Groote (ORCID: https://orcid.org/0000-0003-2196-6587)
- Tom T. P. Franken (ORCID: https://orcid.org/0000-0002-1168-5450)
Publication Details
- Journal
- Theoretical Computer Science
- Published
- 2025-09-25
- DOI
- https://doi.org/10.1016/j.tcs.2025.115560
- Primary Topic
- Parallel Computing and Optimization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek