解锁阻塞的通信进程

International Workshop on Automated Specification and Verification of Web Sites Pub Date : 2015-08-17 DOI:10.4204/EPTCS.188.4

Adrian Francalanza, M. Giunti, A. Ravara

{"title":"解锁阻塞的通信进程","authors":"Adrian Francalanza, M. Giunti, A. Ravara","doi":"10.4204/EPTCS.188.4","DOIUrl":null,"url":null,"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.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"334 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Unlocking Blocked Communicating Processes\",\"authors\":\"Adrian Francalanza, M. Giunti, A. Ravara\",\"doi\":\"10.4204/EPTCS.188.4\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":233765,\"journal\":{\"name\":\"International Workshop on Automated Specification and Verification of Web Sites\",\"volume\":\"334 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Automated Specification and Verification of Web Sites\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.188.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Automated Specification and Verification of Web Sites","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.188.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们研究了通过代码重构解除锁定进程纠缠的问题。我们识别并描述了一类非无锁的进程;然后，我们形式化了一种静态检测潜在锁的算法，并提出了分解检测到的锁的重构过程。我们的开发是在有限线性CCS变体\^a的简单设置中进行的，尽管它足以说明主要概念，但我们还讨论了我们的工作如何扩展到其他语言扩展。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Unlocking Blocked Communicating Processes

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Workshop on Automated Specification and Verification of Web Sites

自引率

0.00%

发文量