arXiv Open Access 2018

A Spin-based model checking for the simple concurrent program on a preemptive RTOS

Chen-Kai Lin Ching-Chun Huang Bow-Yaw Wang

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.OS cs.FL cs.LO

Penulis (4)

Chen-Kai Lin

Ching-Chun

Huang

Bow-Yaw Wang

Format Sitasi

APA MLA BibTeX

Lin, C., Ching-Chun, Huang, Wang, B. (2018). A Spin-based model checking for the simple concurrent program on a preemptive RTOS. https://arxiv.org/abs/1808.04239

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓