Formal Aspects of Computing最新文献_第9页

Algebra-Based Reasoning for Loop Synthesis 基于代数的回路综合推理

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2022-04-07 DOI: 10.1145/3527458

Andreas Humenberger, Daneshvar Amrollahi, N. Bjørner, L. Kovács

{"title":"Algebra-Based Reasoning for Loop Synthesis","authors":"Andreas Humenberger, Daneshvar Amrollahi, N. Bjørner, L. Kovács","doi":"10.1145/3527458","DOIUrl":"https://doi.org/10.1145/3527458","url":null,"abstract":"Provably correct software is one of the key challenges of our software-driven society. Program synthesis—the task of constructing a program satisfying a given specification—is one strategy for achieving this. The result of this task is then a program that is correct by design. As in the domain of program verification, handling loops is one of the main ingredients to a successful synthesis procedure. We present an algorithm for synthesizing loops satisfying a given polynomial loop invariant. The class of loops we are considering can be modeled by a system of algebraic recurrence equations with constant coefficients, thus encoding program loops with affine operations among program variables. We turn the task of loop synthesis into a polynomial constraint problem by precisely characterizing the set of all loops satisfying the given invariant. We prove soundness of our approach, as well as its completeness with respect to an a priori fixed upper bound on the number of program variables. Our work has applications toward synthesizing loops satisfying a given polynomial loop invariant—program verification—as well as generating number sequences from algebraic relations. To understand viability of the methodology and heuristics for synthesizing loops, we implement and evaluate the method using the Absynth tool.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":" ","pages":"1 - 31"},"PeriodicalIF":1.0,"publicationDate":"2022-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44325415","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 Section on iFM 2020 iFM 2020特别部分介绍

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2022-03-31 DOI: 10.1145/3546592

Brijesh Dongol, E. Troubitsyna

{"title":"Introduction to the Special Section on iFM 2020","authors":"Brijesh Dongol, E. Troubitsyna","doi":"10.1145/3546592","DOIUrl":"https://doi.org/10.1145/3546592","url":null,"abstract":"In recent years, we have witnessed a proliferation of approaches that integrate several modeling, verification, simulation, and testing techniques. Such approaches facilitate more versatile and efficient analysis of modern computation-intensive systems. They provide powerful support for the analysis of different functional and non-functional properties of the systems, various hardware and software components, and their interaction, as well as the design and validation of diverse aspects of system behavior. iFM 2020 solicited high-quality papers reporting novel research results as well as tool papers and experience reports. The Program Committee (PC) received 63 submissions and selected 24 for publication, of which 2 were short papers. The conference was held online due to the COVID-19 pandemic. We received fantastic support from the general chair, Carlo Furia, and his team, allowing the virtual conference to proceed smoothly and efficiently. For this we are very thankful. Here is a collection of the extended versions of the best papers from the iFM 2020 conference that have been selected by the PC. The articles cover a broad spectrum of topics, describing formal verification of a file system for flash memory down to system-level code, error analysis of the arithmetic operations as a means of controlling error propagation, and loop synthesis from loop invariants via reductions to polynomial constraint problems. The three accepted articles are listed below:","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":"34 1","pages":"1 - 1"},"PeriodicalIF":1.0,"publicationDate":"2022-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48574476","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

Verification of Crashsafe Caching in a Virtual File System Switch 虚拟文件系统交换机的crash - safe缓存验证

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2022-03-26 DOI: 10.1145/3523737

Stefan Bodenmüller, G. Schellhorn, W. Reif

引用次数: 2

Editorial 编辑

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2021-12-01 DOI: 10.1007/s00165-021-00569-w

Wolfgang Ahrendt, S. L. Tapia Tarifa, Heike Wehrheim

引用次数: 0

Statistical model checking for variability-intensive systems: applications to bug detection and minimization 变量密集系统的统计模型检查:用于缺陷检测和最小化的应用

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2021-12-01 DOI: 10.1007/s00165-021-00563-2

Maxime Cordy, Sami Lazreg, Mike Papadakis, Axel Legay

引用次数: 2

Editorial 社论

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2021-12-01 DOI: 10.1007/s00165-021-00565-0

Jordi Cabot, Heike Wehrheim, E. Boiten

引用次数: 0

Editorial 编辑

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2021-12-01 DOI: 10.1007/s00165-021-00568-x

Alessandro Fantechi, Anne E. Haxthausen, Jim Woodcock

引用次数: 0

A refinement-based development of a distributed signalling system 基于改进的分布式信号系统开发

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2021-11-24 DOI: 10.1007/s00165-021-00567-y

P. Stankaitis, A. Iliasov, Tsutomu Kobayashi, Y. A. Ameur, F. Ishikawa, A. Romanovsky

引用次数: 2

TOrPEDO: witnessing model correctness with topological proofs 鱼雷:用拓扑证明证明模型的正确性

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2021-11-06 DOI: 10.1007/s00165-021-00564-1

C. Menghi, A. M. Rizzi, A. Bernasconi, P. Spoletini

引用次数: 1

Drawing with SAT: four methods and A tool for producing railway infrastructure schematics 用SAT绘图:制作铁路基础设施图的四种方法和工具

IF 1 4区计算机科学

Formal Aspects of Computing Pub Date : 2021-10-20 DOI: 10.1007/s00165-021-00566-z

Bjørnar Luteberget, Christian Johansen

引用次数: 2