Rights statement: This version of the contribution has been accepted for publication, after peer review but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at the publisher's website. Use of this Accepted Version is subject to the publisher’s Accepted Manuscript terms of use https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms
Accepted author manuscript, 518 KB, PDF document
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - Composition Machines
T2 - The 18th International Symposium on Theoretical Aspects of Software Engineering
AU - Arellanes, Damian
N1 - Conference code: 18th
PY - 2024/4/10
Y1 - 2024/4/10
N2 - We are entering a new era in which software systems are becoming more and more complex and larger. So, the composition of such systems is becoming infeasible by manual means. To address this challenge, self-organising software models represent a promising direction since they allow the (bottom-up) emergence of complex computational structures from simple rules. In this paper, we propose an abstract machine, called the composition machine, which allows the definition and the execution of such models. Unlike typical abstract machines, our proposal does not compute individual programs but enables the emergence of multiple programs at once. We particularly present the machine's semantics and demonstrate its operation with well-known rules from the realm of Boolean logic and elementary cellular automata.
AB - We are entering a new era in which software systems are becoming more and more complex and larger. So, the composition of such systems is becoming infeasible by manual means. To address this challenge, self-organising software models represent a promising direction since they allow the (bottom-up) emergence of complex computational structures from simple rules. In this paper, we propose an abstract machine, called the composition machine, which allows the definition and the execution of such models. Unlike typical abstract machines, our proposal does not compute individual programs but enables the emergence of multiple programs at once. We particularly present the machine's semantics and demonstrate its operation with well-known rules from the realm of Boolean logic and elementary cellular automata.
M3 - Conference contribution/Paper
T3 - Lecture Notes in Computer Science
BT - Proceedings of the 18th International Symposium on Theoretical Aspects of Software Engineering
PB - Springer
Y2 - 29 July 2024 through 1 August 2024
ER -