F-IDE@NFM最新文献

筛选
英文 中文
Analysis of Source Code Using UPPAAL 使用UPPAAL分析源代码
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.5
Mitja Kulczynski, Axel Legay, Dirk Nowotka, D. B. Poulsen
{"title":"Analysis of Source Code Using UPPAAL","authors":"Mitja Kulczynski, Axel Legay, Dirk Nowotka, D. B. Poulsen","doi":"10.4204/EPTCS.338.5","DOIUrl":"https://doi.org/10.4204/EPTCS.338.5","url":null,"abstract":"In recent years there has been a considerable effort in optimising formal methods for application to code. This has been driven by tools such as CPAChecker, DIVINE, and CBMC. At the same time tools such as Uppaal have been massively expanding the realm of more traditional model checking technologies to include strategy synthesis algorithms - an aspect becoming more and more needed as software becomes increasingly parallel. Instead of reimplementing the advances made by Uppaal in this area, we suggest in this paper to develop a bridge between the source code and the engine of Uppaal. Our approach uses the widespread intermediate language LLVM and makes recent advances of the Uppaal ecosystem readily available to analysis of source code.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121035907","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
How the Analyzer can Help the User Help the Analyzer 分析器如何帮助用户帮助分析器
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.12
Yannick Moy
{"title":"How the Analyzer can Help the User Help the Analyzer","authors":"Yannick Moy","doi":"10.4204/EPTCS.338.12","DOIUrl":"https://doi.org/10.4204/EPTCS.338.12","url":null,"abstract":"The automation offered by modern program proof tools goes hand in hand with the capability to interact with the tool when the verification fails. The SPARK proof tool tries to help the user by providing the right information, so that the user can help the tool complete the proof. In this article, we present these mechanisms and how they work concretely on a simple running example.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124899952","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
Verifying Time Complexity of Binary Search using Dafny 用Dafny验证二分查找的时间复杂度
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.9
Shiri Morshtein, Ran Ettinger, S. Tyszberowicz
{"title":"Verifying Time Complexity of Binary Search using Dafny","authors":"Shiri Morshtein, Ran Ettinger, S. Tyszberowicz","doi":"10.4204/EPTCS.338.9","DOIUrl":"https://doi.org/10.4204/EPTCS.338.9","url":null,"abstract":"Formal software verification techniques are widely used to specify and prove the functional correctness of programs. However, nonfunctional properties such as time complexity are usually carried out with pen and paper. Inefficient code in terms of time complexity may cause massive performance problems in large-scale complex systems. We present a proof of concept for using the Dafny verification tool to specify and verify the worst-case time complexity of binary search. This approach can also be used for academic purposes as a new way to teach algorithms and complexity.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125554987","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}
引用次数: 3
Explaining Counterexamples with Giant-Step Assertion Checking 用巨步断言检查解释反例
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.10
Benedikt F. H. Becker, C. Lourenço, C. Marché
{"title":"Explaining Counterexamples with Giant-Step Assertion Checking","authors":"Benedikt F. H. Becker, C. Lourenço, C. Marché","doi":"10.4204/EPTCS.338.10","DOIUrl":"https://doi.org/10.4204/EPTCS.338.10","url":null,"abstract":"Identifying the cause of a proof failure during deductive verification of programs is hard: it may be due to an incorrectness in the program, an incompleteness in the program annotations, or an incompleteness of the prover. The changes needed to resolve a proof failure depend on its category, but the prover cannot provide any help on the categorisation. When using an SMT solver to discharge a proof obligation, that solver can propose a model from a failed attempt, from which a possible counterexample can be derived. But the counterexample may be invalid, in which case it may add more confusion than help. To check the validity of a counterexample and to categorise the proof failure, we propose the comparison between the run-time assertion-checking (RAC) executions under two different semantics, using the counterexample as an oracle. The first RAC execution follows the normal program semantics, and a violation of a program annotation indicates an incorrectness in the program. The second RAC execution follows a novel \"giant-step\" semantics that does not execute loops nor function calls but instead retrieves return values and values of modified variables from the oracle. A violation of the program annotations only observed under giant-step execution characterises an incompleteness of the program annotations. We implemented this approach in the Why3 platform for deductive program verification and evaluated it using examples from prior literature.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129826161","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}
引用次数: 7
Plotting in a Formally Verified Way 以正式验证的方式绘图
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.6
G. Melquiond
{"title":"Plotting in a Formally Verified Way","authors":"G. Melquiond","doi":"10.4204/EPTCS.338.6","DOIUrl":"https://doi.org/10.4204/EPTCS.338.6","url":null,"abstract":"An invaluable feature of computer algebra systems is their ability to plot the graph of functions. Unfortunately, when one is trying to design a library of mathematical functions, this feature often falls short, producing incorrect and potentially misleading plots, due to accuracy issues inherent to this use case. This paper investigates what it means for a plot to be correct and how to formally verify this property. The Coq proof assistant is then turned into a tool for plotting function graphs using reliable polynomial approximations. This feature is provided as part of the CoqInterval library.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"25 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133919983","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
The Specification Language Server Protocol: A Proposal for Standardised LSP Extensions 规范语言服务器协议:一种标准化LSP扩展方案
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.3
J. Rask, F. P. Madsen, N. Battle, H. D. Macedo, P. Larsen
{"title":"The Specification Language Server Protocol: A Proposal for Standardised LSP Extensions","authors":"J. Rask, F. P. Madsen, N. Battle, H. D. Macedo, P. Larsen","doi":"10.4204/EPTCS.338.3","DOIUrl":"https://doi.org/10.4204/EPTCS.338.3","url":null,"abstract":"The Language Server Protocol (LSP) changed the field of Integrated Development Environments(IDEs), as it decouples core (programming) language features functionality from editor smarts, thus lowering the effort required to extend an IDE to support a language. The concept is a success and has been adopted by several programming languages and beyond. This is shown by the emergence of several LSP implementations for the many programming and specification languages (languages with a focus on modelling, reasoning, or proofs). However, for such languages LSP has been ad-hocly extended with the additional functionalities that are typically not found for programming languages and thus not supported in LSP. This foils the original LSP decoupling goal, because the move towards a new IDE requires yet another re-implementation of the ad-hoc LSP extension. In this paper we contribute with a conservative extension of LSP providing a first proposal towards a standard protocol decoupling the support of specification languages from the IDE. We hope our research attracts the larger community and motivates the need of a joint task force leading to a standardised LSP extension serving the particular needs of specification languages.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125737649","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}
引用次数: 6
Dezyne: Paving the Way to Practical Formal Software Engineering Dezyne:为实用的正式软件工程铺平道路
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.4
Rutger van Beusekom, B. D. Jonge, Paul F. Hoogendijk, Jan Nieuwenhuizen
{"title":"Dezyne: Paving the Way to Practical Formal Software Engineering","authors":"Rutger van Beusekom, B. D. Jonge, Paul F. Hoogendijk, Jan Nieuwenhuizen","doi":"10.4204/EPTCS.338.4","DOIUrl":"https://doi.org/10.4204/EPTCS.338.4","url":null,"abstract":"Designing software that controls industrial equipment is challenging, especially due to its inherent concurrent nature. Testing this kind of event driven control software is difficult and, due to the large number of possible execution scenarios only a low dynamic test coverage is achieved in practice. This in turn is undesirable due to the high cost of software failure for this type of equipment. In this paper we describe the Dezyne language and tooling; Dezyne is a programming language aimed at software engineers designing large industrial control software. We discuss its underlying two layered and compositional approach that enables reaping the benefits of Formal Methods, hereby strongly supporting guiding principles of software engineering. The core of Dezyne uses the mCRL2 language and model-checker (Jan Friso Groote et al.) to verify the correctness and completeness of all possible execution scenarios. The IDE of Dezyne is based on the Language Server Protocol allowing a smooth integration with e.g., Visual Studio Code, and Emacs, extended with several automatically generated interactive graphical views. We report on the introduction of Dezyne and its predecessor at several large high-tech equipment manufacturers resulting in a decrease of software developing time and a major decrease of reported field defects.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"2020 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114500340","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
Deductive Verification via the Debug Adapter Protocol 通过调试适配器协议进行演绎验证
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.11
G. Ernst, Johannes Blau, Toby C. Murray
{"title":"Deductive Verification via the Debug Adapter Protocol","authors":"G. Ernst, Johannes Blau, Toby C. Murray","doi":"10.4204/EPTCS.338.11","DOIUrl":"https://doi.org/10.4204/EPTCS.338.11","url":null,"abstract":"We propose a conceptual integration of deductive program verification into existing user interfaces for software debugging. This integration is well-represented in the\"Debug Adapter Protocol\", a widely-used and generic technology to integrate debugging of programs into development environments. Commands like step-forward and step-in are backed by steps of a symbolic structural operational semantics, and the different paths through a program are readily represented by multiple running threads of the debug target inside the user interface. Thus, existing IDEs can be leveraged for deductive verification debugging with relatively little effort. We have implemented this scheme for SecC, an auto-active program verifier for C, and discuss its integration into Visual Studio Code.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132167721","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 Logic Theory Pattern for Linearized Control Systems 线性化控制系统的逻辑理论模式
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.7
A. Domenici, C. Bernardeschi
{"title":"A Logic Theory Pattern for Linearized Control Systems","authors":"A. Domenici, C. Bernardeschi","doi":"10.4204/EPTCS.338.7","DOIUrl":"https://doi.org/10.4204/EPTCS.338.7","url":null,"abstract":"This paper describes a procedure that system developers can follow to translate typical mathematical representations of linearized control systems into logic theories. These theories are then used to verify system requirements and find constraints on design parameters, with the support of computer-assisted theorem proving. This method contributes to the integration of formal verification methods into the standard model-driven development processes for control systems. The theories obtained through its application comprise a set of assumptions that the system equations must satisfy, and a translation of the equations into the logic language of the Prototype Verification System theorem-proving environment. The method is illustrated with a standard case study from control theory.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133490439","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
Implicit and Explicit Proof Management in KeYmaera X KeYmaera X中的隐式和显式证明管理
F-IDE@NFM Pub Date : 2021-08-06 DOI: 10.4204/EPTCS.338.8
Stefan Mitsch
{"title":"Implicit and Explicit Proof Management in KeYmaera X","authors":"Stefan Mitsch","doi":"10.4204/EPTCS.338.8","DOIUrl":"https://doi.org/10.4204/EPTCS.338.8","url":null,"abstract":"Hybrid systems theorem proving provides strong correctness guarantees about the interacting discrete and continuous dynamics of cyber-physical systems. The trustworthiness of proofs rests on the soundness of the proof calculus and its correct implementation in a theorem prover. Correctness is easier to achieve with a soundness-critical core that is stripped to the bare minimum, but, as a consequence, proof convenience has to be regained outside the soundness-critical core with proof management techniques. We present modeling and proof management techniques that are built on top of the soundness-critical core of KeYmaera X to enable expanding definitions, parametric proofs, lemmas, and other useful proof techniques in hybrid systems proofs. Our techniques steer the uniform substitution implementation of the differential dynamic logic proof calculus in KeYmaera X to allow users choose when and how in a proof abstract formulas, terms, or programs become expanded to their concrete definitions, and when and how lemmas and sub-proofs are combined to a full proof. The same techniques are exploited in implicit sub-proofs (without making such sub-proofs explicit to the user) to provide proof features, such as temporarily hiding formulas, which are notoriously difficult to get right when implemented in the prover core, but become trustworthy as proof management techniques outside the core. We illustrate our approach with several useful proof techniques and discuss their presentation on the KeYmaera X user interface.","PeriodicalId":430653,"journal":{"name":"F-IDE@NFM","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116273746","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书