Frama-C-discuss mailing list archives
This page gathers the archives of the old Frama-C-discuss archives, that was hosted by Inria's gforge before its demise at the end of 2020. To search for mails newer than September 2020, please visit the page of the new mailing list on Renater.
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Frama-c-discuss] unproven VC with newer why version
- Subject: [Frama-c-discuss] unproven VC with newer why version
- From: Claude.Marche at inria.fr (Claude Marche)
- Date: Tue, 08 Dec 2009 14:54:47 +0100
- In-reply-to: <40C72502-3C98-4574-9DC6-52FC4F981F26@first.fraunhofer.de>
- References: <40C72502-3C98-4574-9DC6-52FC4F981F26@first.fraunhofer.de>
Jens Gerlach wrote: > We were able to deductively verify the following implementation of > linear search successfully with Jessie on top of why version 2.19. > > However, with why 2.23 there is one safety related VC that remains > unproven. > In the jessie gui, the unproven VC reads "variant decreases". > > Do we have to improve the specification to get rid of that issue? > If so, how? add "loop variant n-i;" and you should be done ! Since Why 2.22, the policy for generating termination VCS is as strict as possible, to guarantee soundness (see BTS #0000103) In the future, Jessie should support ACSL "terminates" clauses, to manually annotate function for which you don;t care about termination. In a nearer future, there could a new pragma to control the generation of such VCs. Anyway: any suggestion welcome ! - Claude > > Regards Jens > > /*@ > requires n >= 0; > requires \valid_range(a, 0, n-1); > > assigns \nothing; > > behavior some: > assumes \exists int i; (0 <= i < n) && a[i] == v; > ensures 0 <= \result < n; > ensures a[\result] == v; > ensures \forall int i; (0 <= i < \result) ==> a[i] != v; > > behavior none: > assumes \forall int i; (0 <= i < n) ==> a[i] != v; > ensures \result == n; > */ > int find(const int* a, int n, int v) > { > /*@ > loop invariant 0 <= i <= n; > loop invariant \forall int k; 0 <= k < i ==> a[k] != v; > */ > for (int i = 0; i < n; ++i) > if (a[i] == v) > return i; > > return n; > } > > > -- > > Dr.-Ing. Jens Gerlach > Eingebettete Systeme - EST > Tel.: +49 (0)30 6392 1841 > Fax.: +49 (0)30 6392 1805 > E-Mail: jens.gerlach at first.fraunhofer.de > <mailto:jens.gerlach at first.fraunhofer.de> > > Fraunhofer-Institut f?r Rechnerarchitektur und Softwaretechnik, FIRST > Kekul?stra?e 7 > 12489 Berlin > Germany > http://www.first.fraunhofer.de > > > > > ------------------------------------------------------------------------ > > _______________________________________________ > 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 |
- Follow-Ups:
- [Frama-c-discuss] unproven VC with newer why version
- From: dmentre at linux-france.org (David MENTRE)
- [Frama-c-discuss] unproven VC with newer why version
- From: jens.gerlach at first.fraunhofer.de (Jens Gerlach)
- [Frama-c-discuss] unproven VC with newer why version
- From: jens.gerlach at first.fraunhofer.de (Jens Gerlach)
- [Frama-c-discuss] unproven VC with newer why version
- From: kerstin.hartig at first.fraunhofer.de (Kerstin Hartig)
- [Frama-c-discuss] unproven VC with newer why version
- References:
- [Frama-c-discuss] unproven VC with newer why version
- From: jens.gerlach at first.fraunhofer.de (Jens Gerlach)
- [Frama-c-discuss] unproven VC with newer why version
- Prev by Date: [Frama-c-discuss] unproven VC with newer why version
- Next by Date: [Frama-c-discuss] unproven VC with newer why version
- Previous by thread: [Frama-c-discuss] unproven VC with newer why version
- Next by thread: [Frama-c-discuss] unproven VC with newer why version
- Index(es):