DocumentCode :
1688143
Title :
Modeling and Verifying the Code-Level OSEK/VDX Operating System with CSP
Author :
Huang, Yanhong ; Zhao, Yongxin ; Zhu, Longfei ; Li, Qin ; Zhu, Huibiao ; Shi, Jianqi
Author_Institution :
Shanghai Key Lab. of Trustworthy Comput., East China Normal Univ., Shanghai, China
fYear :
2011
Firstpage :
142
Lastpage :
149
Abstract :
As an automotive industry standard of operating system specification, OSEK/VDX is widely applied in the process of designing and implementing the static operating system and the corresponding interfaces for automotive electronics. It is challenging to explore an effective method to support large-scale correctness verification of OSEK/VDX specification. In this paper, we employ process algebra CSP to describe and reason about a real code-level OSEK/VDX operating system. Thus the whole system is formally modeled as a CSP process which is encoded and implemented in process analysis toolkit (PAT). Furthermore, the expected properties are described and expressed in terms of the first-order logic. The properties are also established and verified in our framework. The result indicates that the whole system is deadlock-free and the scheduling scheme is sound with respect to the specification.
Keywords :
formal specification; formal verification; operating systems (computers); process algebra; scheduling; CSP process algebra; OSEK-VDX specification; automotive electronics; automotive industry standard; code-level OSEK-VDX operating system; correctness verification; first-order logic; operating system specification; process analysis toolkit; scheduling scheme; Analytical models; Arrays; Job shop scheduling; Operating systems; Reactive power; Real time systems; Resource management;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Theoretical Aspects of Software Engineering (TASE), 2011 Fifth International Symposium on
Conference_Location :
Xi´an, Shaanxi
Print_ISBN :
978-1-4577-1487-0
Type :
conf
DOI :
10.1109/TASE.2011.11
Filename :
6042072
Link To Document :
بازگشت