Coq proofs for the schedulability analysis of TDMA

We have formalized and proven the standard worst-case response time analysis for the TDMA scheduling policy on uniprocessor systems in Coq.

The source code can be found here.

Comments are closed.

Internal Affairs
Search for:

Wiki Spades
Inria-RA Intranet
HAL Tools
Zimbra

Powered by Nirvana & WordPress. Mentions légales & CGU & Politique de confidentialité & Cookies

We are using cookies to give you the best experience on our website.

You can find out more about which cookies we are using or switch them off in .

Privacy Overview

This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.

Strictly Necessary Cookies

Strictly Necessary Cookie should be enabled at all times so that we can save your preferences for cookie settings.

Enable or Disable Cookies

If you disable this cookie, we will not be able to save your preferences. This means that every time you visit this website you will need to enable or disable cookies again.

Coq proofs for the schedulability analysis of TDMA

Internal Affairs