Conference item
On hierarchical communication topologies in the pi-calculus
- Abstract:
-
This paper is concerned with the shape invariants satisfied by the communication topology of π-terms, and the automatic inference of these invariants. A π-term P is hierarchical if there is a finite forest T such that the communication topology of every term reachable from P satisfies a T -shaped invariant. We design a static analysis to prove a term hierarchical by means of a novel type system that enjoys decidable inference. The soundness proof of the type system employs a non-standard view...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Publisher copy:
- 10.1007/978-3-662-49498-1_7
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Springer Publisher's website
- Journal:
- ESOP 2016 Journal website
- Volume:
- LNCS-9632
- Pages:
- 149-175
- Host title:
- ESOP 2016: 25th European Symposium on Programming
- Publication date:
- 2016-03-22
- DOI:
- ISSN:
-
0302-9743
- Source identifiers:
-
613748
Item Description
- Pubs id:
-
pubs:613748
- UUID:
-
uuid:893a71c5-52e5-4a98-9b67-4eda3264c0ae
- Local pid:
- pubs:613748
- Deposit date:
- 2016-04-05
Terms of use
- Copyright holder:
- Springer
- Copyright date:
- 2016
- Notes:
- © Springer-Verlag Berlin Heidelberg 2016. ESOP 2016: 25th European Symposium on Programming - held as part of ETAPS 2016: European Joint Conferences on Theory and Practice of Software (Eindhoven, The Netherlands, April 2-8, 2016). The final version is available online from Springer at: [10.1007/978-3-662-49498-1_7]
If you are the owner of this record, you can report an update to it here: Report update to this record