Formalising CRDTs in Agda
Fuente:
Zenodo
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Recurso digital |
| Veröffentlicht: |
Zenodo
2025
|
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866902248859107328 |
|---|---|
| author | Ibrus, Marlene Ahman, Danel |
| author_facet | Ibrus, Marlene Ahman, Danel |
| contents | <p>The thesis describes and formalizes conflict-free replicated data types, which are an important component in distributed systems where data consistency must be ensured without the need for centralized coordination. Additionally, three different designs of conflict-free replicated data types are formalized and analyzed, using the theorem prover Agda to ensure their mathematical precision.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_15425132 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Formalising CRDTs in Agda Ibrus, Marlene Ahman, Danel <p>The thesis describes and formalizes conflict-free replicated data types, which are an important component in distributed systems where data consistency must be ensured without the need for centralized coordination. Additionally, three different designs of conflict-free replicated data types are formalized and analyzed, using the theorem prover Agda to ensure their mathematical precision.</p> |
| title | Formalising CRDTs in Agda |
| url | https://doi.org/10.5281/zenodo.15425132 |