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\'onio Ravara (NOVA LINCS, DI-FCT,, Universidade NOVA de Lisboa)
TL;DR
This paper presents a formal method for detecting and refactoring locked processes in concurrent systems, aiming to improve process disentanglement through static analysis and code refactoring techniques.
Contribution
It introduces a formal algorithm for static lock detection and proposes refactoring procedures to disentangle processes, extending the understanding of lock management in concurrent programming.
Findings
Identifies a class of non-lock-free processes
Develops a static lock detection algorithm
Proposes refactoring procedures for lock disentanglement
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 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 \^a although it suffices to illustrate the main concepts, we also discuss how our work extends to other language extensions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.