A capability calculus for concurrency and determinism

Tachio Terauchi; Alex Aiken

doi:10.1007/11817949_15

A capability calculus for concurrency and determinism

Tachio Terauchi^*, Alex Aiken

^*Corresponding author for this work

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

10 Citations (Scopus)

Abstract

We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent than previous approaches and is able to handle a mix of different kinds of communication channels, including shared reference cells.

Original language	English
Title of host publication	CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings
Publisher	Springer Verlag
Pages	218-232
Number of pages	15
ISBN (Print)	3540373764, 9783540373766
DOIs	https://doi.org/10.1007/11817949_15
Publication status	Published - 2006
Externally published	Yes
Event	17th International Conference on Concurrency Theory, CONCUR 2006 - Bonn, Germany Duration: 2006 Aug 27 → 2006 Aug 30

Publication series

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

Other

Other	17th International Conference on Concurrency Theory, CONCUR 2006
Country/Territory	Germany
City	Bonn
Period	06/8/27 → 06/8/30

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11817949_15

Cite this

Terauchi, T., & Aiken, A. (2006). A capability calculus for concurrency and determinism. In CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings (pp. 218-232). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4137 LNCS). Springer Verlag. https://doi.org/10.1007/11817949_15

A capability calculus for concurrency and determinism. / Terauchi, Tachio; Aiken, Alex.

CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings. Springer Verlag, 2006. p. 218-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4137 LNCS).

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

Terauchi, T & Aiken, A 2006, A capability calculus for concurrency and determinism. in CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4137 LNCS, Springer Verlag, pp. 218-232, 17th International Conference on Concurrency Theory, CONCUR 2006, Bonn, Germany, 06/8/27. https://doi.org/10.1007/11817949_15

@inproceedings{13667fdc13be4a7d89aa8001316b3606,

title = "A capability calculus for concurrency and determinism",

abstract = "We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent than previous approaches and is able to handle a mix of different kinds of communication channels, including shared reference cells.",

author = "Tachio Terauchi and Alex Aiken",

year = "2006",

doi = "10.1007/11817949_15",

language = "English",

isbn = "3540373764",

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

publisher = "Springer Verlag",

pages = "218--232",

booktitle = "CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings",

}

TY - GEN

T1 - A capability calculus for concurrency and determinism

AU - Terauchi, Tachio

AU - Aiken, Alex

PY - 2006

Y1 - 2006

N2 - We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent than previous approaches and is able to handle a mix of different kinds of communication channels, including shared reference cells.

AB - We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent than previous approaches and is able to handle a mix of different kinds of communication channels, including shared reference cells.

UR - http://www.scopus.com/inward/record.url?scp=33749580034&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749580034&partnerID=8YFLogxK

U2 - 10.1007/11817949_15

DO - 10.1007/11817949_15

M3 - Conference contribution

AN - SCOPUS:33749580034

SN - 3540373764

SN - 9783540373766

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

SP - 218

EP - 232

BT - CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings

PB - Springer Verlag

T2 - 17th International Conference on Concurrency Theory, CONCUR 2006

Y2 - 27 August 2006 through 30 August 2006

ER -

A capability calculus for concurrency and determinism

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this