Towards the Pervasive Verification of Automotive Systems

Abstract

Abstract. The tutorial reviews recent results from the Verisoft project [1]. We present a uniform mathematical theory, in which we can formulate pervasive correctness proofs for very large portions of automotive computer systems.The basic ingredients of this theory are (i) correctness of processors with memory mamagement units and external interrupts The programming model for applications under this operating system is very simple: several (compiled) C programs run on each ECU in so called rounds under a fixed schedule. With the help of system calls the applications can update and poll a set of shared variables. The times for updating each shared variable are fixed by the schedule, too. An update to a shared variable in round k is visible to all application programs that poll this variable in round k + 2. This programming model is very close to the model used in [12], where formal correctness proofs for a distributed emergency call application in cars are reported.Worst case timing analysis permits to guarantee, that applications and drivers satisfy the requirements of the schedule. If the requirements of the schedule are satisfied and the interfaces are programmed as prescribed by the schedule, then one can show that the user model is implememented by compiler, operating system and hardware [6].An effort for the formal verification of all parts of the theory presented here is under way [13]. We report also on the status of this effort. References