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 language | English |
---|---|
Title of host publication | Proceedings of the 11th International Workshop on Automated Specification and Verification of Web Systems, WWV 2015 |
Editors | M.H. ter Beek, A. Lluch Lafuente |
Place of Publication | Sydney |
Publisher | Open Publishing Association |
Pages | 23-32 |
Number of pages | 10 |
DOIs | |
Publication status | Published - 2015 |
Event | 11th International Workshop on Automated Specification and Verification of Web Systems (WWV 2015) - Oslo, Norway Duration: 23 Jun 2015 → 23 Jun 2015 Conference number: 11th |
Publication series
Name | Electronic Proceedings in Theoretical Computer Science |
---|---|
Publisher | Open Publishing Association |
Volume | 188 |
ISSN (Electronic) | 2075-2180 |
Conference
Conference | 11th International Workshop on Automated Specification and Verification of Web Systems (WWV 2015) |
---|---|
Abbreviated title | WWV 2015 |
Country/Territory | Norway |
City | Oslo |
Period | 23/06/15 → 23/06/15 |
Keywords
- Locks (fasteners)
- Specifications
- Websites
- Code re-factoring
- Communicating process
- Language extensions
- Lock-free
- Refactorings