Abstract
Separation logic is a recent approach to the analysis of pointer programs in which resource separation is expressed with a logical connective in assertions that describe the state at any given point in the program. We extend this approach to express properties of memory separation between different points in the program, and present an algorithm for determining independences between program statements which can be used for parallelization.
Cite
CITATION STYLE
Raza, M., Calcagno, C., & Gardner, P. (2009). Automatic parallelization with separation logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5502, pp. 348–362). https://doi.org/10.1007/978-3-642-00590-9_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.