An axiomatic treatment of SIMD assignment

DOI10.1007/BF01932133zbMath0692.68013OpenAlexW1978609011MaRDI QIDQ583875

Alan Stewart

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932133

zbMATH Keywords

SIMD computation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)

Related Items (4)

Correct translation of data parallel assignment onto array processors ⋮ Formal validation of data-parallel programs: a two-component assertional proof system for a simple language ⋮ AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ ⋮ Axiomatic-like performance analysis (ALPA)

Cites Work

• SIMD language design using prescriptive semantics
• An axiomatic definition of the programming language Pascal
• R for Semantics
• The denotational semantics of programming languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An axiomatic treatment of SIMD assignment