Combining theorem proving and continuous models in synchronous design

被引:0
|
作者
Nadjm-Tehrani, S [1 ]
Åkerlund, O
机构
[1] Linkoping Univ, Dept Comp & Informat Sci, S-58183 Linkoping, Sweden
[2] Saab AB, S-58188 Linkoping, Sweden
来源
FM'99-FORMAL METHODS, VOL II | 1999年 / 1709卷
关键词
control system; synchronous languages; theorem proving; hybrid system; proof methodology;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Support for system specification in terms of modelling and simulation environments has become a common practice in safety-critical applications. Also, a current trend is the automatic code-generation, and integration with formal methods tools in terms of translators from a high level design - often using common intermediate languages. What is missing from current formal methods tools is a well-founded integration of models for different parts of a system, being software/hardware or control-intensive/data-intensive. By hardware we mean here the full range of domains in engineering systems including mechanics, hydraulics, electronics. Thus, there is a methodological gap for proving system properties from semantically well-defined descriptions of the parts. We report on the progress achieved with the European SYRF project with regard to verification of integrated analog/discrete systems. The project pursues the development of new theories, application to case studies, and tool development in parallel. We use a ventilation control system, a case study provided by Saab Aerospace, to illustrate the work in progress on how hardware and software models used by engineers can be derived, composed and analysed for satisfaction of safety and timeliness properties.
引用
收藏
页码:1384 / 1399
页数:16
相关论文
共 50 条
  • [21] Ω-ANTS -: An open approach at combining interactive and automated theorem proving
    Benzmüller, C
    Sorge, V
    SYMBOLIC COMPUTATION AND AUTOMATED REASONING, 2001, : 81 - 97
  • [22] Theorem proving system for logic design verification
    Yamada, Naoyuki
    Kobayashi, Yasuhiro
    Kiguchi, Takashi
    Journal of information processing, 1988, 11 (02) : 92 - 104
  • [23] Feasibility Analysis of the EFSM Transition Path Combining Slicing with Theorem Proving
    Lu, Gongzheng
    Miao, Huaikou
    2013 INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE), 2013, : 153 - 156
  • [24] A role for theorem proving in multi-processor design
    Camilleri, AJ
    COMPUTER AIDED VERIFICATION, 1998, 1427 : 45 - 48
  • [25] A reflective functional language for hardware design and theorem proving
    Grundy, J
    Melham, T
    O'Leary, J
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2006, 16 : 157 - 196
  • [26] Verifying Haskell programs by combining testing, model checking and interactive theorem proving
    Dybjer, P
    Qiao, HY
    Takeyama, M
    INFORMATION AND SOFTWARE TECHNOLOGY, 2004, 46 (15) : 1011 - 1025
  • [27] LeanDojo: Theorem Proving with Retrieval-Augmented Language Models
    Yang, Kaiyu
    Swope, Aidan M.
    Gu, Alex
    Chalamala, Rahul
    Song, Peiyang
    Yu, Shixing
    Godil, Saad
    Prenger, Ryan
    Anandkumar, Anima
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [28] Combining Clifford algebraic computing and term-rewriting for geometric theorem proving
    Fevre, Stephane
    Wang, Dongming
    Fundamenta Informaticae, 1999, 39 (1-2): : 85 - 104
  • [29] THEOREM-PROVING AS AN INDUSTRIAL TOOL FOR SYSTEM LEVEL DESIGN
    BAINBRIDGE, S
    CAMILLERI, A
    FLEMING, R
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 10 : 253 - 274
  • [30] Probabilistic Theorem Proving
    Gogate, Vibhav
    Domingos, Pedro
    COMMUNICATIONS OF THE ACM, 2016, 59 (07) : 107 - 115