Formal Specification of Medical Systems by Proof-Based Refinement

被引:22
|
作者
Mery, Dominique [1 ]
Singh, Neeraj Kumar [1 ]
机构
[1] Univ Nancy 1, LORIA, F-54506 Vandoeuvre Les Nancy, France
关键词
Design; Verification; Modeling; event-driven approach; proof-based development; refinement; verification and validation; SOFTWARE; CODESIGN;
D O I
10.1145/2406336.2406351
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Formal methods have emerged as an alternative approach to ensuring quality and correctness of highly critical systems, overcoming limitations of traditional validation techniques such as simulation and testing. We propose a refinement-based methodology for complex medical systems design, which possesses all the required key features. A refinement-based combined approach of formal verification, model validation using a model-checker and refinement chart is proposed in this methodology for designing a high-confidence medical device. Furthermore, we show the effectiveness of this methodology for the design of a cardiac pacemaker system.
引用
收藏
页数:25
相关论文
共 50 条
  • [21] A PROOF-BASED FRAMEWORK FOR SEVERAL TYPES OF GROUNDING
    Poggiolesi, Francesca
    [J]. LOGIQUE ET ANALYSE, 2020, (252) : 387 - 414
  • [22] Formal Specification, Refinement, and Implementation of Path Planning
    Rabiah, Eman
    Belkhouche, Boumediene
    [J]. PROCEEDINGS OF THE 2016 12TH INTERNATIONAL CONFERENCE ON INNOVATIONS IN INFORMATION TECHNOLOGY (IIT), 2016, : 1 - 6
  • [23] Formal specification and refinement for an interactive Web example
    Van Coppenhagen, Ingrid
    Dwolatzky, Barry
    [J]. WEBIST - Int. Conf. Web Inf. Syst. Technol., Proc., (89-96):
  • [24] Formal specification and refinement for an interactive Web example
    van Coppenhagen, Ingrid
    Dwolatzky, Barry
    [J]. WEBIST 2006: PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS AND TECHNOLOGIES: INTERNET TECHNOLOGY / WEB INTERFACE AND APPLICATIONS, 2006, : 89 - +
  • [25] Quantitative Safety: Linking Proof-Based Verification with Model Checking for Probabilistic Systems
    Ndukwu, Ukachukwu
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (13): : 27 - 39
  • [26] A hybrid of counterexample-based and proof-based abstraction
    Amla, N
    McMillan, KL
    [J]. FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2004, 3312 : 260 - 274
  • [27] Proof-Based Synthesis of Sorting Algorithms for Trees
    Dramnesc, Isabela
    Jebelean, Tudor
    Stratulat, Sorin
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 562 - 575
  • [28] Formal Modeling of Cyber-Physical Systems: Lessons Learn from Refinement and Proof Based Methods
    Ameur, Yamine Ait
    [J]. ADVANCES IN COMPUTING SYSTEMS AND APPLICATIONS, 2019, 50 : 3 - 3
  • [29] Proof-based approach to mobile code safety
    Tsukada, Yasuyuki
    [J]. NTT R and D, 2002, 51 (10): : 765 - 771
  • [30] A hybrid of counterexample-based and proof-based abstraction
    Amla, N
    McMillan, KL
    [J]. FORMAL METHODS IN COMPUTER-AIDED DESIGN, 2004, 3312 : 260 - 274