Unlocking Blocked Communicating Processes

Adrian Francalanza
(CS, ICT, University of Malta)
Marco Giunti
(RELEASE, DI, Universidade da Beira Interior & NOVA LINCS, DI-FCT, Universidade NOVA de Lisboa)
António Ravara
(NOVA LINCS, DI-FCT, Universidade NOVA de Lisboa)

We 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.

In Maurice H. ter Beek and Alberto Lluch Lafuente: Proceedings 11th International Workshop on Automated Specification and Verification of Web Systems (WWV 2015), Oslo, Norway, 23rd June 2015, Electronic Proceedings in Theoretical Computer Science 188, pp. 23–32.
Published: 14th August 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.188.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org