Conference paper Open Access
Ghosts for Lists: A Critical Module of Contiki Verified in Frama-C
Blanchard, Allan; Kosmatov Nikolai; Loulergue, Frederic
Internet of Things (IoT) applications are becoming increasingly critical and require rigorous formal verification. In this paper we target Contiki, a widely used open-source OS for IoT, and present a verification case study of one of its most critical modules: that of linked lists. Its API and list representation differ from the classical linked list implementations, and are particularly challenging for deductive verification. The proposed verification technique relies on a parallel view of a list through a companion ghost array. This approach makes it possible to perform most proofs automatically using the Frama-C/WP tool, only a small number of auxiliary lemmas being proved interactively in the Coq proof assistant. We present an elegant segment-based reasoning over the companion array developed for the proof. Finally, we validate the proposed specification by proving a few functions manipulating lists.
| Name | Size | |
|---|---|---|
|
contiki-lists.pdf
md5:5f661fee46c570892904bf65c3172ef9 |
513.0 kB | Download |
| All versions | This version | |
|---|---|---|
| Views | 54 | 54 |
| Downloads | 123 | 122 |
| Data volume | 63.1 MB | 62.6 MB |
| Unique views | 45 | 45 |
| Unique downloads | 119 | 118 |
- Publication date:
- April 19, 2018
- DOI:
-
- Keyword(s):
- linked lists deductive verification operating system internet of things Frama-C
- Grants:
-
European Commission:
- VESSEDIA - VERIFICATION ENGINEERING OF SAFETY AND SECURITY CRITICAL DYNAMIC INDUSTRIAL APPLICATIONS (731453)
- Meeting:
- Tenth NASA Formal Methods Symposium (NFM 2018),, United States, April 2018
- Communities:
- License (for files):
- Creative Commons Attribution 4.0 International