Abstract
The paper describes the semantics of an elementary language for data parallel computation that is based on an abstract parallel machine. The semantics of the language is described in both a mathematical and an operational manner. The mathematical semantics can be used to prove the correctness of algorithms specified in the language. The operational semantics provides a CSP description of an abstract machine that can be used to execute programs written in the language. The latter portion of the paper establishes that the two semantic descriptions are equivalent.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
