Unlocking blocked communicating processes

Adrian Francalanza, Marco Giunti, António Ravara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Downloads (Pure)

Abstract

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

Original languageEnglish
Title of host publicationProceedings of the 11th International Workshop on Automated Specification and Verification of Web Systems, WWV 2015
EditorsM.H. ter Beek, A. Lluch Lafuente
Place of PublicationSydney
PublisherOpen Publishing Association
Pages23-32
Number of pages10
DOIs
Publication statusPublished - 2015
Event11th International Workshop on Automated Specification and Verification of Web Systems (WWV 2015) - Oslo, Norway
Duration: 23 Jun 201523 Jun 2015
Conference number: 11th

Publication series

NameElectronic Proceedings in Theoretical Computer Science
PublisherOpen Publishing Association
Volume188
ISSN (Electronic)2075-2180

Conference

Conference11th International Workshop on Automated Specification and Verification of Web Systems (WWV 2015)
Abbreviated titleWWV 2015
CountryNorway
CityOslo
Period23/06/1523/06/15

Keywords

  • Locks (fasteners)
  • Specifications
  • Websites
  • Code re-factoring
  • Communicating process
  • Language extensions
  • Lock-free
  • Refactorings

Cite this