Advertisement

Checking the serial correctness of control-parallel programs

  • Gilbert Caplain
  • René Lalement
  • Thierry Salset
Poster Session
Part of the Lecture Notes in Computer Science book series (LNCS, volume 817)

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.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Caplain. Correctness properties in a control-parallel extension of Fortran. Technical report, CERMICS, 1994. (to be published).Google Scholar
  2. 2.
    G. Caplain, R. Lalement, and T. Salset. Semantic analysis of a control-parallel extension of Fortran. Technical Report 93-18, CERMICS, 1993.Google Scholar
  3. 3.
    C. Pancake. Parallel Processing Model for High Level Programming Languages. ANSI, March 1992. (Proposed Standard).Google Scholar
  4. 4.
    W. Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):102–114, August 1992.CrossRefGoogle Scholar
  5. 5.
    H. Zima. Supercompilers for Parallel and Vector Computers. ACM Press, New York, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Gilbert Caplain
    • 1
  • René Lalement
    • 1
  • Thierry Salset
    • 1
  1. 1.Ecole Nationale des Ponts et Chaussées La CourtineCERMICSNoisy-le-Grand CedexFrance

Personalised recommendations