A formal framework for the study of concurrent program testing

The author has developed a formal theory for reasoning about concurrent program testing by representing such programs as sets of simulating sequential programs. He has shown that if such a representation exists for all programs in a concurrent language, then it serves as the basis for a solution to the reproducible testing problem of programs in that language. The author does not know under what circumstances such a representation must necessarily exist; that is an open question. However, he has shown that it exists for a simple concurrent language in the CSP family, denoted language CL, and he believes that the model is applicable to other languages in the family. Because CL is currently unimplemented, no pragmatic studies have been done on the feasibility of applying the model.<<ETX>>