Automatic parallelization with separation logic

Mohammad Raza; Cristiano Calcagno; Philippa Gardner

doi:10.1007/978-3-642-00590-9_25

Automatic parallelization with separation logic

Mohammad Raza, Cristiano Calcagno, Philippa Gardner

Imperial College London

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Citations (Scopus)

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
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-00590-9_25
Publication status	Published - 2009
Externally published	Yes
Event	18th European Symposium on Programming, ESOP 2009 - York, United Kingdom Duration: 22 Mar 2009 → 29 Mar 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5502
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th European Symposium on Programming, ESOP 2009
Country/Territory	United Kingdom
City	York
Period	22/03/09 → 29/03/09

Access to Document

10.1007/978-3-642-00590-9_25

https://scholar.google.com/citations?view_op=view_citation&hl=en&user=VPEWcZcAAAAJ&pagesize=100&citation_for_view=VPEWcZcAAAAJ:eQOLeE2rZwMC

Cite this

@inproceedings{aac7e6d5ef56433a9a2ac7145f558217,

title = "Automatic parallelization with separation logic",

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.",

author = "Mohammad Raza and Cristiano Calcagno and Philippa Gardner",

year = "2009",

doi = "10.1007/978-3-642-00590-9\_25",

language = "English",

isbn = "9783642005893",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "348--362",

booktitle = "18th European Symposium on Programming, ESOP 2009",

note = "18th European Symposium on Programming, ESOP 2009 ; Conference date: 22-03-2009 Through 29-03-2009",

}

Raza, M, Calcagno, C & Gardner, P 2009, Automatic parallelization with separation logic. in 18th European Symposium on Programming, ESOP 2009. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5502, pp. 348-362, 18th European Symposium on Programming, ESOP 2009, York, United Kingdom, 22/03/09. https://doi.org/10.1007/978-3-642-00590-9_25

Automatic parallelization with separation logic. / Raza, Mohammad; Calcagno, Cristiano; Gardner, Philippa.
18th European Symposium on Programming, ESOP 2009. 2009. p. 348-362 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5502).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Automatic parallelization with separation logic

AU - Raza, Mohammad

AU - Calcagno, Cristiano

AU - Gardner, Philippa

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/67650176044

U2 - 10.1007/978-3-642-00590-9_25

DO - 10.1007/978-3-642-00590-9_25

M3 - Conference contribution

SN - 9783642005893

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 348

EP - 362

BT - 18th European Symposium on Programming, ESOP 2009

T2 - 18th European Symposium on Programming, ESOP 2009

Y2 - 22 March 2009 through 29 March 2009

ER -

Automatic parallelization with separation logic

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this