作者: Jean Fortin , Frédéric Gava
DOI: 10.1007/978-3-319-27161-3_20
关键词:
摘要: The underlying objective of this article is to exhibit the problems that might be encountered when working on a mechanised semantics an hpc language. We take for instance language program bsp algorithms with subgroup synchronisation i la mpi. give two using coq system and prove some common properties. By comparing sizes proofs, we discuss about potential scaling would arise if like extend work mainstream or adding more routines.