Reasoning about data-parallel pointer programs in a modal extension of separation logic

Authors:
Susumu Nishimura
Affiliations:
Department of Mathematics, Faculty of Science, Kyoto University, Kyoto, Japan
Venue:
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Year:
2006

Citing 10
Cited 0

Data parallel algorithms

Communications of the ACM - Special issue on parallelism
Efficient parallel algorithms

Efficient parallel algorithms
Data-parallel programming on MIMD computers

Data-parallel programming on MIMD computers
A provable time and space efficient implementation of NESL

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Formal validation of data-parallel programs: a two-component assertional proof system for a simple language

Theoretical Computer Science
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Semantic Basis for Local Reasoning

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Parallel functional programming on recursively defined data via data-parallel recursion

Journal of Functional Programming
A logical analysis of aliasing in imperative higher-order functions

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a modal extension of Separation Logic [1,2] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logic provides a formal means for expressing allocation of disjoint substructures, which are to be processed in parallel. A modal operator is also introduced to relate the global property of a parallel operation with the local property of each sequential execution running in parallel. The effectiveness of the logic is demonstrated through a formal reasoning on the parallel list scan algorithm featuring the pointer jumping technique.