259
views
0
recommends
+1 Recommend
1 collections
    4
    shares
       
      • Record: found
      • Abstract: found
      • Conference Proceedings: found
      Is Open Access

      An Axiomatic Semantics for Data-Parallel Computation

      proceedings-article

      Proceedings of the 1st Irish Workshop on Formal Methods (FM)

      Irish Workshop on Formal Methods

      3-4 July 1997

      verification, data-parallel computation

      Bookmark

            Abstract

            Proof rules for both directly and indirectly indexed data-parallel array assignment are presented. Consequently, the correctness of two programs, (i) a representation of Cannon’s algorithm and (ii) sparse matrix-vector multiplication, are established by application of the rules.

            Content

            Author and article information

            Contributors
            Conference
            September 1997
            September 1997
            : 1-7
            Affiliations
            [0001]Department of Computer Science, The Queen's University of Belfast

            Belfast BT7 1NN
            Article
            10.14236/ewic/FM1997.13
            9879e243-574a-4174-9b37-c38544b8d13c
            © A.Stewart. Published by BCS Learning and Development Ltd. Proceedings of the 1st Irish Workshop on Formal Methods, Dublin

            This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

            Proceedings of the 1st Irish Workshop on Formal Methods
            FM
            1
            Dublin
            3-4 July 1997
            Electronic Workshops in Computing (eWiC)
            Irish Workshop on Formal Methods
            Product
            Product Information: 1477-9358BCS Learning & Development
            Self URI (journal page): https://ewic.bcs.org/
            Categories
            Electronic Workshops in Computing

            Comments

            Comment on this article