• Home
  • Search
  • PROVING DATA-PARALLEL PROGRAMS: A UNIFYING APPROACH
  • Open Access IconOpen Access
  • Cite Icon3
  • https://doi.org/10.1142/s0129626496000455Copy DOI Icon

PROVING DATA-PARALLEL PROGRAMS: A UNIFYING APPROACH

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

We define an axiomatic semantics for a common kernel of existing data-parallel languages. We introduce an assertional language which enables us to define a weakest liberal precondition calculus which has the Definability Property, and a proof system ({\it a la\/} Hoare) which has the Completeness Property. Moreover, our axiomatic semantics integrates two previous works in the definition of proof systems for data-parallel programs. This work sheds a new light on the logical complexity of proving data-parallel programs.

Similar Papers
  • Conference Article
  • Citations8

Compiling data parallel programs to message passing programs for massively parallel MIMD systems

  • Sep 20, 1993
  • T Brandes
  • Book Chapter
  • Citations14

Data parallelism and functional programming

  • Jan 01, 1996
  • Björn Lisper
  • Conference Article
  • Citations5

Proving proof rules: a proof system for concurrent programs

  • Jan 01, 1990
  • D.M Goldschlag
  • Supplementary Content
  • Citations3

SIMD code generation in data-parallel programming

  • Jan 01, 2009
  • Publications of the UdS (Saarland University)
  • Nicolas Fritz
  • Book Chapter
  • Citations28

Towards a Unified Theory of Operational and Axiomatic Semantics

  • Jan 01, 2012
  • Grigore Roşu +1
  • Book Chapter
  • Citations1

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

  • Jan 01, 1995
  • Luc Bougé +1
  • Book Chapter
  • Citations10

Adaptor: A Compilation System for Data Parallel Fortran Programs

  • Jan 01, 1994
  • Thomas Brandes
  • Supplementary Content
  • Citations1

Programming abstractions, compilation, and execution techniques for massively parallel data analysis

  • Apr 28, 2015
  • DepositOnce
  • Stephan Ewen
  • Book Chapter
  • Citations98

An overview of the Fortran D programming system

  • Jan 25, 2006
  • S Hiranandani +4
  • Research Article

Using Program Transformations to Provide Safety Properties for Real-Time Systems

  • Jul 01, 2004
  • Real-Time Systems
  • Grace Tsai +1
  • Research Article

Deriving a Fault Tolerant Real Time Program using Program Verification

  • Nov 01, 2001
  • IFAC Proceedings Volumes
  • Grace Tsai +1
  • Conference Article
  • Citations42

A comparison of message passing and shared memory architectures for data parallel programs

  • Apr 01, 1994
  • Alexander C Klaiber +1
  • Research Article
  • Citations9

A comparison of message passing and shared memory architectures for data parallel programs

  • Apr 01, 1994
  • ACM SIGARCH Computer Architecture News
  • A C Klaiber +1
  • Research Article
  • Citations3

On the consistency of distributed proofs with hidden subtrees

  • Jul 01, 2010
  • ACM Transactions on Information and System Security
  • Adam J Lee +2
  • Book Chapter
  • Citations11

An axiomatic treatment of a parallel programming language

  • Jan 01, 1985
  • Stephen D Brookes
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.