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] Using frama-c to verify coding patterns of concurrent sw

  • Subject: [Frama-c-discuss] Using frama-c to verify coding patterns of concurrent sw
  • From: Oyvind.Teig at (Teig, Oyvind CCS)
  • Date: Mon, 1 Jul 2013 12:29:12 +0000


?        I have sw processes (task, thread etc..) as C functions

?        They are called by a scheduler, and will be rescheduled to the first line after the descheduling point [1]

?        So, scheduling is "cooperative", not preemptive (i.e. the "channel drives the scheduling")

?        Local context in each process is allocated on the heap, so state that survive scheduling is stored there

?        I have described a couple of patterns that are interesting to verify with frama-C ...[2], [3]

?        Is it possible to set up an ACSL specification that would be able to verify that certain combinations of local state variables _now_ and certain other combinations _later_ on will sooner or later arrive?

?        Even more than that: I will need to verify more than two steps!

[1] - "New ALT for Application Timers and Synchronisation Point Scheduling" at
[2] -" XCHANs: Notes on a New Channel Type at
[3] - "The "knock-come" deadlock free pattern" at

Med vennlig hilsen / Best regards

?yvind Teig
Senior utviklingsingeni?r,  / Senior development engineer, M.Sc.
Autronica Fire and Security AS
UTC CCS EMEA Fire & Security Operations
Phone: + 47 73 58 24 68 / Mobile +47 959 61 506
E-mail:  oyvind.teig at<mailto:oyvind.teig at><><> (also work-related)

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>