Compositional Design, Implementation, and Verification of Swarms (Technical Report)
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917416104099840 |
|---|---|
| author | Furbach, Florian Clorius, Lucas Kuhn, Roland Melgratti, Hernán Scalas, Alceste Tuosto, Emilio |
| author_facet | Furbach, Florian Clorius, Lucas Kuhn, Roland Melgratti, Hernán Scalas, Alceste Tuosto, Emilio |
| contents | Swarm protocols are a recently introduced formalism for specifying, implementing, and verifying peer-to-peer systems called swarms. A swarm consists of distributed agents called machines that communicate by asynchronous event propagation. Following a local-first model, each machine can progress without requiring continuous connectivity to other machines. Existing models of swarms are not compositional, making the modular development of large and complex swarm applications as well as the reuse of code difficult. We address these issues by presenting novel theory and techniques for the compositional specification, verification, and implementation of swarms. These results enable the correct compositional reuse of pre-existing swarm protocols and machine implementations. We implement these contributions in a companion software artifact which enables the automatic integration of independently designed and verified swarm components. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_16097 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Compositional Design, Implementation, and Verification of Swarms (Technical Report) Furbach, Florian Clorius, Lucas Kuhn, Roland Melgratti, Hernán Scalas, Alceste Tuosto, Emilio Distributed, Parallel, and Cluster Computing Swarm protocols are a recently introduced formalism for specifying, implementing, and verifying peer-to-peer systems called swarms. A swarm consists of distributed agents called machines that communicate by asynchronous event propagation. Following a local-first model, each machine can progress without requiring continuous connectivity to other machines. Existing models of swarms are not compositional, making the modular development of large and complex swarm applications as well as the reuse of code difficult. We address these issues by presenting novel theory and techniques for the compositional specification, verification, and implementation of swarms. These results enable the correct compositional reuse of pre-existing swarm protocols and machine implementations. We implement these contributions in a companion software artifact which enables the automatic integration of independently designed and verified swarm components. |
| title | Compositional Design, Implementation, and Verification of Swarms (Technical Report) |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2604.16097 |