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.
Original language | English |
---|---|
Title of host publication | 18th European Symposium on Programming, ESOP 2009 |
Pages | 348-362 |
DOIs | |
Publication status | Published - 2009 |
Externally published | Yes |