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

Towards Automated Input Generation for Sketching Alloy Models 面向合金模型草图的自动输入生成

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527651

Ana Jovanovic, Allison Sullivan

引用次数: 0

C for Yourself: Comparison of Front-End Techniques for Formal Verification C for Yourself:形式验证的前端技术比较

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527646

Levente Bajczi, Zsófia Ádám, V. Molnár

引用次数: 0

Generating Counterexamples in the form of Unit Tests from Hoare-style Verification Attempts 从hoare风格的验证尝试中以单元测试的形式生成反例

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527656

Amirfarhad Nilizadeh, Marlon Calvo, Gary T. Leavens, D. Cok

引用次数: 6

Formal Specifications Investigated: A Classification and Analysis of Annotations for Deductive Verifiers 形式规范研究:演绎验证器注释的分类与分析

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527652

Sophie Lathouwers, M. Huisman

{"title":"Formal Specifications Investigated: A Classification and Analysis of Annotations for Deductive Verifiers","authors":"Sophie Lathouwers, M. Huisman","doi":"10.1145/3524482.3527652","DOIUrl":"https://doi.org/10.1145/3524482.3527652","url":null,"abstract":"Deductive verification can be used to ensure properties about all possible behaviours of a program, even when the program is parameterised and has an unbounded state space. But to achieve this, the user needs to specify what the desired properties are, and often needs to guide the prover with auxiliary annotations. This paper investigates what annotations are actually needed, and it provides a taxonomy to categorise these annotations. In particular, we identify several top-level categories, which are further divided into subcategories of annotations. This taxonomy is then used as a basis to investigate how often particular annotation categories occur, by inspecting over 10k lines of annotated programs. To determine whether the results are in line with expectations, we have interviewed several experts on deductive verification. Moreover, we show how the results can be used to evaluate the effectiveness of annotation generators. The knowledge from this analysis provides a gateway to guide further research in improving the efficiency of deductive verification, e.g.: it can serve as a guideline on what categories of annotations should be generated automatically, to evaluate the power of existing annotation generation techniques, and to improve the teaching of deductive verification.","PeriodicalId":119264,"journal":{"name":"2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124029406","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}

引用次数: 2

Counting Bugs in Behavioural Models using Counterexample Analysis 使用反例分析计算行为模型中的错误

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527647

Irman Faqrizal, Gwen Salaün

{"title":"Counting Bugs in Behavioural Models using Counterexample Analysis","authors":"Irman Faqrizal, Gwen Salaün","doi":"10.1145/3524482.3527647","DOIUrl":"https://doi.org/10.1145/3524482.3527647","url":null,"abstract":"Designing and developing distributed software has always been a tedious and error-prone task, and the ever increasing software complexity is making matters even worse. Model checking automatically verifies that a model, e.g., a Labelled Transition System (LTS), obtained from higher-level specification languages satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, but this counterexample does not precisely identify the source of the bug. In this work, we propose some techniques for simplifying the debugging of these models. These techniques first extract from the whole behavioural model the part which does not satisfy the given property. In that model, we then detect specific states (called faulty states) where a choice is possible between executing a correct behaviour or falling into an erroneous part of the model. By using this model, we propose in this paper some techniques to count the number of bugs in the original specification. The core idea of the approach is to change the specification for some specific actions that may cause the property violation, and compare the model before and after modification to detect whether this potential bug is one real bug or not. Beyond introducing in details the solution, this paper also presents tool support and experiments.","PeriodicalId":119264,"journal":{"name":"2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"482 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134375208","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

Counterexample-Guided Inductive Repair of Reactive Contracts 反例引导的感应修复无功契约

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527650

Soha Hussein, Sanjai Rayadurgam, Stephen McCamant, Vaibhav Sharma, M. Heimdahl

{"title":"Counterexample-Guided Inductive Repair of Reactive Contracts","authors":"Soha Hussein, Sanjai Rayadurgam, Stephen McCamant, Vaibhav Sharma, M. Heimdahl","doi":"10.1145/3524482.3527650","DOIUrl":"https://doi.org/10.1145/3524482.3527650","url":null,"abstract":"Executable implementations are ultimately the only dependable representations of a software component’s behavior. Incorporating such a component in a rigorous model-based development of reactive systems poses challenges since a formal contract over its behaviors will have to be crafted for system verification. Simply hypothesizing a contract based on informal descriptions of the component is problematic: if it is too weak, we may fail in verifying valid system-level contracts; if it is too strong or simply erroneous, the system may fail in operation. Thus, establishing a valid and strong enough contract is crucially important.In this paper, we propose to repair the invalid hypothesized contract by replacing one or more of its sub-expressions with newly composed expressions, such that the new contract holds over the implementation. To this effect, we present a novel, sound, semantically minimal, and under reasonable assumptions terminating, and complete counterexample-guided general-purpose algorithm for repairing contracts. We implemented and evaluated our technique on more than 4,000 mutants with various complexities generated from 29 valid contracts for 4 non-trivial Java reactive components. Results show a successful repair rate of 81.51%, with 20.72% of the repairs matching the manually written contracts and 60.79% of the repairs describing non-trivial valid contracts.","PeriodicalId":119264,"journal":{"name":"2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115539244","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}

引用次数: 1

Computing Program Functions 计算程序功能

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527655

Hessamaldin Mohammadi, Wided Ghardallou, R. Linger, A. Mili

{"title":"Computing Program Functions","authors":"Hessamaldin Mohammadi, Wided Ghardallou, R. Linger, A. Mili","doi":"10.1145/3524482.3527655","DOIUrl":"https://doi.org/10.1145/3524482.3527655","url":null,"abstract":"Extracting the function of a program from a static analysis of its source code is a valuable capability in software engineering, but it has proved to be an elusive goal, due primarily to the difficulty of deriving the function of iterative statements. Several automated tools obviate this difficulty by unrolling the loops; but this is clearly an imperfect solution, especially in light of the fact that loops capture most of the computing power of a program, are the locus of most of its complexity, and the source of most of its faults. In this paper we discuss the design and ongoing implementation of an automated tool for deriving the function of a program in three steps: first, the source code is mapped onto an abstract syntax tree (AST), using standard parsing technology; then each node of the AST is mapped onto an equation between pre and post states; finally, these equations are submitted to a symbolic computation engine that extracts the final program state as a function of its initial state. Loop functions are derived by pattern matching against semantic recognizers, which capture the requisite programming knowledge and domain knowledge.","PeriodicalId":119264,"journal":{"name":"2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121767269","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}

引用次数: 2

Formal Modeling and Verification of Multi-Robot Interactive Scenarios in Service Settings 服务环境中多机器人交互场景的形式化建模与验证

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527653

Livia Lestingi, Cristian Sbrolli, P. Scarmozzino, Giorgio Romeo, M. Bersani, Matteo G. Rossi

{"title":"Formal Modeling and Verification of Multi-Robot Interactive Scenarios in Service Settings","authors":"Livia Lestingi, Cristian Sbrolli, P. Scarmozzino, Giorgio Romeo, M. Bersani, Matteo G. Rossi","doi":"10.1145/3524482.3527653","DOIUrl":"https://doi.org/10.1145/3524482.3527653","url":null,"abstract":"Service robots are increasingly widespread in healthcare and domestic assistance settings. Nevertheless, the literature still lacks robotic application development approaches that can deal with the complexity of multi-agent systems and the unpredictability of human behavior. We target this issue by building upon a model-driven development framework for human-robot interactive scenarios that relies on formal analysis (Statistical Model Checking) to estimate the probability of success of the robotic mission. We extend the framework’s scope to scenarios featuring multi-robot fleets, a broader range of human-robot interaction contingencies, and task handover between robots. We also present an extended model of human behavior to capture interaction patterns implying close contact or competition with the robot. In the latter case, the user can specify alternative mission plans for the robot, depending on the competition outcome. We illustrate the approach’s effectiveness and scalability through a case study from the healthcare setting, featuring multiple mobile robots and humans with diverse physiological characteristics and requesting a broad spectrum of services.","PeriodicalId":119264,"journal":{"name":"2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130569451","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

Automatic Loop Invariant Generation for Data Dependence Analysis 数据依赖性分析的自动循环不变量生成

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527649

Asmae Heydari Tabar, Richard Bubel, Reiner Hähnle

引用次数: 0

Test Suite Generation for Boolean Conditions with Equivalence Class Partitioning 具有等价类划分的布尔条件的测试集生成

2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) Pub Date : 2022-05-01 DOI: 10.1145/3524482.3527659

Sylvain Hallé

引用次数: 1