Verification of Safety and Liveness on Process Management System using Spin Model Checker

Process management deals with processor mechanisms to execute the processes. Nowadays an efficient process management algorithm is necessary for the efficient load balancing of the processor. Algorithm efficiency and time complexity always depend upon its correctness. We address a problem related to ensuring the correctness of the process management system by checking safety and liveness properties and giving an algorithm which is easy to understand and ensure its correctness using model checking techniques. Model checking is used to formally verify the hardware and software system. There exist various algorithms with different approaches to give a complex and efficient process managing system. To the best of our knowledge, formal verification of algorithms using model-checking techniques, particularly with the SPIN model checker, is not done. We give solution of this problem by doing formal verification of proposed algorithm using SPIN. In this paper, we first give an algorithm for the system. After that formal verification of the algorithm takes place in such a way that first, we generate a program graph for the system. Second, we define the safety and liveness properties of the system according to requirements and then convert these properties in the form of LTL formulas After all of this we give the LTL formula and program graph as input to the SPIN the model checker. Model checker will ensure whether the program graph satisfies the LTL formula or not.