Formal derivation of spanning trees algorithms
Identifieur interne : 007A58 ( Main/Merge ); précédent : 007A57; suivant : 007A59Formal derivation of spanning trees algorithms
Auteurs : Jean-Raymond Abrial ; Dominique Cansell [France] ; Dominique Méry [France]Source :
English descriptors
- KwdEn :
- development, graph, proof, refinement, tree.
Abstract
Graphs algorithms and graph-theoretical problems provide a challenging battlefield for the incremental development of proved models. The B event-based approach implements the incremental and proved development of abstract models which are translated into algorithms ; we focus our methodology on the minimum spanning tree problem and on Prim's algorithm. The correctness of the resulting solution is based on properties over trees and we show how the greedy strategy is efficient in this case. We compare properties proven mechanically to the properties found in a classical algorithms textbook.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003785
- to stream Crin, to step Curation: 003785
- to stream Crin, to step Checkpoint: 000C11
Links to Exploration step
CRIN:abrial03aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="313">Formal derivation of spanning trees algorithms</title></titleStmt><publicationStmt><idno type="RBID">CRIN:abrial03a</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003785</idno><idno type="wicri:Area/Crin/Curation">003785</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003785</idno><idno type="wicri:Area/Crin/Checkpoint">000C11</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000C11</idno><idno type="wicri:Area/Main/Merge">007A58</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Formal derivation of spanning trees algorithms</title><author><name sortKey="Abrial, Jean Raymond" sort="Abrial, Jean Raymond" uniqKey="Abrial J" first="Jean-Raymond" last="Abrial">Jean-Raymond Abrial</name></author><author><name sortKey="Cansell, Dominique" sort="Cansell, Dominique" uniqKey="Cansell D" first="Dominique" last="Cansell">Dominique Cansell</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="team" n="7">Mosel (Loria)</orgName><orgName type="lab">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="EPST">Centre national de la recherche scientifique</orgName><orgName type="EPST">Institut national de recherche en informatique et en automatique</orgName></affiliation></author><author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="team" n="7">Mosel (Loria)</orgName><orgName type="lab">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="EPST">Centre national de la recherche scientifique</orgName><orgName type="EPST">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>development</term><term>graph</term><term>proof</term><term>refinement</term><term>tree</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1706">Graphs algorithms and graph-theoretical problems provide a challenging battlefield for the incremental development of proved models. The B event-based approach implements the incremental and proved development of abstract models which are translated into algorithms ; we focus our methodology on the minimum spanning tree problem and on Prim's algorithm. The correctness of the resulting solution is based on properties over trees and we show how the greedy strategy is efficient in this case. We compare properties proven mechanically to the properties found in a classical algorithms textbook.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007A58 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007A58 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:abrial03a
|texte= Formal derivation of spanning trees algorithms
}}
| This area was generated with Dilib version V0.6.33. |  |