{"title":"Lang-n-Send Extended: Sending Regular Expressions to Monitors","authors":"M. Cimini","doi":"10.4204/EPTCS.365.5","DOIUrl":null,"url":null,"abstract":"In prior work, Cimini has presented L ANG - N -S END , a π -calculus with language definitions. In this paper, we present an extension of this calculus called L ANG - N -S END +m . First, we revise L ANG - N -S END to work with transition system specifications rather than its language specifications. This revision allows the use of negative premises in deduction rules. Next, we extend L ANG - N -S END with monitors and with the ability of sending and receiving regular expressions, which then can be used in the context of larger regular expressions to monitor the execution of programs. We present a reduction semantics for L ANG - N -S END +m , and we offer examples that demonstrate the scenarios that our calculus captures.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Information and Computation Economies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.365.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In prior work, Cimini has presented L ANG - N -S END , a π -calculus with language definitions. In this paper, we present an extension of this calculus called L ANG - N -S END +m . First, we revise L ANG - N -S END to work with transition system specifications rather than its language specifications. This revision allows the use of negative premises in deduction rules. Next, we extend L ANG - N -S END with monitors and with the ability of sending and receiving regular expressions, which then can be used in the context of larger regular expressions to monitor the execution of programs. We present a reduction semantics for L ANG - N -S END +m , and we offer examples that demonstrate the scenarios that our calculus captures.
在之前的工作中，Cimini提出了L ANG - N - s END，一个具有语言定义的π微积分。在本文中，我们给出了这个微积分的一个推广，称为L ANG - N - s END +m。首先，我们修改了L ANG - N - s END，使其与转换系统规范而不是其语言规范一起工作。这一修订允许在演绎规则中使用否定前提。接下来，我们用监视器和发送和接收正则表达式的能力扩展lang - N - s END，然后可以在更大的正则表达式上下文中使用它来监视程序的执行。我们提出了L ANG - N - s END +m的约简语义，并提供了示例来演示我们的演算捕获的场景。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
