--- layout: fc_discuss_archives title: Message 6 from Frama-C-discuss on July 2009 ---
Hi, The binary search examples in the jessie tutorial should be a reference for that: http://frama-c.cea.fr/jessie_tutorial_index.html the lemma is proven only by Yices. Note that the tutorial was run under Lithium, under Beryllium-beta you might face small differences: in that case do not hesitate to tell us which differences you have. - Claude Kerstin Hartig wrote: > Hello, > > I am trying to prove the numerous binary_search examples you provided with > your sources. > > But I would like to know which example under what configuration was proven > and if there is a necessary integer call like exact or bounded to get a full > proof. > > So far, I am unable to prove even the lemma you created along with the > algorithm. > > (Lithium, Vista, any Prover) > > Sincerely > > Christoph > > _______________________________________________ > Frama-c-discuss mailing list > Frama-c-discuss at lists.gforge.inria.fr > http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/frama-c-discuss > -- Claude March? | tel: +33 1 72 92 59 69 INRIA Saclay - ?le-de-France | mobile: +33 6 33 14 57 93 Parc Orsay Universit? | fax: +33 1 74 85 42 29 4, rue Jacques Monod - B?timent N | http://www.lri.fr/~marche/ F-91893 ORSAY Cedex |