@inproceedings{2652c312562b4d0c9ad1ca42faff7664,
title = "AuDaLa is Turing Complete",
abstract = "AuDaLa is a recently introduced programming language that follows the new data autonomous paradigm. In this paradigm, small pieces of data execute functions autonomously. Considering the paradigm and the design choices of AuDaLa, it is interesting to determine the expressiveness of the language and to create verification methods for it. In this paper, we take our first steps to such a verification method by implementing Turing machines in AuDaLa and proving that implementation correct. This also proves that AuDaLa is Turing complete.",
keywords = "AuDaLa, Turing Complete, Verification",
author = "Franken, {Tom T.P.} and Thomas Neele",
year = "2024",
month = jun,
day = "13",
doi = "10.1007/978-3-031-62645-6_12",
language = "English",
isbn = "978-3-031-62644-9",
series = "Lecture Notes in Computer Science (LNCS)",
publisher = "Springer",
pages = "221--229",
editor = "Valentina Castiglioni and Adrian Francalanza",
booktitle = "Formal Techniques for Distributed Objects, Components, and Systems",
address = "Germany",
note = "44th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2024, held as part of the 19th International Federated Conference on Distributed Computing Techniques, DisCoTec 2024 ; Conference date: 17-06-2024 Through 21-06-2024",
}