Progress as compositional lock-freedom

Carbone, M., Dardha, O. and Montesi, F. (2014) Progress as compositional lock-freedom. In: COORDINATION 2014, Berlin, Germany, 3-5 Jun 2014, pp. 49-64. (doi:10.1007/978-3-662-43376-8_4)

[img]
Preview
Text
96287.pdf - Accepted Version

474kB

Publisher's URL: http://dx.doi.org/10.1007/978-3-662-43376-8_4

Abstract

A session-based process satisfies the progress property if its sessions never get stuck when it is executed in an adequate context. Previous work studied how to define progress by introducing the notion of catalysers, execution contexts generated from the type of a process. In this paper, we refine such definition to capture a more intuitive notion of context adequacy for checking progress. Interestingly, our new catalysers lead to a novel characterisation of progress in terms of the standard notion of lock-freedom. Guided by this discovery, we also develop a conservative extension of catalysers that does not depend on types, generalising the notion of progress to untyped session-based processes. We combine our results with existing techniques for lock-freedom, obtaining a new methodology for proving progress. Our methodology captures new processes wrt previous progress analysis based on session types.

Item Type:Conference Proceedings
Keywords:session types, pi-calculus, progress, lock-freedom
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Dardha, Dr Ornela
Authors: Carbone, M., Dardha, O., and Montesi, F.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
ISSN:0302-9743
Copyright Holders:Copyright © 2014 IFIP International Federation for Information Processing
Publisher Policy:Reproduced with the permission of the authors

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
612411From Data Types to Session Types - A Basis for Concurrency and Distribution.Simon GayEngineering & Physical Sciences Research Council (EPSRC)EP/K034413/1COM - COMPUTING SCIENCE