首页 > 最新文献

Formal Aspects of Computing最新文献

英文 中文
Formal Specification and Verification of JDK’s Identity Hash Map Implementation JDK身份哈希图实现的形式化规范与验证
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-05-18 DOI: 10.1145/3594729
M. D. Boer, Stijn de Gouw, Jonas Klamroth, Christian Jung, Mattias Ulbrich, A. Weigl
Hash maps are a common and important data structure in efficient algorithm implementations. Despite their wide-spread use, real-world implementations are not regularly verified. In this paper, we present the first case study of the IdentityHashMap class in the Java JDK. We specified its behavior using the Java Modeling Language (JML) and proved correctness for the main insertion and lookup methods with KeY, a semi-interactive theorem prover for JML-annotated Java programs. Furthermore, we report how unit testing and bounded model checking can be leveraged to find a suitable specification more quickly. We also investigated where the bottlenecks in the verification of hash maps lie for KeY by comparing required automatic proof effort for different hash map implementations and draw conclusions for the choice of hash map implementations regarding their verifiability.
在高效算法实现中,哈希映射是一种常见且重要的数据结构。尽管它们被广泛使用,但现实世界的实现并没有得到定期验证。在本文中,我们介绍了Java JDK中IdentityHashMap类的第一个案例研究。我们使用Java建模语言(JML)指定了它的行为,并使用KeY证明了主要插入和查找方法的正确性,KeY是用于JML注释的Java程序的半交互式定理证明器。此外,我们还报告了如何利用单元测试和有界模型检查来更快地找到合适的规范。我们还通过比较不同哈希图实现所需的自动证明工作量,研究了KeY哈希图验证中的瓶颈所在,并就哈希图实现的可验证性得出了选择哈希图的结论。
{"title":"Formal Specification and Verification of JDK’s Identity Hash Map Implementation","authors":"M. D. Boer, Stijn de Gouw, Jonas Klamroth, Christian Jung, Mattias Ulbrich, A. Weigl","doi":"10.1145/3594729","DOIUrl":"https://doi.org/10.1145/3594729","url":null,"abstract":"Hash maps are a common and important data structure in efficient algorithm implementations. Despite their wide-spread use, real-world implementations are not regularly verified. In this paper, we present the first case study of the IdentityHashMap class in the Java JDK. We specified its behavior using the Java Modeling Language (JML) and proved correctness for the main insertion and lookup methods with KeY, a semi-interactive theorem prover for JML-annotated Java programs. Furthermore, we report how unit testing and bounded model checking can be leveraged to find a suitable specification more quickly. We also investigated where the bottlenecks in the verification of hash maps lie for KeY by comparing required automatic proof effort for different hash map implementations and draw conclusions for the choice of hash map implementations regarding their verifiability.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":" ","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47826241","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}
引用次数: 1
Formal Specification and Verification of JDK’s Identity Hash Map Implementation JDK身份哈希映射实现的形式化规范与验证
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-05-18 DOI: https://dl.acm.org/doi/10.1145/3594729
Martin de Boer, Stijn de Gouw, Jonas Klamroth, Christian Jung, Mattias Ulbrich, Alexander Weigl

Hash maps are a common and important data structure in efficient algorithm implementations. Despite their wide-spread use, real-world implementations are not regularly verified.

In this paper, we present the first case study of the IdentityHashMap class in the Java JDK. We specified its behavior using the Java Modeling Language (JML) and proved correctness for the main insertion and lookup methods with KeY, a semi-interactive theorem prover for JML-annotated Java programs. Furthermore, we report how unit testing and bounded model checking can be leveraged to find a suitable specification more quickly. We also investigated where the bottlenecks in the verification of hash maps lie for KeY by comparing required automatic proof effort for different hash map implementations and draw conclusions for the choice of hash map implementations regarding their verifiability.

在高效算法实现中,哈希映射是一种常见且重要的数据结构。尽管它们被广泛使用,但现实世界的实现并没有得到定期验证。在本文中,我们介绍了Java JDK中IdentityHashMap类的第一个案例研究。我们使用Java建模语言(JML)指定了它的行为,并使用KeY证明了主要插入和查找方法的正确性,KeY是用于JML注释的Java程序的半交互式定理证明器。此外,我们还报告了如何利用单元测试和有界模型检查来更快地找到合适的规范。我们还通过比较不同哈希图实现所需的自动证明工作量,研究了KeY哈希图验证中的瓶颈所在,并就哈希图实现的可验证性得出了选择哈希图的结论。
{"title":"Formal Specification and Verification of JDK’s Identity Hash Map Implementation","authors":"Martin de Boer, Stijn de Gouw, Jonas Klamroth, Christian Jung, Mattias Ulbrich, Alexander Weigl","doi":"https://dl.acm.org/doi/10.1145/3594729","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3594729","url":null,"abstract":"<p>Hash maps are a common and important data structure in efficient algorithm implementations. Despite their wide-spread use, real-world implementations are not regularly verified. </p><p>In this paper, we present the first case study of the <monospace>IdentityHashMap</monospace> class in the Java JDK. We specified its behavior using the Java Modeling Language (JML) and proved correctness for the main insertion and lookup methods with KeY, a semi-interactive theorem prover for JML-annotated Java programs. Furthermore, we report how unit testing and bounded model checking can be leveraged to find a suitable specification more quickly. We also investigated where the bottlenecks in the verification of hash maps lie for KeY by comparing required automatic proof effort for different hash map implementations and draw conclusions for the choice of hash map implementations regarding their verifiability.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"23 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517751","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
Bit-Vector Typestate Analysis 位矢量类型状态分析
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-05-17 DOI: 10.1145/3595299
Alen Arslanagic, Pavle Subotic, J. A. Pérez
Static analyses based on typestates are important in certifying correctness of code contracts. Such analyses rely on Deterministic Finite Automata (DFAs) to specify properties of an object. We target the analysis of contracts in low-latency environments, where many useful contracts are impractical to codify as DFAs and/or the size of their associated DFAs leads to sub-par performance. To address this bottleneck, we present a lightweight compositional typestate analyzer, based on an expressive specification language that can succinctly specify code contracts. By implementing it in the static analyzer Infer, we demonstrate considerable performance and usability benefits when compared to existing techniques. A central insight is to rely on a sub-class of DFAs whose analysis uses efficient bit-vector operations.
基于类型状态的静态分析对于证明代码契约的正确性非常重要。这种分析依赖于确定性有限自动机(DFA)来指定对象的属性。我们针对低延迟环境中的合同进行分析,在低延迟环境下,许多有用的合同无法编码,因为DFA和/或其相关DFA的大小会导致低于标准的性能。为了解决这个瓶颈,我们提出了一个轻量级的组合类型状态分析器,它基于一种表达性规范语言,可以简洁地指定代码契约。通过在静态分析器Infer中实现它,与现有技术相比,我们展示了相当大的性能和可用性优势。一个核心见解是依赖于DFA的一个子类,其分析使用有效的位向量运算。
{"title":"Bit-Vector Typestate Analysis","authors":"Alen Arslanagic, Pavle Subotic, J. A. Pérez","doi":"10.1145/3595299","DOIUrl":"https://doi.org/10.1145/3595299","url":null,"abstract":"Static analyses based on typestates are important in certifying correctness of code contracts. Such analyses rely on Deterministic Finite Automata (DFAs) to specify properties of an object. We target the analysis of contracts in low-latency environments, where many useful contracts are impractical to codify as DFAs and/or the size of their associated DFAs leads to sub-par performance. To address this bottleneck, we present a lightweight compositional typestate analyzer, based on an expressive specification language that can succinctly specify code contracts. By implementing it in the static analyzer Infer, we demonstrate considerable performance and usability benefits when compared to existing techniques. A central insight is to rely on a sub-class of DFAs whose analysis uses efficient bit-vector operations.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"35 1","pages":"1 - 36"},"PeriodicalIF":1.0,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41966864","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
Bit-Vector Typestate Analysis 位矢量类型状态分析
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-05-17 DOI: https://dl.acm.org/doi/10.1145/3595299
Alen Arslanagić, Pavle Subotić, Jorge A. Pérez

Static analyses based on typestates are important in certifying correctness of code contracts. Such analyses rely on Deterministic Finite Automata (DFAs) to specify properties of an object. We target the analysis of contracts in low-latency environments, where many useful contracts are impractical to codify as DFAs and/or the size of their associated DFAs leads to sub-par performance. To address this bottleneck, we present a lightweight compositional typestate analyzer, based on an expressive specification language that can succinctly specify code contracts. By implementing it in the static analyzer Infer, we demonstrate considerable performance and usability benefits when compared to existing techniques. A central insight is to rely on a sub-class of DFAs whose analysis uses efficient bit-vector operations.

基于类型状态的静态分析对于验证代码契约的正确性非常重要。这种分析依赖于确定性有限自动机(dfa)来指定对象的属性。我们的目标是在低延迟环境中分析合约,在这种环境中,许多有用的合约无法被编码为dfa,并且/或者它们相关的dfa的大小导致性能低于标准。为了解决这个瓶颈,我们提出了一个轻量级的组合类型状态分析器,它基于一种表达性规范语言,可以简洁地指定代码契约。通过在静态分析器Infer中实现它,与现有技术相比,我们展示了相当大的性能和可用性优势。一个核心的见解是依赖于dfa的子类,其分析使用有效的位向量操作。
{"title":"Bit-Vector Typestate Analysis","authors":"Alen Arslanagić, Pavle Subotić, Jorge A. Pérez","doi":"https://dl.acm.org/doi/10.1145/3595299","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3595299","url":null,"abstract":"<p>Static analyses based on <i>typestates</i> are important in certifying correctness of code contracts. Such analyses rely on Deterministic Finite Automata (DFAs) to specify properties of an object. We target the analysis of contracts in low-latency environments, where many useful contracts are impractical to codify as DFAs and/or the size of their associated DFAs leads to sub-par performance. To address this bottleneck, we present a <i>lightweight</i> compositional typestate analyzer, based on an expressive specification language that can succinctly specify code contracts. By implementing it in the static analyzer <span>Infer</span>, we demonstrate considerable performance and usability benefits when compared to existing techniques. A central insight is to rely on a sub-class of DFAs whose analysis uses efficient bit-vector operations.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"56 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517739","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
Review on Functional Algorithms, Verified! 函数算法综述,已验证!
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-05-05 DOI: 10.1145/3594639
A. Charguéraud
The book Functional Algorithms, Verified! provides a presentation of classic functional data structures and algorithms with a fairly original perspective: that of accompanying every data structure with formal specifications. The specifications cover not only functional correctness but also time complexity bounds. The book has been used as course notes by Tobias Nipkow and colleagues over several years. It benefits from feedback from the classroom, invaluable for streamlining the presentation of the material. I would say that it is well suited for master’s students. It could also be accessible for students in the final year of a bachelor’s degree and highly valuable to Ph.D. students who wish to formalize or use formalized data structures. Interestingly, although its contents are formally verified, this book is not about mechanized proofs. It is meant to be accessible to readers with no background in proof assistants. What matters in this book is the mechanized specifications , which are provided for every data structure. Throughout the book, the reader is taught how to write formal specifications for sets, maps, sequences, functional arrays, and priority queues. These formal interfaces are the cornerstones of program verification. The proofs are presented in English, each time with formal statements and an explanation of what kind of induction principle is exploited. The proof details, which can be found in the accompanying Isabelle/HOL proof scripts, are very useful for readers interested in conducting formal proofs on functional data structures. For other readers, following the proof scripts is completely optional. The book
书函数算法,验证!以相当新颖的视角展示经典的功能数据结构和算法:为每个数据结构提供正式规范。这些规范不仅涵盖了功能正确性,还涵盖了时间复杂度界限。多年来,这本书一直被Tobias Nipkow和他的同事用作课程笔记。它受益于来自课堂的反馈,这对于简化材料的呈现是无价的。我想说它非常适合硕士生。它也适用于学士学位最后一年的学生,对希望形式化或使用形式化数据结构的博士生非常有价值。有趣的是,虽然它的内容是正式验证,这本书不是关于机械化的证明。它是为了方便读者没有背景的证明助理。本书中重要的是为每个数据结构提供的机械化规范。在整本书中,读者被教导如何为集合,映射,序列,函数数组和优先级队列编写正式规范。这些形式接口是程序验证的基础。证明是用英文提出的,每次都有正式的陈述和解释哪种归纳法原理被利用。证明细节可以在附带的Isabelle/HOL证明脚本中找到,对于有兴趣对功能数据结构进行正式证明的读者非常有用。对于其他读者,遵循证明脚本是完全可选的。这本书
{"title":"Review on Functional Algorithms, Verified!","authors":"A. Charguéraud","doi":"10.1145/3594639","DOIUrl":"https://doi.org/10.1145/3594639","url":null,"abstract":"The book Functional Algorithms, Verified! provides a presentation of classic functional data structures and algorithms with a fairly original perspective: that of accompanying every data structure with formal specifications. The specifications cover not only functional correctness but also time complexity bounds. The book has been used as course notes by Tobias Nipkow and colleagues over several years. It benefits from feedback from the classroom, invaluable for streamlining the presentation of the material. I would say that it is well suited for master’s students. It could also be accessible for students in the final year of a bachelor’s degree and highly valuable to Ph.D. students who wish to formalize or use formalized data structures. Interestingly, although its contents are formally verified, this book is not about mechanized proofs. It is meant to be accessible to readers with no background in proof assistants. What matters in this book is the mechanized specifications , which are provided for every data structure. Throughout the book, the reader is taught how to write formal specifications for sets, maps, sequences, functional arrays, and priority queues. These formal interfaces are the cornerstones of program verification. The proofs are presented in English, each time with formal statements and an explanation of what kind of induction principle is exploited. The proof details, which can be found in the accompanying Isabelle/HOL proof scripts, are very useful for readers interested in conducting formal proofs on functional data structures. For other readers, following the proof scripts is completely optional. The book","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":" ","pages":"1 - 2"},"PeriodicalIF":1.0,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46824887","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
Violence Against LGB+ people in Brazil: analysis of the 2019 National Survey of Health. 巴西针对女同性恋、男同性恋、双性恋和变性者(LGB+)的暴力行为:2019 年全国健康调查分析。
IF 1.4 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-04-21 eCollection Date: 2023-01-01 DOI: 10.1590/1980-549720230005.supl.1
Nádia Machado de Vasconcelos, Francielle Thalita Almeida Alves, Gisele Nepomuceno de Andrade, Isabella Vitral Pinto, Adauto Martins Soares Filho, Cimar Azeredo Pereira, Deborah Carvalho Malta

Objective: To analyze the association between self-reported sexual orientation and violence in the Brazilian population.

Methods: This cross-sectional epidemiological study used the 2019 National Survey of Health database. Total violence and its subtypes (psychological, physical, and sexual) were analyzed in the previous 12 months. Prevalence and odds ratio adjusted for age group were estimated, with their respective 95% confidence intervals, according to the self-reported sexual orientation of the Brazilian population aged 18 years and older. Statistical significance was set at 5%.

Results: Most of the Brazilian population self-identified as heterosexual (94.75%) and 1.89% as LGB+. This percentage was lower than that of respondents who refused to answer the question (2.28%). The prevalence of violence in the general population of Brazil was 18.27%, and the most common subtype was psychological violence (17.36%). The LGB+ population was more than twice as likely to experience any type of violence. LGB+ women had the highest prevalence in all violence subtypes, and heterosexual men had the lowest. LGB+ women were over three times more likely to experience physical violence compared to heterosexual ones. Meanwhile, the probability of LGB+ men experiencing sexual violence was almost eight times higher than in heterosexual men.

Conclusion: The prevalence of violence against the LGB+ population was high in the country. Public policies aimed at this population are necessary to fight discrimination against sexual diversity and ensure the rights of non-heterosexual people.

目的:分析巴西人口中自我报告的性取向与暴力之间的关系:分析巴西人口中自我报告的性取向与暴力之间的关联:这项横断面流行病学研究使用了 2019 年全国健康调查数据库。研究分析了过去 12 个月中的暴力事件总数及其子类型(心理、身体和性)。根据巴西 18 岁及以上人口自我报告的性取向,估算了流行率和年龄组调整后的几率,以及各自的 95% 置信区间。统计显著性设定为 5%:大多数巴西人自我认定为异性恋(94.75%),1.89%为 LGB+。这一比例低于拒绝回答问题的受访者(2.28%)。巴西普通人群的暴力发生率为 18.27%,最常见的亚类型是心理暴力(17.36%)。女同性恋、男同性恋、双性恋和变性者遭受任何类型暴力的可能性是普通人的两倍多。在所有暴力亚型中,LGB+ 女性的发生率最高,而异性恋男性的发生率最低。与异性恋相比,LGB+ 女性遭受身体暴力的可能性要高出三倍多。同时,LGB+男性遭受性暴力的几率几乎是异性恋男性的八倍:结论:该国 LGB+ 群体遭受暴力的发生率很高。针对这一人群的公共政策对于打击针对性取向多样性的歧视和确保非异性恋者的权利十分必要。
{"title":"Violence Against LGB+ people in Brazil: analysis of the 2019 National Survey of Health.","authors":"Nádia Machado de Vasconcelos, Francielle Thalita Almeida Alves, Gisele Nepomuceno de Andrade, Isabella Vitral Pinto, Adauto Martins Soares Filho, Cimar Azeredo Pereira, Deborah Carvalho Malta","doi":"10.1590/1980-549720230005.supl.1","DOIUrl":"10.1590/1980-549720230005.supl.1","url":null,"abstract":"<p><strong>Objective: </strong>To analyze the association between self-reported sexual orientation and violence in the Brazilian population.</p><p><strong>Methods: </strong>This cross-sectional epidemiological study used the 2019 National Survey of Health database. Total violence and its subtypes (psychological, physical, and sexual) were analyzed in the previous 12 months. Prevalence and odds ratio adjusted for age group were estimated, with their respective 95% confidence intervals, according to the self-reported sexual orientation of the Brazilian population aged 18 years and older. Statistical significance was set at 5%.</p><p><strong>Results: </strong>Most of the Brazilian population self-identified as heterosexual (94.75%) and 1.89% as LGB+. This percentage was lower than that of respondents who refused to answer the question (2.28%). The prevalence of violence in the general population of Brazil was 18.27%, and the most common subtype was psychological violence (17.36%). The LGB+ population was more than twice as likely to experience any type of violence. LGB+ women had the highest prevalence in all violence subtypes, and heterosexual men had the lowest. LGB+ women were over three times more likely to experience physical violence compared to heterosexual ones. Meanwhile, the probability of LGB+ men experiencing sexual violence was almost eight times higher than in heterosexual men.</p><p><strong>Conclusion: </strong>The prevalence of violence against the LGB+ population was high in the country. Public policies aimed at this population are necessary to fight discrimination against sexual diversity and ensure the rights of non-heterosexual people.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"7 1","pages":"e230005"},"PeriodicalIF":1.4,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10176725/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73126507","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
A Case in Point: Verification and Testing of a EULYNX Interface 一个恰当的案例:一个EULYNX接口的验证与测试
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-03-16 DOI: https://dl.acm.org/doi/10.1145/3528207
Mark Bouwman, Djurre van der Wal, Bas Luttik, Mariëlle Stoelinga, Arend Rensink

We present a case study on the application of formal methods in the railway domain. The case study is part of the FormaSig project, which aims to support the development of EULYNX — a European standard defining generic interfaces for railway equipment — using formal methods. We translate the semi-formal SysML models created within EULYNX to formal mCRL2 models. By adopting a model-centric approach in which a formal model is used both for analyzing the quality of the EULYNX specification and for automated compliance testing, a high degree of traceability is achieved.

The target of our case study is the EULYNX Point subsystem interface. We present a detailed catalog of the safety requirements, and provide counterexamples that show that some of them do not hold without specific fairness assumptions. We also use the mCRL2 model to generate both random and guided tests, which we apply to a third-party software simulator. We share metrics on the coverage and execution time of the tests, which show that guided testing outperforms random testing. The test results indicate several discrepancies between the model and the simulator. One of these discrepancies is caused by a fault in the simulator, the others are caused by false positives, i.e. an over-approximation of fail verdicts by our test setup.

我们提出了形式化方法在铁路领域应用的一个案例研究。该案例研究是FormaSig项目的一部分,该项目旨在支持使用形式化方法定义铁路设备通用接口的欧洲标准EULYNX的开发。我们将在EULYNX中创建的半形式化的SysML模型转换为形式化的mCRL2模型。通过采用以模型为中心的方法,其中正式模型用于分析EULYNX规范的质量和自动遵从性测试,可以实现高度的可追溯性。我们案例研究的目标是EULYNX Point子系统接口。我们提出了安全要求的详细目录,并提供反例,表明其中一些没有具体的公平假设就不成立。我们还使用mCRL2模型生成随机和引导测试,并将其应用于第三方软件模拟器。我们共享测试的覆盖率和执行时间的度量,这表明引导测试优于随机测试。测试结果表明,模型与模拟器之间存在一些差异。其中一个差异是由模拟器中的故障引起的,其他的是由误报引起的,即我们的测试设置对失败判决的过度近似。
{"title":"A Case in Point: Verification and Testing of a EULYNX Interface","authors":"Mark Bouwman, Djurre van der Wal, Bas Luttik, Mariëlle Stoelinga, Arend Rensink","doi":"https://dl.acm.org/doi/10.1145/3528207","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3528207","url":null,"abstract":"<p>We present a case study on the application of formal methods in the railway domain. The case study is part of the FormaSig project, which aims to support the development of EULYNX — a European standard defining generic interfaces for railway equipment — using formal methods. We translate the semi-formal SysML models created within EULYNX to formal mCRL2 models. By adopting a model-centric approach in which a formal model is used both for analyzing the quality of the EULYNX specification and for automated compliance testing, a high degree of traceability is achieved.</p><p>The target of our case study is the EULYNX Point subsystem interface. We present a detailed catalog of the safety requirements, and provide counterexamples that show that some of them do not hold without specific fairness assumptions. We also use the mCRL2 model to generate both random and guided tests, which we apply to a third-party software simulator. We share metrics on the coverage and execution time of the tests, which show that guided testing outperforms random testing. The test results indicate several discrepancies between the model and the simulator. One of these discrepancies is caused by a fault in the simulator, the others are caused by false positives, i.e. an over-approximation of fail verdicts by our test setup.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"99 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517749","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
A Deep Reinforcement Learning Framework with Formal Verification 具有形式化验证的深度强化学习框架
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-03-15 DOI: https://dl.acm.org/doi/10.1145/3577204
Zakaryae Boudi, Abderrahim Ait Wakrime, Mohamed Toub, Mohamed Haloua

Artificial Intelligence (AI) and data are reshaping organizations and businesses. Human Resources (HR) management and talent development make no exception, as they tend to involve more automation and growing quantities of data. Because this brings implications on workforce, career transparency, and equal opportunities, overseeing what fuels AI and analytical models, their quality standards, integrity, and correctness becomes an imperative for those aspiring to such systems. Based on an ontology transformation to B-machines, this article presents an approach to constructing a valid and error-free career agent with Deep Reinforcement Learning (DRL). In short, the agent's policy is built on a framework we called Multi State-Actor (MuStAc) using a decentralized training approach. Its purpose is to predict both relevant and valid career steps to employees, based on their profiles and company pathways (observations). Observations can comprise various data elements such as the current occupation, past experiences, performance, skills, qualifications, and so on. The policy takes in all these observations and outputs the next recommended career step, in an environment set as the combination of an HR ontology and an Event-B model, which generates action spaces with respect to formal properties. The Event-B model and formal properties are derived using OWL to B transformation.

人工智能(AI)和数据正在重塑组织和企业。人力资源管理和人才发展也不例外,因为它们往往涉及更多的自动化和不断增长的数据量。因为这对劳动力、职业透明度和平等机会都有影响,所以监督人工智能和分析模型的动力、它们的质量标准、完整性和正确性对那些渴望建立这样的系统的人来说是必不可少的。基于本体到b机器的转换,提出了一种利用深度强化学习(DRL)构建有效、无错误的职业智能体的方法。简而言之,智能体的策略建立在我们称为多状态行为者(MuStAc)的框架上,使用分散的训练方法。其目的是根据员工的个人资料和公司发展路径(观察),预测员工相关且有效的职业发展步骤。观察可以包含各种数据元素,如当前职业、过去的经验、表现、技能、资格等等。该策略接受所有这些观察结果,并在HR本体和Event-B模型的组合环境中输出下一个推荐的职业步骤,后者根据形式属性生成操作空间。Event-B模型和形式属性是使用OWL to B转换派生的。
{"title":"A Deep Reinforcement Learning Framework with Formal Verification","authors":"Zakaryae Boudi, Abderrahim Ait Wakrime, Mohamed Toub, Mohamed Haloua","doi":"https://dl.acm.org/doi/10.1145/3577204","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577204","url":null,"abstract":"<p>Artificial Intelligence (AI) and data are reshaping organizations and businesses. Human Resources (HR) management and talent development make no exception, as they tend to involve more automation and growing quantities of data. Because this brings implications on workforce, career transparency, and equal opportunities, overseeing what fuels AI and analytical models, their quality standards, integrity, and correctness becomes an imperative for those aspiring to such systems. Based on an ontology transformation to B-machines, this article presents an approach to constructing a valid and error-free career agent with Deep Reinforcement Learning (DRL). In short, the agent's policy is built on a framework we called Multi State-Actor (MuStAc) using a decentralized training approach. Its purpose is to predict both relevant and valid career steps to employees, based on their profiles and company pathways (observations). Observations can comprise various data elements such as the current occupation, past experiences, performance, skills, qualifications, and so on. The policy takes in all these observations and outputs the next recommended career step, in an environment set as the combination of an HR ontology and an Event-B model, which generates action spaces with respect to formal properties. The Event-B model and formal properties are derived using OWL to B transformation.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"5 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517750","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 Section on Reliability, Safety, and Security of Railway Systems 铁道系统可靠性、安全性及保安专题导论
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-03-15 DOI: 10.1145/3578524
S. Collart-Dutilleul, A. Haxthausen, T. Lecomte, J. Woodcock
RSSRail is an International Conference on Reliability, Safety and Security of Railway Systems, which occurs every 18 months. During the pandemic, it was decided that a special journal collection of articles concerning formal approaches for railway safety and security would replace the physical event of RSSRail 2021. This special collection presents methods for efficient, formal development, and verification of railway signalling subsystems like points specified by the European EULYNX standard, speed controllers specified by ETCS, and interlocking systems. Furthermore, an original formal-based methodology using deep reinforcement learning is detailed.
RSSRail是一个关于铁路系统可靠性、安全性和安全性的国际会议,每18个月举行一次。在大流行期间,决定以一份关于铁路安全和安保正式方法的特别期刊文集取代RSSRail 2021的实体活动。这个特别的集合介绍了高效、正式开发和验证铁路信号子系统的方法,如欧洲EULYNX标准规定的点、ETCS规定的速度控制器和联锁系统。此外,详细介绍了使用深度强化学习的原始基于形式的方法。
{"title":"Introduction to the Special Section on Reliability, Safety, and Security of Railway Systems","authors":"S. Collart-Dutilleul, A. Haxthausen, T. Lecomte, J. Woodcock","doi":"10.1145/3578524","DOIUrl":"https://doi.org/10.1145/3578524","url":null,"abstract":"RSSRail is an International Conference on Reliability, Safety and Security of Railway Systems, which occurs every 18 months. During the pandemic, it was decided that a special journal collection of articles concerning formal approaches for railway safety and security would replace the physical event of RSSRail 2021. This special collection presents methods for efficient, formal development, and verification of railway signalling subsystems like points specified by the European EULYNX standard, speed controllers specified by ETCS, and interlocking systems. Furthermore, an original formal-based methodology using deep reinforcement learning is detailed.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"35 1","pages":"1 - 2"},"PeriodicalIF":1.0,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43221092","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
Review on Logical Analysis of Hybrid Systems By André Platzer Springer, 2010, 426 pages, ISBN 978-3-642-14508-7link.springer.com/book/10.1007/978-3-642-14509-4 《混合系统逻辑分析综述》,作者:安德列·普拉泽·施普林格,2010,426页,ISBN 978-3-642-14508-7link.springer.com/book/10.1007/978-3-642-14509-4
IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2023-01-29 DOI: https://dl.acm.org/doi/10.1145/3561612
Gabriele Paveri Fontana

No abstract available.

没有摘要。
{"title":"Review on Logical Analysis of Hybrid Systems By André Platzer Springer, 2010, 426 pages, ISBN 978-3-642-14508-7link.springer.com/book/10.1007/978-3-642-14509-4","authors":"Gabriele Paveri Fontana","doi":"https://dl.acm.org/doi/10.1145/3561612","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3561612","url":null,"abstract":"<p>No abstract available.</p>","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517805","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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1