Advertisement

On the completeness of a proof system for a simple data-parallel programming language (extended abstract)

  • Luc Bougé
  • David Cachera
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 966)

Abstract

We prove the completeness of an assertional proof system for a simple loop-free data-parallel language. This proof system is based on two-part assertions, where the predicate on the current value of variables is separated from the specification of the current extent of parallelism. The proof is based on a Weakest Precondition (WP) calculus. In contrast with the case of usual scalar languages, not all WP can be defined by an assertion. Yet, partial definability suffices to prove the completeness thanks to the introduction of hidden variables in assertions. The case of data-parallel programs with loops is briefly discussed in the conclusion.

Keywords

Concurrent Programming Specifying and Verifying and Reasoning about Programs Semantics of Programming Languages Data-Parallel Languages Proof System Hoare Logic Weakest Preconditions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K.R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Text and Monographs in Computer Science. Springer Verlag, 1990.Google Scholar
  2. 2.
    L. Bougé and D. Cachera. On the completeness of a proof system for a simple dataparallel programming language. Research Report 94-42, LIP ENS Lyon, France, December 1994. Available at URL ftp://ftp.lip.ens-lyon.fr/pub/Rapports/ RR/RR94/RR94-42.ps.Z.Google Scholar
  3. 3.
    L. Bougé, Y. Le Guyadec, G. Utard, and B. Virot. On the expressivity of a weakest preconditions calculus for a simple data-parallel programming language. In ConPar'94-VAPP VI, Linz, Austria, September 1994.Google Scholar
  4. 4.
    L. Bougé, Y. Le Guyadec, G. Utard, and B. Virot. A proof system for a simple data-parallel programming language. In C. Girault, editor, Proc. of Applications in Parallel and Distributed Computing, Caracas, Venezuela, April 1994. IFIP WG 10.3, North-Holland.Google Scholar
  5. 5.
    L. Bougé and J.-L. Levaire. Control structures for data-parallel SIMD languages: semantics and implementation. Future Generation Computer Systems, 8:363–378, 1992.Google Scholar
  6. 6.
    M. Clint and K.T. Narayana. On the completeness of a proof system for a synchronous parallel programming langage. In Third Conf. Found. Softw. Techn. and Theor. Comp. Science, Bangalore, India, December 1983.Google Scholar
  7. 7.
    E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.Google Scholar
  8. 8.
    J. Gabarró and R. Gavaldà. An approach to correctness of data parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):185–201, August 1994.Google Scholar
  9. 9.
    M.J.C. Gordon. Programming Language Theory and its Implementation. Prentice Hall International, 1988.Google Scholar
  10. 10.
    C.A.R. Hoare. An axiomatic basis for computer programming. Comm of the ACM, 12:576–580, 1969.Google Scholar
  11. 11.
    A. Stewart. An axiomatic treatment of SIMD assignment. BIT, 30:70–82, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Luc Bougé
    • 1
  • David Cachera
    • 1
  1. 1.LIP, ENS LyonLyon Cédex 07France

Personalised recommendations