Unlocking Blocked Communicating Processes
| Autor: | Adrian Francalanza, António Ravara, Marco Giunti |
|---|---|
| Přispěvatelé: | DI - Departamento de Informática, NOVALincs |
| Rok vydání: | 2015 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Computer science Software_PROGRAMMINGTECHNIQUES computer.software_genre lcsh:QA75.5-76.95 Specifications Refactorings Development (topology) Simple (abstract algebra) Locks (fasteners) Language extensions Non-blocking algorithm Class (computer programming) Computer Science - Programming Languages Communicating process Programming language lcsh:Mathematics Websites lcsh:QA1-939 Logic in Computer Science (cs.LO) Code refactoring Lock-free lcsh:Electronic computers. Computer science computer Software Code re-factoring Programming Languages (cs.PL) |
| Zdroj: | Electronic Proceedings in Theoretical Computer Science, Vol 188, Iss Proc. WWV 2015, Pp 23-32 (2015) WWV |
| DOI: | 10.48550/arxiv.1508.03901 |
| Popis: | 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. Comment: In Proceedings WWV 2015, arXiv:1508.03389 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|