{"id":"https://openalex.org/W2160633550","doi":"https://doi.org/10.1007/3-540-44880-2_27","title":"Formal Derivation of Spanning Trees Algorithms","display_name":"Formal Derivation of Spanning Trees Algorithms","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2160633550","doi":"https://doi.org/10.1007/3-540-44880-2_27","mag":"2160633550"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44880-2_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44880-2_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5113780795","display_name":"Jean-Raymond Abrial","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jean-Raymond Abrial","raw_affiliation_strings":["Marseille, France"],"affiliations":[{"raw_affiliation_string":"Marseille, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007751056","display_name":"Dominique Cansell","orcid":null},"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"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dominique Cansell","raw_affiliation_strings":["LORIA, Universit\u00e9 Henri Poincar\u00e9 Nancy 1, BP 239, Vand\u0153uvre-l\u00e8s-Nancy C\u00e9dex, France"],"affiliations":[{"raw_affiliation_string":"LORIA, Universit\u00e9 Henri Poincar\u00e9 Nancy 1, BP 239, Vand\u0153uvre-l\u00e8s-Nancy C\u00e9dex, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018322893","display_name":"Domingo Mery","orcid":"https://orcid.org/0000-0003-4748-3882"},"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"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dominique M\u00e9ry","raw_affiliation_strings":["LORIA, INRIA Lorraine, BP 239, Vand\u0153uvre-l\u00e8s-Nancy C\u00e9dex, France"],"affiliations":[{"raw_affiliation_string":"LORIA, INRIA Lorraine, BP 239, Vand\u0153uvre-l\u00e8s-Nancy C\u00e9dex, France","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113780795"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.5388,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.9253267,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"457","last_page":"476"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9980999827384949,"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/correctness","display_name":"Correctness","score":0.7593196630477905},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7499322891235352},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.740923285484314},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6544244885444641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.54010009765625},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5345538854598999},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5148822069168091},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4591154456138611},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45546776056289673},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42629432678222656},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4235227704048157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1836477816104889},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15121155977249146}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7593196630477905},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7499322891235352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.740923285484314},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6544244885444641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.54010009765625},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5345538854598999},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5148822069168091},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4591154456138611},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45546776056289673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42629432678222656},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4235227704048157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1836477816104889},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15121155977249146},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-44880-2_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44880-2_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:inria-00099793v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00099793","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Third International Conference of B and Z Users - ZB'2003, Marina Walden, 2003, Turku, Finland, pp.457-476","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W79592965","https://openalex.org/W326353637","https://openalex.org/W1504504841","https://openalex.org/W1534428587","https://openalex.org/W1551293951","https://openalex.org/W1552647623","https://openalex.org/W1559870885","https://openalex.org/W1575221187","https://openalex.org/W1790183476","https://openalex.org/W1857327297","https://openalex.org/W1965680834","https://openalex.org/W1969402593","https://openalex.org/W1977264549","https://openalex.org/W2015688007","https://openalex.org/W2017927472","https://openalex.org/W2076964487","https://openalex.org/W2083336677","https://openalex.org/W2103953153","https://openalex.org/W2498829579","https://openalex.org/W2752885492","https://openalex.org/W4254354208","https://openalex.org/W4255306344","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W4380840098","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2899787781","https://openalex.org/W2130375301","https://openalex.org/W2381121915","https://openalex.org/W2418231958","https://openalex.org/W2390742649","https://openalex.org/W2942013815"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
