Checking sequential correctness in shared-memory parallel programs (Q2706056)

The author of this interesting paper studies a property of correctness of programs written in a shared-memory parallel language. The above stated property is a semantic equivalence between the parallel program and its sequential version. In this framework, it is required that the parallel programs perform the same computations, hence produce the same results, as its sequential version, just faster. The main statement is a theorem, which ensures this correctness property under some hypotheses, mainly a dependence preservation condition. These hypotheses refer to the semantics of the sequential version. Some extensions of this result are presented as well. Technical details are provided in CERMICS research report 99-180 and CERMICS research report 99-181 (1999).