Proving Determinacy of the PharOS Real-Time Operating System - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Proving Determinacy of the PharOS Real-Time Operating System

(1) , (2, 3) , (1) , (4, 3) , (5, 6, 3)
1
2
3
4
5
6

Abstract

Executions in the PharOS real-time system are deterministic in the sense that the sequence of local states for every process is independent of the order in which processes are scheduled. The essential ingredient for achieving this property is that a temporal window of execution is associated with every instruction. Messages become visible to receiving processes only after the time window of the sending message has elapsed. We present a high-level model of PharOS in TLA+ and formally state and prove determinacy using the TLA+ Proof System.
Fichier principal
Vignette du fichier
final.pdf (343.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01322335 , version 1 (27-05-2016)

Identifiers

Cite

Selma Azaiez, Damien Doligez, Matthieu Lemerre, Tomer Libal, Stephan Merz. Proving Determinacy of the PharOS Real-Time Operating System. Abstract State Machines, Alloy, B, TLA, VDM, and Z - 5th International Conference, ABZ 2016, May 2016, Linz, Austria. pp.70-85, ⟨10.1007/978-3-319-33600-8_4⟩. ⟨hal-01322335⟩
538 View
269 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More