Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFrancalanza, Adrian-
dc.contributor.authorGiunti, Marco-
dc.contributor.authorRavara, António-
dc.identifier.citationFrancalanza, A., Giunti, M., & Ravara, A. (2015). Unlocking blocked communicating processes. 11th International Workshop on Automated Specification and Verification of Web Systems, Oslo. 1-10.en_GB
dc.description.abstractWe study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected locks. Our development is cast within a simple setting of a finite linear CCS variant — although it suffices to illustrate the main concepts, we also discuss how our work extends to other language extensions.en_GB
dc.subjectComputer networks -- Monitoringen_GB
dc.subjectComputer software -- Verificationen_GB
dc.subjectComputer multitaskingen_GB
dc.subjectComputer algorithmsen_GB
dc.subjectAspect-oriented programmingen_GB
dc.titleUnlocking blocked communicating processesen_GB
dc.rights.holderThe 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 holderen_GB
dc.bibliographicCitation.conferencename11th International Workshop on Automated Specification and Verification of Web Systemsen_GB
dc.bibliographicCitation.conferenceplaceOslo, Norway, 23/06/2015en_GB
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
  Restricted Access
203.32 kBAdobe PDFView/Open Request a copy

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.