{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T18:40:07Z","timestamp":1747680007036,"version":"3.40.5"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3568925","type":"journal-article","created":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T17:45:14Z","timestamp":1747071914000},"page":"84081-84093","source":"Crossref","is-referenced-by-count":0,"title":["Crust: A Modular Framework for Conflict-Free Replicated Data Types (CRDTs) Development, Validation, and Benchmarking"],"prefix":"10.1109","volume":"13","author":[{"given":"Yunrui","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Engineering, Computer and Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5128-2445","authenticated-orcid":false,"given":"Jing","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Engineering, Computer and Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24550-3_29"},{"key":"ref2","first-page":"13","article-title":"CRDT-based collaborative editing in OppNets: A practical experiment","volume-title":"Proc. IARIA","author":"Mah\u00e9o"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19890-3_55"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2013.254123"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2911151.2911156"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E55432.2022.00021"},{"key":"ref7","first-page":"1","article-title":"Verifying strong eventual consistency in distributed systems","volume-title":"Proc. ACM Program. Lang.","author":"Gomes"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26850-7_5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3591276"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/3510397.3510403"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.75"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.12.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/smds49396.2020.00021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3528535.3565252"},{"key":"ref15","first-page":"25","article-title":"Verifying strong eventual consistency for conflict-free replicated data types","volume-title":"Proc. 25th Automated Reasoning Workshop","author":"Gomes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4108\/eai.30-6-2017.152755"},{"article-title":"Security in conflict-free replicated data types","year":"2023","author":"de Sousa","key":"ref17"},{"volume-title":"GitHub-Rust-Crdt\/Rust-Crdt: A Collection of Well-Tested, Serializable CRDTs for Rust","year":"2025","key":"ref18"},{"volume-title":"GitHub-Toeverything\/AFFiNE: There Can be More Than Notion and Miro. AFFiNE is a Next-Gen Knowledge Base That Brings Planning, Sorting and Creating All Together. Privacy First, Open-Source, Customizable and Ready to Use.","year":"2025","key":"ref19"},{"volume-title":"GitHub-Pubkey\/Rxdb: A Fast, Local First, Reactive Database for JavaScript Applications","year":"2025","key":"ref20"},{"volume-title":"GitHub-Dmonad\/Crdt-Benchmarks: A Collection of CRDT Benchmarks","year":"2025","key":"ref21"},{"volume-title":"GitHub-Davidrusu\/BFT-Crdts: Byzantine Fault Tolerant CRDT\u2019s and Other Eventually Consistent Algorithms","year":"2025","key":"ref22"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11000289.pdf?arnumber=11000289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T17:58:50Z","timestamp":1747677530000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11000289\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3568925","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}