A Spin-based model checking for the simple concurrent program on a preemptive RTOS
Abstract
We adapt an existing preemptive scheduling model of RTOS kernel by eChronos from machine-assisted proof to Spin-based model checker. The model we constructed can be automatically verified rather than formulating proofs by hand. Moreover, we look into the designs of a Linux-like real-time kernel--Piko/RT and the specification of ARMv7-M architecture to reconstruct the model, and use LTL to specify a simple concurrent programs--consumer/producer problem during the development stage of the kernel. We show that under the preemptive scheduling and the mechanism of ARMv7-M, the program will not suffer from race condition, starvation, and deadlock.
Keywords
Cite
@article{arxiv.1808.04239,
title = {A Spin-based model checking for the simple concurrent program on a preemptive RTOS},
author = {Chen-Kai Lin and Ching-Chun and Huang and Bow-Yaw Wang},
journal= {arXiv preprint arXiv:1808.04239},
year = {2018}
}
Comments
7 pages, 5 figures, The 24th Workshop on Compiler Techniques and System Software for High-Performance and Embedded Computing, 2018, Chiayi, Taiwan