Revisiting snapshot algorithms by refinement-based techniques
The snapshot problem addresses a collection of important algorithmic issues related to distributed computations, which are used for debugging or recovering distributed programs. Among existing solutions, Chandy and Lamport have proposed a simple distributed algorithm. In this paper, we explore the c...
Uložené v:
| Vydané v: | Computer Science and Information Systems Ročník 11; číslo 1; s. 251 - 270 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
ComSIS Consortium
2014
|
| Edícia: | Computer Science and Information System |
| Predmet: | |
| ISSN: | 1820-0214, 2406-1018 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The snapshot problem addresses a collection of important algorithmic issues
related to distributed computations, which are used for debugging or
recovering distributed programs. Among existing solutions, Chandy and Lamport
have proposed a simple distributed algorithm. In this paper, we explore the
correct-byconstruction process to formalize the snapshot algorithms in
distributed system. The formalization process is based on a modeling language
Event B, which supports a refinement-based incremental development using
RODIN platform. These refinement-based techniques help to derive correct
distributed algorithms. Moreover, we demonstrate how other distributed
algorithms can be revisited. A consequence is to provide a fully mechanized
proof of the resulting distributed algorithms.
nema |
|---|---|
| AbstractList | The snapshot problem addresses a collection of important algorithmic issues
related to distributed computations, which are used for debugging or
recovering distributed programs. Among existing solutions, Chandy and Lamport
have proposed a simple distributed algorithm. In this paper, we explore the
correct-byconstruction process to formalize the snapshot algorithms in
distributed system. The formalization process is based on a modeling language
Event B, which supports a refinement-based incremental development using
RODIN platform. These refinement-based techniques help to derive correct
distributed algorithms. Moreover, we demonstrate how other distributed
algorithms can be revisited. A consequence is to provide a fully mechanized
proof of the resulting distributed algorithms.
nema The snapshot problem addresses a collection of important algorithmic issues related to distributed computations, which are used for debugging or recovering distributed programs. Among existing solutions, Chandy and Lamport have proposed a simple distributed algorithm. In this paper, we explore the correct-by-construction process to formalize the snapshot algorithms in distributed system. The formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform. These refinement-based techniques help to derive correct distributed algorithms. Moreover, we demonstrate how other distributed algorithms can be revisited. A consequence is to provide a fully mechanized proof of the resulting distributed algorithms. |
| Author | Andriamiarina, Bruno Méry, Dominique Singh, Kumar |
| Author_xml | – sequence: 1 givenname: Bruno surname: Andriamiarina fullname: Andriamiarina, Bruno organization: Université de Lorraine, LORIA Vandoeuvre-lès-Nancy, France – sequence: 2 givenname: Dominique surname: Méry fullname: Méry, Dominique organization: Université de Lorraine, LORIA Vandoeuvre-lès-Nancy, France – sequence: 3 givenname: Kumar surname: Singh fullname: Singh, Kumar organization: McMaster Centre for Software Certification, McMaster University Hamilton, Ontario, Canada |
| BackLink | https://inria.hal.science/hal-00924525$$DView record in HAL |
| BookMark | eNp1kE1Lw0AYhBepYK29es7VQ-q7H8kmBw-lqC0EBKvnsLt9t1lINzW7FvrvTakICp4GhnmGYa7JyHceCbmlMGOsLO4X69WacqCMAcj5BRkzAXlKgRYjMqYFgxQYFVdkGoLTIITkXIh8TB5e8eCCi85vk-DVPjRdTFS77XoXm11I9DHp0TqPO_Qx1SrgJoloGu8-PjHckEur2oDTb52Q96fHt8UyrV6eV4t5lRouy5gaplQGYLIMWVkKQG6lldwC0xx0UZhhoNmgkpBbWSJIpJu80KBtaRlo4BNyd-5tVFvve7dT_bHulKuX86o-eQAlExnLDnTIzs5Z03chDON_AAr16av691cDIP4AxkUVXedjr1z7H_YFmDBugA |
| CitedBy_id | crossref_primary_10_1016_j_ic_2023_105040 crossref_primary_10_1093_comjnl_bxab122 crossref_primary_10_1016_j_scico_2017_03_009 |
| ContentType | Journal Article |
| Copyright | licence_http://creativecommons.org/publicdomain/zero |
| Copyright_xml | – notice: licence_http://creativecommons.org/publicdomain/zero |
| DBID | AAYXX CITATION 1XC |
| DOI | 10.2298/CSIS130122007A |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2406-1018 |
| EndPage | 270 |
| ExternalDocumentID | oai:HAL:hal-00924525v1 10_2298_CSIS130122007A |
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION M~E 1XC |
| ID | FETCH-LOGICAL-c379t-c2aa500c55e29940e3f7f73f02b30b88c182cdea706f79e07e1d68b0bf9f20b03 |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000331779200018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1820-0214 |
| IngestDate | Wed Nov 05 08:08:33 EST 2025 Sat Nov 29 03:58:33 EST 2025 Tue Nov 18 22:03:33 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 1 |
| Keywords | refinement correctness-by-construction Distributed algorithms verification snapshot |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0 licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c379t-c2aa500c55e29940e3f7f73f02b30b88c182cdea706f79e07e1d68b0bf9f20b03 |
| ORCID | 0000-0001-5231-6611 0000-0002-1124-0179 |
| OpenAccessLink | http://www.doiserbia.nb.rs/ft.aspx?id=1820-02141400007A |
| PageCount | 20 |
| ParticipantIDs | hal_primary_oai_HAL_hal_00924525v1 crossref_primary_10_2298_CSIS130122007A crossref_citationtrail_10_2298_CSIS130122007A |
| PublicationCentury | 2000 |
| PublicationDate | 2014-00-00 2014-01 |
| PublicationDateYYYYMMDD | 2014-01-01 |
| PublicationDate_xml | – year: 2014 text: 2014-00-00 |
| PublicationDecade | 2010 |
| PublicationSeriesTitle | Computer Science and Information System |
| PublicationTitle | Computer Science and Information Systems |
| PublicationYear | 2014 |
| Publisher | ComSIS Consortium |
| Publisher_xml | – name: ComSIS Consortium |
| SSID | ssib044733446 |
| Score | 2.0255127 |
| Snippet | The snapshot problem addresses a collection of important algorithmic issues
related to distributed computations, which are used for debugging or
recovering... The snapshot problem addresses a collection of important algorithmic issues related to distributed computations, which are used for debugging or recovering... |
| SourceID | hal crossref |
| SourceType | Open Access Repository Enrichment Source Index Database |
| StartPage | 251 |
| SubjectTerms | Computer Science Modeling and Simulation |
| Title | Revisiting snapshot algorithms by refinement-based techniques |
| URI | https://inria.hal.science/hal-00924525 |
| Volume | 11 |
| WOSCitedRecordID | wos000331779200018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2406-1018 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044733446 issn: 1820-0214 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9RAEF-u1QdfRFGxfhFE8EEWN7tJNvtYSqWCFrEV-nZkv7xCmxyX82gp-Lc7s5vkLqdCffAlHMvecJuZ2_nt7MxvCHmjTOGsrTS1uYIDinU5BRBb0awqjS-kzzLLQrMJeXxcnp2pL5PJTV8Ls7qQdV1eXan5f1U1jIGysXT2H9Q9CIUB-AxKhyeoHZ63UvzXUC8espnbupq3swajut-bxflydtki3ASnCNgSw4IUnZh9NxC5tptYtW_4MPz_Y-rwUO44YjsPkQS7wDJxOH3HQjNkNWgGjcYr-e7WvkFKk5jvHQM88HNDgCekfG-GImLxZ7dvApCgSL8W3UoYQ6xAkRBstNmmvxlVt3N2vLPRCfPYTWR7f-dcYc3CwcnHE_C9KcdA68CSuibS3nJwQ9ohHHhQwnT8_R1yh8tcYT7g55-H_WaUZVKILFan9YuLpJ8o4v1YxAjU7Mz6mHzAKKcPyP3ucJHsR6N4SCaufkQ2DCLpDSJZG0Sir5Ntg0jWBvGYfPtweHpwRLumGdQIqZbU8AqbXJg8d4A0MuaEl14Kz7gWTJelgdUY6yrJCi-VY9Kltig10155zjQTT8hu3dTuKUkMs9ZneepKhp3ouVYSZhXa5xXgPCH2CO1XPTUdozw2NrmY_vlF75G3w_x55FL568zX8BKHSUiBfrT_aYpjSBKGd_Gr9NmtxT0n99BcY-TsBdldLn64l-SuWS3P28WroPZfqC12Dw |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Revisiting+snapshot+algorithms+by+refinement-based+techniques&rft.jtitle=Computer+Science+and+Information+Systems&rft.au=Andriamiarina%2C+Bruno&rft.au=M%C3%A9ry%2C+Dominique&rft.au=Singh%2C+Kumar&rft.date=2014&rft.issn=1820-0214&rft.eissn=2406-1018&rft.volume=11&rft.issue=1&rft.spage=251&rft.epage=270&rft_id=info:doi/10.2298%2FCSIS130122007A&rft.externalDBID=n%2Fa&rft.externalDocID=10_2298_CSIS130122007A |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1820-0214&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1820-0214&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1820-0214&client=summon |