Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/22919
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Francalanza, Adrian | - |
dc.contributor.author | Devries, Edsko | - |
dc.contributor.author | Hennessy, Matthew | - |
dc.date.accessioned | 2017-10-24T07:12:29Z | - |
dc.date.available | 2017-10-24T07:12:29Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Francalanza, A., Devries, E., & Hennessy, M. (2014). Compositional reasoning for explicit resource management in channel-based concurrency. Logical Methods in Computer Science, 10, 1-52. | en_GB |
dc.identifier.uri | https://www.um.edu.mt/library/oar//handle/123456789/22919 | - |
dc.description.abstract | We define a π-calculus variant with a costed semantics where channels are treated as re- sources that must explicitly be allocated before they are used and can be deallocated when no longer required. We use a substructural type system tracking permission transfer to construct coinductive proof techniques for comparing behaviour and resource usage efficiency of concurrent processes. We establish full abstraction results between our coinductive definitions and a contextual behavioural preorder describing a notion of process efficiency wrt. its management of resources. We also justify these definitions and respective proof techniques through numerous examples and a case study comparing two concurrent implementations of an extensible buffer. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | International Federation for Computational Logic | en_GB |
dc.rights | info:eu-repo/semantics/openAccess | en_GB |
dc.subject | Computer multitasking | en_GB |
dc.subject | Bisimulation | en_GB |
dc.title | Compositional reasoning for explicit resource management in channel-based concurrency | en_GB |
dc.type | article | en_GB |
dc.rights.holder | The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder | en_GB |
dc.description.reviewed | peer-reviewed | en_GB |
dc.identifier.doi | 10.2168/LMCS-10(2:15)2014 | - |
dc.publication.title | Logical Methods in Computer Science | en_GB |
Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
journal.pdf | 328.55 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.