Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/2152
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Marić, Filip | en_US |
dc.contributor.author | Scholz, Bernhard | en_US |
dc.contributor.author | Subotić, Pavle | en_US |
dc.date.accessioned | 2025-07-12T09:44:44Z | - |
dc.date.available | 2025-07-12T09:44:44Z | - |
dc.date.issued | 2025-05-16 | - |
dc.identifier.isbn | [9783959773713] | - |
dc.identifier.issn | 21906807 | - |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/2152 | - |
dc.description.abstract | Cross-chain bridges are financial services that interconnect blockchains. High monetary values flow through these bridges, and their security must be safeguarded. However, designing real-world cross-chain bridges is a difficult endeavor. Due to blockchain’s closed-world nature, tokens cannot be transferred from a sender to a receiver chain; on the contrary, they need complex logic that maintains an equilibrium on both chains, even if either the chains or the bridge fail. This paper formally verifies a model of a novel fail-safe cross-chain bridge to ensure correctness. We define formal requirements and prove the bridge is safe using the Isabelle/HOL proof assistant. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Schloss Dagstuhl | en_US |
dc.relation.ispartof | Openaccess Series in Informatics | en_US |
dc.subject | Cross-Chain Bridge | en_US |
dc.subject | Formal Verification | en_US |
dc.subject | Logic | en_US |
dc.subject | Security | en_US |
dc.title | Formal Verification of a Fail-Safe Cross-Chain Bridge | en_US |
dc.type | Conference Paper | en_US |
dc.relation.conference | International Workshop on Formal Methods for Blockchains FMBC 2025 (6 ; 2025 ; Hamilton) | en_US |
dc.relation.publication | 6th International Workshop on Formal Methods for Blockchains FMBC2025 : Proceedings | en_US |
dc.identifier.doi | 10.4230/OASIcs.FMBC.2025.8 | - |
dc.identifier.scopus | 2-s2.0-105005960398 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/105005960398 | - |
dc.identifier.url | https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FMBC.2025.8 | - |
dc.relation.isbn | 978-3-95977-371-3 | en_US |
dc.relation.doi | 10.4230/OASIcs.FMBC.2025.0 | en_US |
dc.relation.issn | 1868-8969 | en_US |
dc.description.rank | M33 | en_US |
dc.relation.volume | 129 | en_US |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | en | - |
item.openairetype | Conference Paper | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0001-7219-6960 | - |
Appears in Collections: | Research outputs |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.