A proof system for a PGAS language

DOI10.1007/978-3-642-11512-7_11zbMATH Open1274.68038OpenAlexW2117262103MaRDI QIDQ5187828FDOQ5187828

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)