Abstract
We study the serial correctness of programs in a subset of Fortran X3H5, a control-parallel extension of Fortran. This property, an equivalence between a parallel program and its sequential version, follows from the preservation of dependences, defined on the sequential version, by the control flow and the synchronizations. To check this preservation, we propose an algorithm which builds a formula, using a new kind of block graph. Under a linearity assumption, the algorithm tries to prove that this formula is a tautology by means of the Omega test.
Preview
Unable to display preview. Download preview PDF.
References
G. Caplain. Correctness properties in a control-parallel extension of Fortran. Technical report, CERMICS, 1994. (to be published).
G. Caplain, R. Lalement, and T. Salset. Semantic analysis of a control-parallel extension of Fortran. Technical Report 93-18, CERMICS, 1993.
C. Pancake. Parallel Processing Model for High Level Programming Languages. ANSI, March 1992. (Proposed Standard).
W. Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):102–114, August 1992.
H. Zima. Supercompilers for Parallel and Vector Computers. ACM Press, New York, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caplain, G., Lalement, R., Salset, T. (1994). Checking the serial correctness of control-parallel programs. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_146
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_146
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive