Parallel programming is rapidly gaining importance as a vector to develop high performance applications that exploit the improved capabilities of modern computer architectures. In consequence, there is a need to develop analysis and verification methods for parallel programs. Sequoia is a language designed to program parallel divide-and-conquer programs over a hierarchical, tree-structured, and explicitly managed memory. Using abstract interpretation, we develop a compositional proof system to analyze Sequoia programs and reason about them. Then, we show that common program optimizations transform provably correct Sequoia programs into provably correct Sequoia programs. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Barthe, G., Kunz, C., & Sacchini, J. L. (2008). Certified reasoning in memory hierarchies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5356 LNCS, pp. 75–90). Springer Verlag. https://doi.org/10.1007/978-3-540-89330-1_6
Mendeley helps you to discover research relevant for your work.