Dunuen: A User-Friendly Formal Verification Tool

被引:2
|
作者
Capobianco, Giovanni [1 ]
Di Giacomo, Umberto [1 ]
Mercaldo, Francesco [1 ,2 ]
Santone, Antonella [1 ]
机构
[1] Univ Molise, Dept Biosci & Terr, Pesche, IS, Italy
[2] Natl Res Council Italy CNR, Inst Informat & Telemat, Pisa, Italy
关键词
Formal verification; Automatic Tool; Model Checking;
D O I
10.1016/j.procs.2019.09.313
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Formal verification allows checking the design and the behaviour of a system. One of the main limitations to the adoption of formal verification techniques is the process of model creation using specification languages. For this reason a tool supporting this activity is necessary. Actually, there are several tools allowing analysts to verify models expressed into specification languages. These tools provide support for automatically checking whether a system satisfies a property. However, to use such tools it is important to deeply know a precise notation for defining a system, i.e., the Calculus of Communicating Systems. Since systems are often expressed as time-series, to overcome this problem, we provide an user-friendly tool able to automatically generate a system model starting from the CSV - Comma-Separated Values format (the most widespread format considered to release dataset). In this way we hide the details about the model construction form the analyst, which can only focus immediately on the properties to verify. We introduce Dunuen, a tool allowing the user to firstly perform a kind of pre-processing operation starting from a CSV file, as discretization or removing attributes; subsequently it automatically creates a formal model from the pre-processed CSV file and, by invoking the model checker we embedded in Dunuen, it finally verifies whether the generated model satisfies a property expressed in temporal logic through a graphic interface, proposing formal methods as an alternative to machine learning for classification tasks. (C) 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/) Peer-review under responsibility of KES International.
引用
收藏
页码:1431 / 1438
页数:8
相关论文
共 50 条
  • [1] User-friendly verification
    Hsiung, PA
    Wang, F
    [J]. FORMAL METHODS FOR PROTOCOL ENGINEERING AND DISTRIBUTED SYSTEMS, 1999, 28 : 279 - 294
  • [2] Efficient and user-friendly verification
    Wang, F
    Hsiung, PA
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (01) : 61 - 83
  • [3] (User-friendly) formal requirements verification in the context of ISO26262
    Makartetskiy, Denis
    Marchetto, Guido
    Sisto, Riccardo
    Valenza, Fulvio
    Virgilio, Matteo
    Leri, Denise
    Denti, Paolo
    Finizio, Roberto
    [J]. ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH, 2020, 23 (03): : 494 - 506
  • [4] Scratch-Based User-Friendly Requirements Definition for Formal Verification of Control Systems
    Grobelna, Iwona
    [J]. INFORMATICS IN EDUCATION, 2020, 19 (02): : 223 - 238
  • [5] MASE: A user-friendly performance tool
    Tan, GY
    Hura, GS
    [J]. MICROELECTRONICS AND RELIABILITY, 1996, 36 (06): : 821 - 841
  • [6] A user-friendly tool for image analysis
    Nair H.
    [J]. Pattern Recognition and Image Analysis, 2006, 16 (2) : 234 - 238
  • [7] Towards a user-friendly design and verification environment
    Cerone, A
    [J]. 27TH ANNUAL NASA GODDARD/IEEE SOFTWARE ENGINEERING WORKSHOP - PROCEEDINGS, 2003, : 199 - 208
  • [8] A User-friendly Interface for a Lightweight Verification System
    Kfoury, Assaf y
    Kfoury, Assaf
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2012, 285 : 29 - 41
  • [9] ABCD: A User-Friendly Language for Formal Modelling and Analysis
    Pommereau, Franck
    [J]. APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2016, 2016, 9698 : 176 - 195
  • [10] Formal aspects of the user-friendly nuclear cardiology report
    Gonzalez, P
    Canessa, J
    Massardo, T
    [J]. JOURNAL OF NUCLEAR CARDIOLOGY, 1998, 5 (03) : 365 - 366