An empirical study over correctness properties for multithreaded programs

Developing multithreaded programs has been difficult, especially when dealing with non-deterministic programs. It is nearly impossible to achieve completeness and soundness for multithreaded programs. In recent years, a number of verification tools have been developed in order to support multithreaded programs to achieve completeness and soundness. Verification tools developed through analyzing correctness properties. However, existing tools are still unable to discover all possible correctness properties for multithreaded programs and most of the tools only verifies deterministic multithreaded programs. In this paper, we have given an empirical study on the correctness of multithreaded programs and analyzed all possible correctness properties in existing verification tools. We have compared existing tools with a number of possible properties and evaluated possible improvements for developing a correct multithreaded program. With the findings of these properties, we also analyzed the high-priority and low-priority correctness properties for multithreaded programs