2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)最新文献

Differential Testing of a Verification Framework for Compiler Optimizations (Case Study) 编译器优化验证框架的差分测试(案例研究)

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00015

M. Utting, Brae J. Webb, I. Hayes

引用次数: 0

A Verified UAV Flight Plan Generator 一个经过验证的无人机飞行计划生成器

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00021

Baptiste Pollien, C. Garion, G. Hattenberger, P. Roux, X. Thirioux

引用次数: 0

Mutant Equivalence as Monotonicity in Parametric Timed Games 参数定时对策中单调性的突变等价

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00014

D. Basile, Maurice H. ter Beek, Hendrik Göttmann, Malte Lochau

引用次数: 0

A Dafny-based approach to thread-local information flow analysis 基于dafny的线程本地信息流分析方法

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00017

Graeme Smith

引用次数: 0

Using scylindric algebra to support local variables in rely/guarantee concurrency* 使用圆柱代数来支持依赖/保证并发性的局部变量*

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00019

L. Meinicke, I. Hayes

引用次数: 1

Transparent Actor Model 透明角色模型

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00018

F. Ghassemi, M. Sirjani, E. Khamespanah, Mahrokh Mirani, Hossein Hojjat

{"title":"Transparent Actor Model","authors":"F. Ghassemi, M. Sirjani, E. Khamespanah, Mahrokh Mirani, Hossein Hojjat","doi":"10.1109/FormaliSE58978.2023.00018","DOIUrl":"https://doi.org/10.1109/FormaliSE58978.2023.00018","url":null,"abstract":"Several programming and formal modeling languages are designed based on actors. Each language has certain policies for message delivery between actors and for handling the messages in the buffers. These policies are implicit in the semantics of each language. One can infer interesting properties of actor languages related to communication and coordination based on different policies and their interactions. We define the “Transparent Actor” model where we make policies explicit as points of possible variations. We identify an abstract network entity and define the semantics of Transparent Actors in three parts: actors, network, and composition. We define a core actor language named BABEL as a basis to describe the semantics of Transparent Actors using structural operational semantics (SOS) rules with variation points. These parametric rules make the implicit policies clear and can be used as a template to define the semantics of different actor-based languages. We evaluate the applicability of the template by examining the semantics for actor-based languages Rebeca, Lingua Franca, ABS, AKKA, and Erlang. We implement BABEL in Maude as a proof of concept, then concretize the parametric rules to implement some of the above languages. We consider a few properties, check them via a set of designated litmus test cases using our Maude implementations, and discuss the policy interactions.","PeriodicalId":434351,"journal":{"name":"2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133226140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Formalizing Path Explosion for Recursive Functions via Asymptotic Path Complexity 用渐近路径复杂度形式化递归函数的路径爆炸

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00016

Eli Pregerson, Shaheen Cullen-Baratloo, David Chen, Duy Lam, Max Szostak, Lucas Bang

{"title":"Formalizing Path Explosion for Recursive Functions via Asymptotic Path Complexity","authors":"Eli Pregerson, Shaheen Cullen-Baratloo, David Chen, Duy Lam, Max Szostak, Lucas Bang","doi":"10.1109/FormaliSE58978.2023.00016","DOIUrl":"https://doi.org/10.1109/FormaliSE58978.2023.00016","url":null,"abstract":"Path coverage is of critical importance in software testing and verification. Furthermore, path explosion is a well-known challenge for automatic software analysis techniques like symbolic execution. Asymptotic Path Complexity (APC) is a code complexity metric that formalizes the quantitative measurement of path explosion and therefore measures the difficulty of achieving path coverage. Prior APC methods were not sufficiently expressive to model the path explosion behavior in recursive functions. Existing analyses simply ignored recursive calls and were unable to correctly compute APC for recursive functions. We present a novel method for computing asymptotic path complexity for recursive functions, which we call APC-R. Our approach is based on the analytic combinatorics of context-free grammars. We implemented our approach on top of the code complexity analysis tool METRINOME and evaluated our implementation on a set of benchmark programs written in the C programming language. Our experiments demonstrate that APC-R is a sound upper bound on the growth rate of the number of program paths explored as a function of increasing exploration depth when generating tests with the KLEE symbolic execution engine. Our APC-R implementation provides sound bounds on KLEE’S symbolic execution path explosion for recursive functions in cases where the original APC implementation did not, and APC-R matches the results of APC for non-recursive functions with only marginal computational overhead. That is, APC-R subsumes earlier APC work without significant performance cost.","PeriodicalId":434351,"journal":{"name":"2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127063716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Formal Approach to the Verification of Protection Systems in Low-Voltage Distribution Grids 低压配电网保护系统验证的形式化方法

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00020

Ahmed Nagy Abdelkhalek Mansour, S. Grillo, E. Ragaini, Matteo G. Rossi

{"title":"A Formal Approach to the Verification of Protection Systems in Low-Voltage Distribution Grids","authors":"Ahmed Nagy Abdelkhalek Mansour, S. Grillo, E. Ragaini, Matteo G. Rossi","doi":"10.1109/FormaliSE58978.2023.00020","DOIUrl":"https://doi.org/10.1109/FormaliSE58978.2023.00020","url":null,"abstract":"Poiver systems have mechanisms-so-called protection systems-to automatically disconnect parts of the electrical network when faults occur, to isolate the faulty part of the system. These mechanisms rely on devices, called circuit breakers, that automatically open when a fault is detected. The logic for opening circuit breakers is most commonly based on a combination of timing properties of the devices and current thresholds. The logic is configured at design time, and it is crucial that it achieves selectivity, that is, that it only disconnects the relevant part of the network, thus minimizing the amount of unfed load. In this paper, we present an approach to formally verify the correct configuration of the protection systems in a low-voltage (LV) distribution grid. In particular, the approach relies on a formal model, based on Timed Automata, of the relevant elements of an LV distribution grid. It also includes a mechanism to automatically generate and verify formal models starting from higher-level, JSON-based descriptions of electrical networks. The formal verification mechanism exploits the UPPAAL model checker. The paper presents some experimental results that show the promise of the proposed approach.","PeriodicalId":434351,"journal":{"name":"2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115832303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An Empirical Study Assessing Software Modeling in Alloy 合金软件建模评估的实证研究

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00013

Niloofar Mansoor, H. Bagheri, Eunsuk Kang, Bonita Sharif

{"title":"An Empirical Study Assessing Software Modeling in Alloy","authors":"Niloofar Mansoor, H. Bagheri, Eunsuk Kang, Bonita Sharif","doi":"10.1109/FormaliSE58978.2023.00013","DOIUrl":"https://doi.org/10.1109/FormaliSE58978.2023.00013","url":null,"abstract":"Alloy is a declarative formal modeling language with syntax derived from notations common to object-oriented design and first-order relational logic semantics. To better understand the usability of Alloy, the paper presents the results of an empirical study with 30 participants assessing two types of modeling tasks: bug fixing and model building based on natural language specifications. The participants consisted of both novices and non-novices. Besides accuracy and time to complete tasks, we also examined the correlation between the performance of two cognitive tasks and task performance. Results indicate that overall, non-novices completed the tasks with significantly higher accuracy (54% more accurate) than novices. In the novice group, performing more actions using the Alloy analyzer led to more edits and, eventually, higher scores in the bug fixing tasks. We found that participants of all levels had much difficulty writing a model from scratch, and they did not utilize the analyzer to improve their models. On average, non-novices completed all the tasks 32 minutes faster than novices. Non-novices who performed better on the Alloy tasks had higher mental rotation scores, which indicates the importance of spatial cognition ability in solving Alloy tasks. Overall, we find that there is a definite need to improve the usability of the visualizations in the Alloy Analyzer.","PeriodicalId":434351,"journal":{"name":"2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116509023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Patch Specifications via Product Programs 通过产品程序的补丁规格

2023 IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2023-05-01 DOI: 10.1109/FormaliSE58978.2023.00012

Cristian Cadar, Daniel Schemmel, Arindam Sharma

引用次数: 0