Implementing deterministic declarative concurrency using sieves

Sam Lindley

doi:10.1145/1248648.1248657

Implementing deterministic declarative concurrency using sieves

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

Abstract

The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a simple way of adding deterministic declarative concurrency to imperative programming languages. Sieve programs have a straightforward semantics, are not significantly more difficult to reason about than sequential imperative programs, and should scale to large numbers of processors as well as different processor architectures.

Original language	English
Title of host publication	Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, DAMP 2007, Nice, France, January 16, 2007
Publisher	ACM
Pages	45-49
Number of pages	5
ISBN (Print)	978-1-59593-690-5
DOIs	https://doi.org/10.1145/1248648.1248657
Publication status	Published - 2007

Access to Document

10.1145/1248648.1248657

Lindley 2007 Implementing deterministic declarative concurrency using sievesSubmitted manuscript, 136 KB

http://doi.acm.org/10.1145/1248648.1248657

Cite this

@inproceedings{b73a01aa7cef476fa17346a08292f882,

title = "Implementing deterministic declarative concurrency using sieves",

abstract = "The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a simple way of adding deterministic declarative concurrency to imperative programming languages. Sieve programs have a straightforward semantics, are not significantly more difficult to reason about than sequential imperative programs, and should scale to large numbers of processors as well as different processor architectures.",

author = "Sam Lindley",

year = "2007",

doi = "10.1145/1248648.1248657",

language = "English",

isbn = "978-1-59593-690-5",

pages = "45--49",

booktitle = "Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, DAMP 2007, Nice, France, January 16, 2007",

publisher = "ACM",

}

TY - GEN

T1 - Implementing deterministic declarative concurrency using sieves

AU - Lindley, Sam

PY - 2007

Y1 - 2007

N2 - The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a simple way of adding deterministic declarative concurrency to imperative programming languages. Sieve programs have a straightforward semantics, are not significantly more difficult to reason about than sequential imperative programs, and should scale to large numbers of processors as well as different processor architectures.

AB - The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a simple way of adding deterministic declarative concurrency to imperative programming languages. Sieve programs have a straightforward semantics, are not significantly more difficult to reason about than sequential imperative programs, and should scale to large numbers of processors as well as different processor architectures.

U2 - 10.1145/1248648.1248657

DO - 10.1145/1248648.1248657

M3 - Conference contribution

SN - 978-1-59593-690-5

SP - 45

EP - 49

BT - Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, DAMP 2007, Nice, France, January 16, 2007

PB - ACM

ER -

Implementing deterministic declarative concurrency using sieves

Abstract

Access to Document

Fingerprint

Cite this