J. Abrial, The B-Book -Assigning Programs to Meanings, 1996.

J. Abrial, B#: Toward a Synthesis between Z and B, 3nd International Conference of B and Z Users -ZB 2003, 2003.
DOI : 10.1007/3-540-44880-2_12

J. Abrial and D. Cansell, Click'n'prove: Interactive proofs within set theory, 16th Intl. Conf. Theorem Proving in Higher Order Logics (TPHOLs'2003), pp.2758-2759, 2003.
DOI : 10.1007/10930755_1
URL : https://hal.archives-ouvertes.fr/inria-00099836

J. Abrial, D. Cansell, and D. Méry, Formal Derivation of Spanning Trees Algorithms, 3nd International Conference of B and Z Users -ZB 2003, 2003.
DOI : 10.1007/3-540-44880-2_27
URL : https://hal.archives-ouvertes.fr/inria-00099793

J. Abrial, D. Cansell, and D. Méry, Generic development of event based systems, 2002.

B. Charlier, The Greedy Algorithms Class: Formalization, Synthesis and Generalization, Lectures Notes, 1995.

. Clearsy, Web site B4free set of tools for development of B models, 2004.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

S. A. Curtis, The classification of greedy algorithms, Science of Computer Programming, vol.49, issue.1-3, pp.125-157, 2003.
DOI : 10.1016/j.scico.2003.09.001

A. Kaldewaij and B. Schoenmakers, Searching by elimination, Science of Computer Programming, vol.14, issue.2-3, pp.243-254, 1990.
DOI : 10.1016/0167-6423(90)90022-6
URL : http://dx.doi.org/10.1016/0167-6423(90)90022-6