发布求助
文献互助 智能选刊 最新文献

F-IDE@FM最新文献

筛选
英文 中文
Simulation under Arbitrary Temporal Logic Constraints 任意时序逻辑约束下的仿真
F-IDE@FM Pub Date : 2019-12-23 DOI: 10.4204/EPTCS.310.7
Julien Brunel, D. Chemouil, Alcino Cunha, Nuno Macedo
{"title":"Simulation under Arbitrary Temporal Logic Constraints","authors":"Julien Brunel, D. Chemouil, Alcino Cunha, Nuno Macedo","doi":"10.4204/EPTCS.310.7","DOIUrl":"https://doi.org/10.4204/EPTCS.310.7","url":null,"abstract":"Most model checkers provide a useful simulation mode, that allows users to explore the set of possible behaviours by interactively picking at each state which event to execute next. Traditionally this simulation mode cannot take into consideration additional temporal logic constraints, such as arbitrary fairness restrictions, substantially reducing its usability for debugging the modelled system behaviour. Similarly, when a specification is false, even if all its counter-examples combined also form a set of behaviours, most model checkers only present one of them to the user, providing little or no mechanism to explore alternatives. In this paper, we present a simple on-the-fly verification technique to allow the user to explore the behaviours that satisfy an arbitrary temporal logic specification, with an interactive process akin to simulation. This technique enables a unified interface for simulating the modelled system and exploring its counter-examples. The technique is formalised in the framework of state/event linear temporal logic and a proof of concept was implemented in an event-based variant of the Electrum framework.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128499737","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}
引用次数: 5
Automated Deductive Verification for Ladder Programming 阶梯编程的自动演绎验证
F-IDE@FM Pub Date : 2019-12-23 DOI: 10.4204/EPTCS.310.2
D. Cousineau, David Mentré, Hiroaki Inoue
{"title":"Automated Deductive Verification for Ladder Programming","authors":"D. Cousineau, David Mentré, Hiroaki Inoue","doi":"10.4204/EPTCS.310.2","DOIUrl":"https://doi.org/10.4204/EPTCS.310.2","url":null,"abstract":"Ladder Logics is a programming language standardized in IEC 61131-3 and widely used for programming industrial Programmable Logic Controllers (PLC). A PLC program consists of inputs (whose values are given at runtime by factory sensors), outputs (whose values are given at runtime to factory actuators), and the logical expressions computing output values from input values. Due to the graphical form of Ladder programs, and the amount of inputs and outputs in typical industrial programs, debugging such programs is time-consuming and error-prone. We present, in this paper, a Why3-based tool prototype we have implemented for automating the use of deductive verification in order to provide an easy-to-use and robust debugging tool for Ladder programmers.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130611690","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
An Integrated Development Environment for the Prototype Verification System 原型验证系统的集成开发环境
F-IDE@FM Pub Date : 2019-12-23 DOI: 10.4204/EPTCS.310.5
P. Masci, C. Muñoz
{"title":"An Integrated Development Environment for the Prototype Verification System","authors":"P. Masci, C. Muñoz","doi":"10.4204/EPTCS.310.5","DOIUrl":"https://doi.org/10.4204/EPTCS.310.5","url":null,"abstract":"The steep learning curve of formal technologies is a well-known barrier to the adoption of formal verification tools in industry. This paper presents VSCode-PVS, a modern integrated development environment for the Prototype Verification System (PVS). This new environment integrates the editing and proof management functionalities of PVS in Visual Studio Code, a popular code editor widely used by software developers. VSCode-PVS provides functionalities that developers expect to find in modern verification tools, but are not available in the standard Emacs front-end of PVS, such as auto-completion, point-and-click navigation of definitions, live diagnostics for errors, and literate programming. The main features and architecture of the environment are presented, along with a comparison with other similar tools.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125864541","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}
引用次数: 5
Interfacing Automatic Proof Agents in Atelier B: Introducing "iapa" 对接B工作室自动打样代理:介绍“iapa”
F-IDE@FM Pub Date : 2017-01-30 DOI: 10.4204/EPTCS.240.6
L. Burdy, D. Déharbe, Étienne Prun
{"title":"Interfacing Automatic Proof Agents in Atelier B: Introducing \"iapa\"","authors":"L. Burdy, D. Déharbe, Étienne Prun","doi":"10.4204/EPTCS.240.6","DOIUrl":"https://doi.org/10.4204/EPTCS.240.6","url":null,"abstract":"The application of automatic theorem provers to discharge proof obligations is necessary to apply formal methods in an efficient manner. Tools supporting formal methods, such as Atelier~B, generate proof obligations fully automatically. Consequently, such proof obligations are often cluttered with information that is irrelevant to establish their validity. \u0000We present iapa, an \"Interface to Automatic Proof Agents\", a new tool that is being integrated to Atelier~B, through which the user will access proof obligations, apply operations to simplify these proof obligations, and then dispatch the resulting, simplified, proof obligations to a portfolio of automatic theorem provers.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121875147","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
The KeYmaera X Proof IDE - Concepts on Usability in Hybrid Systems Theorem Proving KeYmaera X证明IDE -混合系统可用性定理证明的概念
F-IDE@FM Pub Date : 2017-01-30 DOI: 10.4204/EPTCS.240.5
Stefan Mitsch, André Platzer
{"title":"The KeYmaera X Proof IDE - Concepts on Usability in Hybrid Systems Theorem Proving","authors":"Stefan Mitsch, André Platzer","doi":"10.4204/EPTCS.240.5","DOIUrl":"https://doi.org/10.4204/EPTCS.240.5","url":null,"abstract":"Hybrid systems verification is quite important for developing correct controllers for physical systems, but is also challenging. Verification engineers, thus, need to be empowered with ways of guiding hybrid systems verification while receiving as much help from automation as possible. Due to undecidability, verification tools need sufficient means for intervening during the verification and need to allow verification engineers to provide system design insights. \u0000This paper presents the design ideas behind the user interface for the hybrid systems theorem prover KeYmaera X. We discuss how they make it easier to prove hybrid systems as well as help learn how to conduct proofs in the first place. Unsurprisingly, the most difficult user interface challenges come from the desire to integrate automation and human guidance. We also share thoughts how the success of such a user interface design could be evaluated and anecdotal observations about it.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130036526","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}
引用次数: 32
User Assistance Characteristics of the USE Model Checking Tool USE模型检查工具的用户辅助特性
F-IDE@FM Pub Date : 2017-01-30 DOI: 10.4204/EPTCS.240.7
Frank Hilken, Martin Gogolla
{"title":"User Assistance Characteristics of the USE Model Checking Tool","authors":"Frank Hilken, Martin Gogolla","doi":"10.4204/EPTCS.240.7","DOIUrl":"https://doi.org/10.4204/EPTCS.240.7","url":null,"abstract":"The Unified Modeling Language (UML) is a widely used general purpose modeling language. Together with the Object Constraint Language (OCL), formal models can be described by defining the structure and behavior with UML and additional OCL constraints. In the development process for formal models, it is important to make sure that these models are (a) correct, i.e. consistent and complete, and (b) testable in the sense that the developer is able to interactively check model properties. The USE tool (UML-based Specification Environment) allows both characteristics to be studied. We demonstrate how the tool supports modelers to analyze, validate and verify UML and OCL models via the use of several graphical means that assist the modeler in interpreting and visualizing formal model descriptions. In particular, we discuss how the so-called USE model validator plugin is integrated into the USE environment in order to allow non domain experts to use it and construct object models that help to verify properties like model consistency.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617431","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}
引用次数: 5
Predicting SMT Solver Performance for Software Verification 用于软件验证的SMT求解器性能预测
F-IDE@FM Pub Date : 2017-01-27 DOI: 10.4204/EPTCS.240.2
Andrew Healy, Rosemary Monahan, James F. Power
{"title":"Predicting SMT Solver Performance for Software Verification","authors":"Andrew Healy, Rosemary Monahan, James F. Power","doi":"10.4204/EPTCS.240.2","DOIUrl":"https://doi.org/10.4204/EPTCS.240.2","url":null,"abstract":"The approach Why3 takes to interfacing with a wide variety of interactive \u0000and automatic theorem provers works well: it is designed to overcome \u0000limitations on what can be proved by a system which relies on a single \u0000tightly-integrated solver. In common with other systems, however, the degree \u0000to which proof obligations (or “goals”) are proved depends as much on \u0000the SMT solver as the properties of the goal itself. In this work, we present a \u0000method to use syntactic analysis to characterise goals and predict the most \u0000appropriate solver via machine-learning techniques. \u0000Combining solvers in this way - a portfolio-solving approach - maximises \u0000the number of goals which can be proved. The driver-based architecture of \u0000Why3 presents a unique opportunity to use a portfolio of SMT solvers for \u0000software verification. The intelligent scheduling of solvers minimises the \u0000time it takes to prove these goals by avoiding solvers which return Timeout \u0000and Unknown responses. We assess the suitability of a number of machinelearning \u0000algorithms for this scheduling task. \u0000The performance of our tool Where4 is evaluated on a dataset of proof \u0000obligations. We compare Where4 to a range of SMT solvers and theoretical \u0000scheduling strategies. We find that Where4 can out-perform individual \u0000solvers by proving a greater number of goals in a shorter average time. \u0000Furthermore, Where4 can integrate into a Why3 user’s normal workflow - \u0000simplifying and automating the non-expert use of SMT solvers for software \u0000verification.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125752142","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}
引用次数: 13
Extending a User Interface Prototyping Tool with Automatic MISRA C Code Generation 使用自动MISRA C代码生成扩展用户界面原型工具
F-IDE@FM Pub Date : 2017-01-27 DOI: 10.4204/EPTCS.240.4
Gioacchino Mauro, H. Thimbleby, A. Domenici, C. Bernardeschi
{"title":"Extending a User Interface Prototyping Tool with Automatic MISRA C Code Generation","authors":"Gioacchino Mauro, H. Thimbleby, A. Domenici, C. Bernardeschi","doi":"10.4204/EPTCS.240.4","DOIUrl":"https://doi.org/10.4204/EPTCS.240.4","url":null,"abstract":"We are concerned with systems, particularly safety-critical systems, that involve interaction between users and devices, such as the user interface of medical devices. We therefore developed a MISRA C code generator for formal models expressed in the PVSio-web prototyping toolkit. PVSio-web allows developers to rapidly generate realistic interactive prototypes for verifying usability and safety requirements in human-machine interfaces. The visual appearance of the prototypes is based on a picture of a physical device, and the behaviour of the prototype is defined by an executable formal model. Our approach transforms the PVSio-web prototyping tool into a model-based engineering toolkit that, starting from a formally verified user interface design model, will produce MISRA C code that can be compiled and linked into a final product. An initial validation of our tool is presented for the data entry system of an actual medical device.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"429 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122868289","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}
引用次数: 15
Evaluation of Formal IDEs for Human-Machine Interface Design and Analysis: The Case of CIRCUS and PVSio-web 人机界面设计与分析的形式化ide的评价:以CIRCUS和PVSio-web为例
F-IDE@FM Pub Date : 2017-01-27 DOI: 10.4204/EPTCS.240.1
Camille Fayollas, C. Martinie, Philippe A. Palanque, P. Masci, M. Harrison, J. C. Campos, S. Silva
{"title":"Evaluation of Formal IDEs for Human-Machine Interface Design and Analysis: The Case of CIRCUS and PVSio-web","authors":"Camille Fayollas, C. Martinie, Philippe A. Palanque, P. Masci, M. Harrison, J. C. Campos, S. Silva","doi":"10.4204/EPTCS.240.1","DOIUrl":"https://doi.org/10.4204/EPTCS.240.1","url":null,"abstract":"Critical human-machine interfaces are present in many systems including avionics systems and medical devices. Use error is a concern in these systems both in terms of hardware panels and input devices, and the software that drives the interfaces. Guaranteeing safe usability, in terms of buttons, knobs and displays is now a key element in the overall safety of the system. New integrated development environments (IDEs) based on formal methods technologies have been developed by the research community to support the design and analysis of high-confidence human-machine interfaces. To date, little work has focused on the comparison of these particular types of formal IDEs. This paper compares and evaluates two state-of-the-art toolkits: CIRCUS, a model-based development and analysis tool based on Petri net extensions, and PVSio-web, a prototyping toolkit based on the PVS theorem proving system.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127952023","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}
引用次数: 8
Industrial Experience Report on the Formal Specification of a Packet Filtering Language Using the K Framework 使用K框架的包过滤语言形式化规范的行业经验报告
F-IDE@FM Pub Date : 2016-11-08 DOI: 10.4204/EPTCS.240.3
Gurvan Le Guernic, B. Combemale, J. Galindo
{"title":"Industrial Experience Report on the Formal Specification of a Packet Filtering Language Using the K Framework","authors":"Gurvan Le Guernic, B. Combemale, J. Galindo","doi":"10.4204/EPTCS.240.3","DOIUrl":"https://doi.org/10.4204/EPTCS.240.3","url":null,"abstract":"Many project-specific languages, including in particular filtering languages, are defined using non-formal specifications written in natural languages. This leads to ambiguities and errors in the specification of those languages. This paper reports on an industrial experiment on using a tool-supported language specification framework (K) for the formal specification of the syntax and semantics of a filtering language having a complexity similar to those of real-life projects. This experimentation aims at estimating, in a specific industrial setting, the difficulty and benefits of formally specifying a packet filtering language using a tool-supported formal approach.","PeriodicalId":339743,"journal":{"name":"F-IDE@FM","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114745265","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
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学术文献互助群
群 号：481959085
Book学术官方微信