{"title":"Semantic analysis of concurrent ML by abstract model-checking","authors":"Régis Cridlig","doi":"10.1016/S1571-0661(05)80678-4","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper we present a new kind of semantics for Concurrent ML, apopular concurrent extension of the MLfunctional language equipped with message-passing inter-processcommunication along first-class channels. This semanticsis based on infinite domains of higher-dimensional transition systems that are able to model the asynchronous execution of concurrentoperations and is operational in nature.</div><div>By dual abstract interpretation using folding of states and truncation oftransitions <em>finite</em> automata can be automatically derived that representa sound but imprecise semantics of a given program. They are used to compute staticproperties verified by the standardconcurrent execution of the program by means of abstractmodel-checking of modal logic formulae.</div></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"5 ","pages":"Page 17"},"PeriodicalIF":0.0000,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066105806784","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we present a new kind of semantics for Concurrent ML, apopular concurrent extension of the MLfunctional language equipped with message-passing inter-processcommunication along first-class channels. This semanticsis based on infinite domains of higher-dimensional transition systems that are able to model the asynchronous execution of concurrentoperations and is operational in nature.
By dual abstract interpretation using folding of states and truncation oftransitions finite automata can be automatically derived that representa sound but imprecise semantics of a given program. They are used to compute staticproperties verified by the standardconcurrent execution of the program by means of abstractmodel-checking of modal logic formulae.
期刊介绍：
ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
