On Formal Modeling of TOPPERS Embedded Software

Today embedded software is widely used. As the complexity of embedded systems grows, the number of tasks performed by embedded software is increasing. These tasks must communicate with each other to achieve synchronization. And therefore, the growing complexity of communications is making it increasingly difficult to program and debug these tasks. To confirm the correctness of embedded software, this paper introduces a formal specification language for embedded systems that can deal with their concurrent nature. After formalizing the APIs of an embedded real-time operating system, we demonstrate how to describe and verify embedded software formally.

[1]  Markus Roggenbach,et al.  CSP-Prover - A proof tool for the verification of scalable concurrent systems , 2008 .

[2]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[3]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[5]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[6]  Ken Mano,et al.  The Nepi network programming system: a programming environment for distributed systems , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[7]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .