Incremental Parametric Development of Greedy Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Incremental Parametric Development of Greedy Algorithms


The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properties. We address the problem of development of greedy algorithms using the seminal work of S. Curtis; she has formalised greedy algorithms in a relational calculus and has provided a list of results ensuring optimality results. Our first contribution is a re-modelling of Curtis's results in the event B framework and a mechanical checking of theorems on greedy algorithms The second contribution is the reuse of the mathematical framework for developing greedy algorithms from event B models; since the resulting event B models are generic, we show how to instantiate generic event B models to derive specific greedy algorithms; generic event B developments help in managing proofs complexity. Consequently, we contribute to the design of a library of proof-based developed algorithms.
Fichier principal
Vignette du fichier
canselmeryavocs.pdf (220.59 Ko) Télécharger le fichier

Dates and versions

inria-00089497 , version 1 (18-08-2006)


  • HAL Id : inria-00089497 , version 1


Dominique Cansell, Dominique Méry. Incremental Parametric Development of Greedy Algorithms. 6th International Workshop on Automatic Verification of Critical Systems - AVoCS 2006, Sep 2006, Nancy, France. pp.48-62. ⟨inria-00089497⟩
95 View
174 Download


Gmail Facebook Twitter LinkedIn More