Konfliktivabade dubleeritud andmetüüpide formaliseerimine

dc.contributor.advisor	Ahman, Danel, juhendaja
dc.contributor.author	Ibrus, Marlene
dc.contributor.other	Tartu Ülikool. Loodus- ja täppisteaduste valdkond	et
dc.contributor.other	Tartu Ülikool. Arvutiteaduse instituut	et
dc.date.accessioned	2025-10-20T09:02:13Z
dc.date.available	2025-10-20T09:02:13Z
dc.date.issued	2025
dc.description.abstract	The thesis describes and formalises conflict-free replicated data types, which are an important component in distributed systems where data consistency must be ensured without the need for centralised coordination. Additionally, three different designs of conflict-free replicated data types are formalised and analysed, using the theorem prover Agda to ensure their mathematical precision.
dc.identifier.uri	https://hdl.handle.net/10062/116881
dc.language.iso	et
dc.publisher	Tartu Ülikool	et
dc.rights.uri	https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject	Hajussüsteemid
dc.subject	CRDT
dc.subject	Agda
dc.subject	formaliseerimine
dc.subject	Distributed systems
dc.subject.other	bakalaureusetööd	et
dc.subject.other	informaatika	et
dc.subject.other	infotehnoloogia	et
dc.subject.other	informatics	en
dc.subject.other	infotechnology	en
dc.title	Konfliktivabade dubleeritud andmetüüpide formaliseerimine
dc.type	Thesis

Failid

Nüüd näidatakse 1 - 1 1