A proof system for a PGAS language

DOI10.1007/978-3-642-11512-7_11MaRDI QIDQ5187828zbMATH OpenOpenAlexFDO

Authors Shivali Agarwal, R. K. Shyamasundar

Publication date 9 March 2010

Published in Concurrency, Compositionality, and Correctness (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11512-7_11

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• A theory of partitioned global address spaces
• CONCUR 2005 – Concurrency Theory
• A proof technique for parallel programs
• Formal validation of data-parallel programs: a two-component assertional proof system for a simple language
• scientific article; zbMATH DE number 3907747

Cites work

• A Complete Guide to the Future
• A Proof System for Communicating Sequential Processes
• An assertion-based proof system for multithreaded Java
• An axiomatic proof technique for parallel programs
• CONCUR 2005 – Concurrency Theory
• Compositional semantics for real-time distributed computing
• Refinement calculus: A basis for translation validation, debugging and certification
• The semantics of future and an application
• Type systems for distributed data structures

Cited in

(2)

• CONCUR 2005 – Concurrency Theory
• A theory of partitioned global address spaces

This page was built for publication: A proof system for a PGAS language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187828)