首页 > 最新文献

Formal Aspects of Computing最新文献

英文 中文
The concept of class invariant in object-oriented programming 面向对象程序设计中的类不变概念
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-01-24 DOI: 10.1145/3626201
Bertrand Meyer, Alisa Arkadova, Alexander Kogtenkov

Class invariants — consistency constraints preserved by every operation on objects of a given type — are fundamental to building, understanding and verifying object-oriented programs. For verification, however, they raise difficulties, which have not yet received a generally accepted solution. The present work introduces a proof rule meant to address these issues and allow verification tools to benefit from invariants.

It clarifies the notion of invariant and identifies the three associated problems: callbacks, furtive access and reference leak. As an example, the 2016 Ethereum DAO bug, in which $50 million were stolen, resulted from a callback invalidating an invariant.

The discussion starts with a simplified model of computation and an associated proof rule, demonstrating its soundness. It then removes one by one the three simplifying assumptions, each removal raising one of the three issues, and leading to a corresponding adaptation to the proof rule. The final version of the rule can tackle tricky examples, including “challenge problems” listed in the literature.

类不变式--对给定类型的对象进行的每次操作所保留的一致性约束--是构建、理解和验证面向对象程序的基础。然而,对于验证而言,它们却带来了困难,至今尚未得到普遍认可的解决方案。本作品介绍了一种证明规则,旨在解决这些问题,让验证工具从不变式中受益。它澄清了不变式的概念,并确定了三个相关问题:回调、隐秘访问和引用泄漏。例如,2016 年以太坊 DAO 漏洞导致 5000 万美元被盗,就是回调使不变式失效造成的。讨论从一个简化的计算模型和相关的证明规则开始,证明其合理性。然后逐一移除三个简化假设,每移除一个假设都会引起三个问题中的一个,并导致对证明规则进行相应的调整。最终版本的规则可以解决棘手的例子,包括文献中列出的 "挑战问题"。
{"title":"The concept of class invariant in object-oriented programming","authors":"Bertrand Meyer, Alisa Arkadova, Alexander Kogtenkov","doi":"10.1145/3626201","DOIUrl":"https://doi.org/10.1145/3626201","url":null,"abstract":"<p>Class invariants — consistency constraints preserved by every operation on objects of a given type — are fundamental to building, understanding and verifying object-oriented programs. For verification, however, they raise difficulties, which have not yet received a generally accepted solution. The present work introduces a proof rule meant to address these issues and allow verification tools to benefit from invariants. </p><p>It clarifies the notion of invariant and identifies the three associated problems: callbacks, furtive access and reference leak. As an example, the 2016 Ethereum DAO bug, in which $50 million were stolen, resulted from a callback invalidating an invariant. </p><p>The discussion starts with a simplified model of computation and an associated proof rule, demonstrating its soundness. It then removes one by one the three simplifying assumptions, each removal raising one of the three issues, and leading to a corresponding adaptation to the proof rule. The final version of the rule can tackle tricky examples, including “challenge problems” listed in the literature.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"17 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139555146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Clinical Picture of Otosclerosis and the Surgery Effect on Bone Conduction Thresholds on Audiograms. 耳硬化的临床表现及手术对听力图骨传导阈值的影响。
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-12-01 Epub Date: 2023-07-12 DOI: 10.1007/s12070-023-04034-3
Louei Darjazini Nahas, Mouhammad Trabulsi, Rama Alsawah, Ahmad Hamsho, Mohammad Sadek Al-Masalmeh, Abdullah Omar

Our study aims to illustrate the clinical picture of otosclerosis in patients and the effect of surgery on the bone conduction thresholds compared to audiometry tests before surgery. A retrospective study included 36 patients that fit the inclusion criteria based on the patient's files and Pure Tone Audiometry of the patients before and after surgery. The questionnaire used is attached at the end of the study. According to Our sample, 77.8% were females, and 22.2% were males. The youngest was 17 years old, the eldest was 61, and the mean age was 38.2 years old. Hearing loss was the most common symptom in 100% of patients, while tinnitus was found in 66.7% and vertigo in 11%. The Injury was bilateral in 72% of the cases. Before surgery, the mean air conduction threshold (ACT) was 54.7 dB, the mean value of the air-bone gap (ABG) was 38.3 dB, and the mean bone conduction threshold (BCT) was 16.1 dB. Meanwhile, after the surgery, the mean BCT was 18.2 dB. Otosclerosis is more common in middle-aged females. Most cases are bilateral. Two-thirds of the cases of hearing loss were associated with tinnitus, while only a few had vertigo. A slight increase was noticed in BCTs after surgeries, especially at 4000 Hz. Stapedectomy caused a noticeable decrease in the values of BCTs on the frequency 4000 Hz. Stapedotomy improved the BCTs after surgery by about 5.3 dB at 4000 Hz.

我们的研究旨在说明耳硬化患者的临床情况以及手术对骨传导阈值的影响,并与术前听力学测试进行比较。回顾性研究纳入36例符合纳入标准的患者,根据患者的档案和术前术后的纯音听力测定。所使用的调查问卷附在研究的最后。根据我们的样本,女性占77.8%,男性占22.2%。年龄最小17岁,最大61岁,平均年龄38.2岁。100%的患者以听力丧失为最常见的症状,66.7%的患者出现耳鸣,11%的患者出现眩晕。72%的病例为双侧损伤。术前平均空气传导阈值(ACT)为54.7 dB,平均气骨间隙(ABG)为38.3 dB,平均骨传导阈值(BCT)为16.1 dB。术后平均BCT为18.2 dB。耳硬化在中年女性中更为常见。大多数病例是双侧的。三分之二的听力损失病例与耳鸣有关,而只有少数人有眩晕。手术后bct略有增加,特别是在4000 Hz时。镫骨切除术导致4000 Hz频率上的bct值明显下降。镫骨切开术使术后bct在4000 Hz下提高约5.3 dB。
{"title":"The Clinical Picture of Otosclerosis and the Surgery Effect on Bone Conduction Thresholds on Audiograms.","authors":"Louei Darjazini Nahas, Mouhammad Trabulsi, Rama Alsawah, Ahmad Hamsho, Mohammad Sadek Al-Masalmeh, Abdullah Omar","doi":"10.1007/s12070-023-04034-3","DOIUrl":"10.1007/s12070-023-04034-3","url":null,"abstract":"<p><p>Our study aims to illustrate the clinical picture of otosclerosis in patients and the effect of surgery on the bone conduction thresholds compared to audiometry tests before surgery. A retrospective study included 36 patients that fit the inclusion criteria based on the patient's files and Pure Tone Audiometry of the patients before and after surgery. The questionnaire used is attached at the end of the study. According to Our sample, 77.8% were females, and 22.2% were males. The youngest was 17 years old, the eldest was 61, and the mean age was 38.2 years old. Hearing loss was the most common symptom in 100% of patients, while tinnitus was found in 66.7% and vertigo in 11%. The Injury was bilateral in 72% of the cases. Before surgery, the mean air conduction threshold (ACT) was 54.7 dB, the mean value of the air-bone gap (ABG) was 38.3 dB, and the mean bone conduction threshold (BCT) was 16.1 dB. Meanwhile, after the surgery, the mean BCT was 18.2 dB. Otosclerosis is more common in middle-aged females. Most cases are bilateral. Two-thirds of the cases of hearing loss were associated with tinnitus, while only a few had vertigo. A slight increase was noticed in BCTs after surgeries, especially at 4000 Hz. Stapedectomy caused a noticeable decrease in the values of BCTs on the frequency 4000 Hz. Stapedotomy improved the BCTs after surgery by about 5.3 dB at 4000 Hz.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"25 1","pages":"3628-3635"},"PeriodicalIF":1.4,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10645766/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74000367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
iStar Goal Model to Z Formal Model Translation and Model Checking of CBTC Moving Block Interlocking System CBTC移动块联锁系统的iStar目标模型到Z形式模型的转换与模型检验
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-11-27 DOI: 10.1145/3633065
Lokanna Kadakolmath, Umesh D. Ramu

The reliability and safety of complex software systems are provided by extracting safety requirements from regulations and operational environments and later specifying these requirements precisely. At the early stage, these extracted safety requirements are informal. Typically, they cope with non-functional requirements. Analysis of early requirements using traditional methods is inadequate because these methods only focus on the WHAT dimension of requirements engineering but do not address the WHY dimension of requirements engineering. In this article, we are using a goal-oriented modelling method called iStar to confront these issues. To ensure that the software system developed fulfils the requirements specified in the early-phase, it is necessary to integrate early-phase requirements with late-phase requirements. To accomplish this task, in this article, we use Z formal method to integrate early-phase requirements with late-phase requirements. This integration synergistically resolves the above issues. As a case study, we use the CBTC moving block interlocking system to illustrate the synergy of the iStar and Z combination on complex software systems. Finally, we verify the developed formal model against LTL safety properties using the ProZ model checking tool.

复杂软件系统的可靠性和安全性是通过从法规和操作环境中提取安全需求,然后精确地指定这些需求来提供的。在早期阶段,这些提取的安全需求是非正式的。通常,它们处理非功能性需求。使用传统方法对早期需求进行分析是不够的,因为这些方法只关注需求工程的WHAT维度,而不关注需求工程的WHY维度。在本文中,我们将使用一种名为iStar的面向目标的建模方法来解决这些问题。为了确保开发的软件系统满足早期阶段指定的需求,有必要将早期阶段的需求与后期阶段的需求集成在一起。为了完成这项任务,在本文中,我们使用Z形式化方法来集成早期阶段的需求和后期阶段的需求。这一整合协同解决了上述问题。作为一个案例研究,我们使用CBTC移动块联锁系统来说明iStar和Z组合在复杂软件系统上的协同作用。最后,我们使用ProZ模型检查工具根据LTL安全属性验证所开发的形式化模型。
{"title":"iStar Goal Model to Z Formal Model Translation and Model Checking of CBTC Moving Block Interlocking System","authors":"Lokanna Kadakolmath, Umesh D. Ramu","doi":"10.1145/3633065","DOIUrl":"https://doi.org/10.1145/3633065","url":null,"abstract":"<p>The reliability and safety of complex software systems are provided by extracting safety requirements from regulations and operational environments and later specifying these requirements precisely. At the early stage, these extracted safety requirements are informal. Typically, they cope with non-functional requirements. Analysis of early requirements using traditional methods is inadequate because these methods only focus on the WHAT dimension of requirements engineering but do not address the WHY dimension of requirements engineering. In this article, we are using a goal-oriented modelling method called iStar to confront these issues. To ensure that the software system developed fulfils the requirements specified in the early-phase, it is necessary to integrate early-phase requirements with late-phase requirements. To accomplish this task, in this article, we use Z formal method to integrate early-phase requirements with late-phase requirements. This integration synergistically resolves the above issues. As a case study, we use the CBTC moving block interlocking system to illustrate the synergy of the iStar and Z combination on complex software systems. Finally, we verify the developed formal model against LTL safety properties using the ProZ model checking tool.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"44 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
State machines for large scale computer software and systems 用于大型计算机软件和系统的状态机
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-11-22 DOI: 10.1145/3633786
Victor Yodaiken

The behavior and architecture of large scale discrete state systems found in computer software and hardware can be specified and analyzed using a particular class of primitive recursive functions. This paper begins with an illustration of the utility of the method via a number of small examples and then via longer specification and verification of the ”Paxos” distributed consensus algorithm[26]. The “sequence maps” are then shown to provide an alternative representation of deterministic state machines and algebraic products of state machines.

Distributed and composite systems, parallel and concurrent computation, and real-time behavior can all be specified naturally with these methods - which require neither extensions to the classical state machine model nor any axiomatic methods or other techniques from formal logic or other foundational methods. Compared to state diagrams or tables or the standard set-tuple-transition-maps, sequence maps are more concise and better suited to describing the behavior and compositional architecture of computer systems. Staying strictly within the boundaries of classical deterministic state machines anchors the methods to the algebraic structures of automata and makes the specifications faithful to engineering practice.

在计算机软件和硬件中发现的大规模离散状态系统的行为和结构可以使用一类特定的原始递归函数来指定和分析。本文首先通过一些小的例子来说明该方法的实用性,然后通过对“Paxos”分布式共识算法的更长的规范和验证[26]。然后显示“序列映射”,以提供确定性状态机和状态机的代数积的替代表示。分布式和复合系统、并行和并发计算以及实时行为都可以用这些方法自然地指定——它们既不需要对经典状态机模型的扩展,也不需要任何公理方法或形式逻辑或其他基础方法中的其他技术。与状态图或表或标准集元转换映射相比,序列映射更简洁,更适合于描述计算机系统的行为和组合体系结构。严格遵守经典确定性状态机的边界,将方法锚定在自动机的代数结构上,使规范忠实于工程实践。
{"title":"State machines for large scale computer software and systems","authors":"Victor Yodaiken","doi":"10.1145/3633786","DOIUrl":"https://doi.org/10.1145/3633786","url":null,"abstract":"<p>The behavior and architecture of large scale discrete state systems found in computer software and hardware can be specified and analyzed using a particular class of primitive recursive functions. This paper begins with an illustration of the utility of the method via a number of small examples and then via longer specification and verification of the ”Paxos” distributed consensus algorithm[26]. The “sequence maps” are then shown to provide an alternative representation of deterministic state machines and algebraic products of state machines. </p><p>Distributed and composite systems, parallel and concurrent computation, and real-time behavior can all be specified naturally with these methods - which require neither extensions to the classical state machine model nor any axiomatic methods or other techniques from formal logic or other foundational methods. Compared to state diagrams or tables or the standard set-tuple-transition-maps, sequence maps are more concise and better suited to describing the behavior and compositional architecture of computer systems. Staying strictly within the boundaries of classical deterministic state machines anchors the methods to the algebraic structures of automata and makes the specifications faithful to engineering practice.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"96 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Introduction to the Special Collection from FASE 2021 FASE 2021特别收藏简介
4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-09-30 DOI: 10.1145/3626206
Esther Guerra, Mariëlle Stoelinga
As the microblogging service Twitter becomes an increasingly popular tool for politicians and general users to comment on and discuss politics, researchers increasingly turn to the relationship between tweets mentioning parties or candidates and their ...
随着微博服务Twitter成为政治家和普通用户评论和讨论政治的越来越受欢迎的工具,研究人员越来越多地转向推文提到政党或候选人与其……
{"title":"Introduction to the Special Collection from FASE 2021","authors":"Esther Guerra, Mariëlle Stoelinga","doi":"10.1145/3626206","DOIUrl":"https://doi.org/10.1145/3626206","url":null,"abstract":"As the microblogging service Twitter becomes an increasingly popular tool for politicians and general users to comment on and discuss politics, researchers increasingly turn to the relationship between tweets mentioning parties or candidates and their ...","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135031707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS 根发散-保持分支双相似是一种有保护的CCS的同余
4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-09-29 DOI: 10.1145/3625564
Quan Sun, David N. Jansen, Xinxin Liu, Wei Zhang
Branching bisimilarity is a well-known equivalence relation for labelled transition systems. Based on this equivalence relation, with an additional simple rootedness condition, a congruence relation for CCS processes can be obtained. However, neither branching bisimilarity nor the corresponding congruence relation preserves divergence, and it is still a question whether, based on a divergence-preserving variant of branching bisimilarity, a divergence-preserving congruence relation for CCS processes can be obtained by introducing the same simple rootedness condition. In this paper we present a partial solution by showing that rooted divergence-preserving branching bisimilarity is preserved under the usual CCS operators including prefixing, summation, parallel composition, relabelling, restriction, and (weakly) guarded recursion.
分支双相似性是已知的标记跃迁系统的等价关系。在此等价关系的基础上,加上一个简单的根条件,可以得到CCS过程的同余关系。然而,分支双相似度和相应的同余关系都不保持散度,并且能否基于分支双相似度的一个保持散度的变体,通过引入相同的简单根条件得到CCS过程的保持散度的同余关系仍然是一个问题。本文给出了在前缀、求和、并行组合、重标记、限制和(弱)保护递归等常用的CCS算子下,保持根发散的分支双相似性的部分解。
{"title":"Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS","authors":"Quan Sun, David N. Jansen, Xinxin Liu, Wei Zhang","doi":"10.1145/3625564","DOIUrl":"https://doi.org/10.1145/3625564","url":null,"abstract":"Branching bisimilarity is a well-known equivalence relation for labelled transition systems. Based on this equivalence relation, with an additional simple rootedness condition, a congruence relation for CCS processes can be obtained. However, neither branching bisimilarity nor the corresponding congruence relation preserves divergence, and it is still a question whether, based on a divergence-preserving variant of branching bisimilarity, a divergence-preserving congruence relation for CCS processes can be obtained by introducing the same simple rootedness condition. In this paper we present a partial solution by showing that rooted divergence-preserving branching bisimilarity is preserved under the usual CCS operators including prefixing, summation, parallel composition, relabelling, restriction, and (weakly) guarded recursion.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135246737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RoboWorld: verification of robotic systems with environment in the loop 机器人世界:环境在循环中的机器人系统的验证
4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-09-27 DOI: 10.1145/3625563
James Baxter, Gustavo Carvalho, Ana Cavalcanti, Francisco Rodrigues Júnior
A robot affects and is affected by its environment, so that typically its behaviour depends on properties of that environment. For verification, we need to formalise those properties. Modelling the environment is very challenging, if not impossible, but we can capture assumptions. Here, we present RoboWorld, a domain-specific controlled natural language with a process algebraic semantics that can be used to define (a) operational requirements, and (b) environment interactions of a robot. RoboWorld is part of the RoboStar framework for verification of robotic systems. In this paper, we define RoboWorld’s syntax and hybrid semantics, and illustrate its use for capturing operational requirements, for automatic test generation, and for proof. We also present a tool that supports the writing of RoboWorld documents. Since RoboWorld is a controlled natural language, it complements the other RoboStar notations in being accessible to roboticists, while at the same time benefitting from a formal semantics to support rigorous verification (via testing and proof).
机器人会影响环境,也会受到环境的影响,所以它的行为通常取决于环境的特性。为了验证,我们需要形式化这些属性。对环境进行建模是非常具有挑战性的,如果不是不可能的话,但我们可以捕捉假设。在这里,我们提出了RoboWorld,一种具有过程代数语义的特定领域受控自然语言,可用于定义(a)操作需求,以及(b)机器人的环境交互。RoboWorld是RoboStar框架的一部分,用于验证机器人系统。在本文中,我们定义了RoboWorld的语法和混合语义,并说明了它在捕获操作需求、自动测试生成和证明方面的使用。我们还提供了一个支持编写RoboWorld文档的工具。由于RoboWorld是一种受控的自然语言,它补充了机器人专家可以访问的其他RoboStar符号,同时受益于形式语义来支持严格的验证(通过测试和证明)。
{"title":"RoboWorld: verification of robotic systems with environment in the loop","authors":"James Baxter, Gustavo Carvalho, Ana Cavalcanti, Francisco Rodrigues Júnior","doi":"10.1145/3625563","DOIUrl":"https://doi.org/10.1145/3625563","url":null,"abstract":"A robot affects and is affected by its environment, so that typically its behaviour depends on properties of that environment. For verification, we need to formalise those properties. Modelling the environment is very challenging, if not impossible, but we can capture assumptions. Here, we present RoboWorld, a domain-specific controlled natural language with a process algebraic semantics that can be used to define (a) operational requirements, and (b) environment interactions of a robot. RoboWorld is part of the RoboStar framework for verification of robotic systems. In this paper, we define RoboWorld’s syntax and hybrid semantics, and illustrate its use for capturing operational requirements, for automatic test generation, and for proof. We also present a tool that supports the writing of RoboWorld documents. Since RoboWorld is a controlled natural language, it complements the other RoboStar notations in being accessible to roboticists, while at the same time benefitting from a formal semantics to support rigorous verification (via testing and proof).","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135537395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Introduction to the Special Collection from iFM 2022 iFM 2022特别收藏简介
4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-09-26 DOI: 10.1145/3622995
Rosemary Monahan, Maurice H. ter Beek
This special collection arose from the 17th International Conference on integrated Formal Methods (iFM) held in beautiful Lugano, Switzerland, hosted by the Software Institute of USI Università della Svizzera italiana.
这个特别的集合来自于在瑞士美丽的卢加诺举行的第17届集成形式方法国际会议(iFM),该会议由USI university della Svizzera italiana软件研究所主办。
{"title":"Introduction to the Special Collection from iFM 2022","authors":"Rosemary Monahan, Maurice H. ter Beek","doi":"10.1145/3622995","DOIUrl":"https://doi.org/10.1145/3622995","url":null,"abstract":"This special collection arose from the 17th International Conference on integrated Formal Methods (iFM) held in beautiful Lugano, Switzerland, hosted by the Software Institute of USI Università della Svizzera italiana.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134957824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Compositional Analysis of Probabilistic Timed Graph Transformation Systems 概率定时图变换系统的组成分析
4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-09-13 DOI: 10.1145/3572782
Maria Maximova, Sven Schneider, Holger Giese
The analysis of behavioral models is of high importance for cyber-physical systems, as the systems often encompass complex behavior based on, e.g., concurrent components with mutual exclusion or probabilistic failures on demand. The rule-based formalism of Probabilistic Timed Graph Transformation Systems (PTGTSs) is a suitable choice when the models representing states of the system can be understood as graphs and timed and probabilistic behavior is important. However, model checking PTGTSs is limited to systems with rather small state spaces. We present an approach for the analysis of large-scale systems modeled as PTGTSs by systematically decomposing their state spaces into manageable fragments. To obtain qualitative and quantitative analysis results for a large-scale system, we verify that results obtained for its fragments serve as overapproximations for the corresponding results of the large-scale system. Hence, our approach allows for the detection of violations of qualitative and quantitative safety properties for the large-scale system under analysis. We consider a running example in which shuttles drive on tracks of a large-scale topology and autonomously coordinate their local behavior with other shuttles nearby. For this running example, we verify that (a) shuttles can always make the expected forward progress using several properties, (b) shuttles never collide, and (c) shuttles are unlikely to execute emergency brakes in two scenarios. In our evaluation, we apply an implementation of our approach in the tool AutoGraph to our running example.
行为模型的分析对于网络物理系统非常重要,因为系统通常包含复杂的行为,例如,具有互斥的并发组件或按需概率故障。当表示系统状态的模型可以被理解为图形,并且时间和概率行为很重要时,基于规则的概率定时图变换系统(PTGTSs)是一种合适的选择。然而,模型检查PTGTSs仅限于具有较小状态空间的系统。我们提出了一种方法,通过系统地将它们的状态空间分解为可管理的片段,来分析作为PTGTSs建模的大型系统。为了获得大规模系统的定性和定量分析结果,我们验证了对其片段获得的结果可以作为大规模系统相应结果的过近似值。因此,我们的方法允许检测在分析的大规模系统的定性和定量安全属性的违反。我们考虑了一个运行的例子,其中班车在大规模拓扑的轨道上行驶,并自主地与附近的其他班车协调其局部行为。对于这个运行的例子,我们验证了(a)在两种情况下,穿梭车总是可以使用几个属性来实现预期的前进,(b)穿梭车永远不会碰撞,(c)穿梭车不太可能执行紧急刹车。在我们的评估中,我们将工具亲笔中方法的实现应用到我们正在运行的示例中。
{"title":"Compositional Analysis of Probabilistic Timed Graph Transformation Systems","authors":"Maria Maximova, Sven Schneider, Holger Giese","doi":"10.1145/3572782","DOIUrl":"https://doi.org/10.1145/3572782","url":null,"abstract":"The analysis of behavioral models is of high importance for cyber-physical systems, as the systems often encompass complex behavior based on, e.g., concurrent components with mutual exclusion or probabilistic failures on demand. The rule-based formalism of Probabilistic Timed Graph Transformation Systems (PTGTSs) is a suitable choice when the models representing states of the system can be understood as graphs and timed and probabilistic behavior is important. However, model checking PTGTSs is limited to systems with rather small state spaces. We present an approach for the analysis of large-scale systems modeled as PTGTSs by systematically decomposing their state spaces into manageable fragments. To obtain qualitative and quantitative analysis results for a large-scale system, we verify that results obtained for its fragments serve as overapproximations for the corresponding results of the large-scale system. Hence, our approach allows for the detection of violations of qualitative and quantitative safety properties for the large-scale system under analysis. We consider a running example in which shuttles drive on tracks of a large-scale topology and autonomously coordinate their local behavior with other shuttles nearby. For this running example, we verify that (a) shuttles can always make the expected forward progress using several properties, (b) shuttles never collide, and (c) shuttles are unlikely to execute emergency brakes in two scenarios. In our evaluation, we apply an implementation of our approach in the tool AutoGraph to our running example.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134989485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Refinement-Based Specification and Analysis of Multi-Core ARINC 653 Using Event-B 基于Event-B的多核arinc653细化规范与分析
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-08-21 DOI: 10.1145/3617183
Zhang Feng, Leping Zhang, Yongwang Zhao, Liu Yang, Sun Jun
ARINC 653 as the de facto standard of partitioning operating systems has been applied in many safety-critical domains. The multi-core version of ARINC 653, ARINC 653 Part1-4 (Version 4), provides support for services to be utilized with a module that contains multiple processor cores. Formal specification and analysis of this standard document could provide a rigorous specification and uncover concealed errors in the textual description of service requirements. This paper proposes a specification method for concurrency on a multi-core platform using Event-B and a refinement structure for the complicated ARINC 653 Part1-4, provides a comprehensive, stepwise refinement-based Event-B specification with seven refinement layers, and then performs formal proof and analysis in RODIN. We verify that the errors discovered in the single-core version standard (ARINC 653 Part1-3) also exist in the ARINC 653 Part1-4 during the formal specification and analysis.
ARINC 653作为分区操作系统的实际标准,已在许多安全关键领域得到应用。ARINC 653的多核版本ARINC 653 Part1-4(版本4)为包含多个处理器核心的模块所使用的服务提供了支持。该标准文档的正式规范和分析可以提供严格的规范,并发现服务需求的文本描述中隐藏的错误。本文提出了一种基于Event-B的多核平台并发性规范方法,并针对复杂的ARINC 653 Part1-4提出了一种细化结构,给出了一个包含7个细化层的基于逐步细化的Event-B规范,并在RODIN中进行了形式化证明和分析。在正式规范和分析过程中,我们验证了单核版本标准(ARINC 653 Part1-3)中发现的错误也存在于ARINC 653 Part1-4中。
{"title":"Refinement-Based Specification and Analysis of Multi-Core ARINC 653 Using Event-B","authors":"Zhang Feng, Leping Zhang, Yongwang Zhao, Liu Yang, Sun Jun","doi":"10.1145/3617183","DOIUrl":"https://doi.org/10.1145/3617183","url":null,"abstract":"ARINC 653 as the de facto standard of partitioning operating systems has been applied in many safety-critical domains. The multi-core version of ARINC 653, ARINC 653 Part1-4 (Version 4), provides support for services to be utilized with a module that contains multiple processor cores. Formal specification and analysis of this standard document could provide a rigorous specification and uncover concealed errors in the textual description of service requirements. This paper proposes a specification method for concurrency on a multi-core platform using Event-B and a refinement structure for the complicated ARINC 653 Part1-4, provides a comprehensive, stepwise refinement-based Event-B specification with seven refinement layers, and then performs formal proof and analysis in RODIN. We verify that the errors discovered in the single-core version standard (ARINC 653 Part1-3) also exist in the ARINC 653 Part1-4 during the formal specification and analysis.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":" ","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42169495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Formal Aspects of Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1