{"id":"https://openalex.org/W2797823671","doi":"https://doi.org/10.1109/icis.2017.8332403","title":"A correct-by-construction approach for proving distributed algorithms in spanning trees","display_name":"A correct-by-construction approach for proving distributed algorithms in spanning trees","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2797823671","doi":"https://doi.org/10.1109/icis.2017.8332403","mag":"2797823671"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2017.8332403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2017.8332403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023903997","display_name":"Faten Fakhfakh","orcid":"https://orcid.org/0000-0002-4196-0986"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Faten Fakhfakh","raw_affiliation_strings":["ReDCad Laboratory, FSEGS, Tunisia"],"affiliations":[{"raw_affiliation_string":"ReDCad Laboratory, FSEGS, Tunisia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105514917","display_name":"Mohamed Tounsi","orcid":"https://orcid.org/0000-0002-1299-9005"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohamed Tounsi","raw_affiliation_strings":["ReDCad Laboratory, FSEGS, Tunisia"],"affiliations":[{"raw_affiliation_string":"ReDCad Laboratory, FSEGS, Tunisia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067540221","display_name":"Mohamed Mosbah","orcid":"https://orcid.org/0000-0001-6031-4237"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohamed Mosbah","raw_affiliation_strings":["LaBRI Laboratory, University of Bordeaux, France"],"affiliations":[{"raw_affiliation_string":"LaBRI Laboratory, University of Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102820557","display_name":"Dominique M\u00e9ry","orcid":"https://orcid.org/0000-0001-5231-6611"},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dominique Mery","raw_affiliation_strings":["LORIA, University of Lorrain, Nancy, France"],"affiliations":[{"raw_affiliation_string":"LORIA, University of Lorrain, Nancy, France","institution_ids":["https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063228263","display_name":"Ahmed Hadj Kacem","orcid":"https://orcid.org/0000-0002-8895-0152"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahmed Hadj Kacem","raw_affiliation_strings":["ReDCad Laboratory, FSEGS, Tunisia"],"affiliations":[{"raw_affiliation_string":"ReDCad Laboratory, FSEGS, Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5023903997"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27504685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"abs 1001 2785","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.865365743637085},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8609212636947632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7003440856933594},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6817542910575867},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6295186281204224},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5504091382026672},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5467738509178162},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5327603220939636},{"id":"https://openalex.org/keywords/event","display_name":"Event (particle physics)","score":0.47029587626457214},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.4345707297325134},{"id":"https://openalex.org/keywords/consensus-algorithm","display_name":"Consensus algorithm","score":0.41253384947776794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35498642921447754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19034382700920105},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10967391729354858}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.865365743637085},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8609212636947632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7003440856933594},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6817542910575867},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6295186281204224},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5504091382026672},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5467738509178162},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5327603220939636},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.47029587626457214},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.4345707297325134},{"id":"https://openalex.org/C2983222225","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus algorithm","level":2,"score":0.41253384947776794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35498642921447754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19034382700920105},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10967391729354858},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icis.2017.8332403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2017.8332403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.5600000023841858,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W190356767","https://openalex.org/W1556900989","https://openalex.org/W1577544661","https://openalex.org/W1793205527","https://openalex.org/W1928305535","https://openalex.org/W1954487783","https://openalex.org/W1994590870","https://openalex.org/W2038814435","https://openalex.org/W2097585674","https://openalex.org/W2126722560","https://openalex.org/W2136604606","https://openalex.org/W2139093174","https://openalex.org/W2158254776","https://openalex.org/W2167471484","https://openalex.org/W2218889307","https://openalex.org/W2480289003","https://openalex.org/W2509483195","https://openalex.org/W2611024186","https://openalex.org/W2792129212","https://openalex.org/W2994843992","https://openalex.org/W4244819751","https://openalex.org/W4299576519","https://openalex.org/W6640495313","https://openalex.org/W6749266939","https://openalex.org/W6771341316"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"Dynamic":[0],"networks":[1],"are":[2],"characterized":[3],"by":[4,57],"frequent":[5],"topology":[6],"changes":[7],"due":[8],"to":[9,49,110],"the":[10,51,55,63,76,141],"unpredictable":[11],"appearance":[12],"and":[13,88],"disappearance":[14],"of":[15,36,54,99,120,143,149],"mobile":[16],"devices":[17],"and/or":[18],"communication":[19],"links.":[20],"In":[21],"this":[22],"paper,":[23],"we":[24,70],"propose":[25],"a":[26,34,59,72,90,121,147],"correct-by-construction":[27],"approach":[28,40,101],"for":[29,86],"proving":[30,140],"distributed":[31,104,144],"algorithms":[32,105,145],"in":[33,42,93,146],"forest":[35,64,92,148],"spanning":[37,91,111,150],"trees.":[38,112,151],"Our":[39],"consists":[41],"two":[43],"phases.":[44],"The":[45,96,125],"first":[46],"one":[47],"aims":[48],"control":[50],"dynamic":[52,94],"structure":[53],"network":[56],"triggering":[58],"maintenance":[60],"operation":[61],"when":[62],"is":[65,80],"altered.":[66],"To":[67],"do":[68],"so,":[69],"develop":[71],"formal":[73],"pattern":[74,116],"using":[75],"Event-B":[77],"method":[78],"which":[79,106],"based":[81],"on":[82,135],"an":[83,118],"existing":[84],"model":[85],"building":[87],"maintaining":[89],"networks.":[95],"second":[97],"phase":[98],"our":[100,115,130],"deals":[102],"with":[103],"can":[107,132],"be":[108],"applied":[109],"We":[113],"illustrate":[114],"through":[117],"example":[119],"leader":[122],"election":[123],"algorithm.":[124],"proof":[126],"statistics":[127],"show":[128],"that":[129],"solution":[131],"save":[133],"efforts":[134],"specifying":[136],"as":[137,139],"well":[138],"correctness":[142]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}