Home > Research > Publications & Outputs > Composition Machines

Electronic data

  • Composition_Machines

    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

    Embargo ends: 2/08/25

View graph of relations

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Forthcoming
Publication date10/04/2024
Host publicationProceedings of the 18th International Symposium on Theoretical Aspects of Software Engineering: TASE 2024
PublisherSpringer
<mark>Original language</mark>English
EventThe 18th International Symposium on Theoretical Aspects of Software Engineering: TASE 24 - Guiyang, China
Duration: 29/07/20241/08/2024
Conference number: 18th
https://tase2024.github.io/

Conference

ConferenceThe 18th International Symposium on Theoretical Aspects of Software Engineering
Country/TerritoryChina
CityGuiyang
Period29/07/241/08/24
Internet address

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Conference

ConferenceThe 18th International Symposium on Theoretical Aspects of Software Engineering
Country/TerritoryChina
CityGuiyang
Period29/07/241/08/24
Internet address

Abstract

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.