Ghosts for Lists: A Critical Module of Contiki Verified in Frama-C - Archive ouverte HAL Access content directly
Conference Papers Year :

Ghosts for Lists: A Critical Module of Contiki Verified in Frama-C

(1) , (2) , (3, 4)
1
2
3
4

Abstract

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.
Fichier principal
Vignette du fichier
contiki-lists.pdf (177.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01720401 , version 1 (01-03-2018)

Identifiers

Cite

Allan Blanchard, Nikolai Kosmatov, Frédéric Loulergue. Ghosts for Lists: A Critical Module of Contiki Verified in Frama-C. Tenth NASA Formal Methods Symposium - NFM 2018, Apr 2018, Newport News, United States. ⟨10.1007/978-3-319-77935-5_3⟩. ⟨hal-01720401⟩
253 View
568 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More