--- layout: fc_discuss_archives title: Message 18 from Frama-C-discuss on May 2014 ---
Good morning. While training on Frama-C in a Semanthics class, I tried the example shown on page 41 of ACSL handbook ( http://frama-c.com/download/acsl-implementation-Neon-20140301.pdf), which exemplifies a possible implementation of Extended Euclide Algorithm. However, I was not able to proof any relevant property: am I missing something? The code is attached. I am using Frama-C Neon on a 64-bit Fedora 20. I used Alt-Ergo (Native) as theorem proover, having enabled both RTE and Invariants. The Bezout property could not be proved in the contract (orange ball) but is partially proved before the while loop, inside the function (green/red ball). Waiting for an answer, I offer my best regards -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.gforge.inria.fr/pipermail/frama-c-discuss/attachments/20140523/c79446a6/attachment.html> -------------- next part -------------- A non-text attachment was scrubbed... Name: extended_Euclid.c Type: text/x-csrc Size: 566 bytes Desc: not available URL: <http://lists.gforge.inria.fr/pipermail/frama-c-discuss/attachments/20140523/c79446a6/attachment.c>