Complete formal verification of the PSTM transaction Scheduler

State of the art formal verification is based on methods and its goal proving given correctness properties. For example, a PSTM scheduler was modeled in CSP order to prove deadlock-freeness starvation-freeness. However, as this paper shows, using solely not sufficient. Therefore, we propose complete trustworthy software, which jointly uses model testing. As an first test previous transaction by comparing checker PAT results with manually derived expected results, for workloads. Next, according testing, correct extend model. Finally, new model, analyze performance online scheduling algorithms from perspective relative speedup.