Journal article icon

Journal article

Syntactic control of concurrency

Abstract:

We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown that may-equivalence of second-order open terms is undecidable we set out to find a framework in which decidability can be regained with minimum loss of expressivity. To that end we define an annotated type system that controls the number of concurrent threads created by terms and give a fully abstract game semantics for the noti...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.tcs.2005.10.032

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Engineering and Physical Sciences Research Council More from this funder
Natural Sciences and Engineering Research Council of Canada More from this funder
St John's College More from this funder
Publisher:
Elsevier Publisher's website
Journal:
Theoretical Computer Science Journal website
Volume:
350
Issue:
2-3
Pages:
234–251
Publication date:
2006-02-01
DOI:
ISSN:
0304-3975
Language:
English
Keywords:
Subjects:
UUID:
uuid:c9fcbd8b-2adc-43c6-951d-ed6a6efc76e4
Local pid:
ora:10762
Deposit date:
2015-03-30

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP