--- layout: fc_discuss_archives title: Message 25 from Frama-C-discuss on November 2018 ---
See also (automatic path-test generation with the PathCrawler plugin to MEASURE worst-case execution time): http://pathcrawler-online.com:8080/pubs/ast09researchcopy.pdf On 26/11/2018 12:54, François Bobot wrote: > Le 26/11/2018 à 12:31, Tomas Härdin a écrit : >>> By the way, you say in your post: >>>> Frama-C is not a panacea, since it says nothing about how long a >>>> program might take to execute. >>>  In fact, some research work has been done on that topic: >>>  Certifying and Reasoning on Cost Annotations in C Programs >>>  https://link.springer.com/chapter/10.1007%2F978-3-642-32469-7_3 >> Neat. Can't access the paper, sadly. > It is accessible here: > https://hal.inria.fr/hal-00702665v2/document > > A broader overview of the project is available here > Certified complexity (cerco): > http://cerco.cs.unibo.it/export/3340/Papers/fopara2013/fopara13.pdf > > > But the simplifying part is that is is applied to a 8051 processor which doesn't have pipeline and > cache. > > Best, >