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 条
  • [41] Unsound theorem proving
    Lynch, C
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 473 - 487
  • [42] Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving
    van Gastel, Bernard
    Lensink, Leonard
    Sinetsers, Sjaak
    van Eekelen, Marko
    FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS, 2009, 5596 : 85 - 102
  • [43] Development and verification of high confidence embedded software by combining model checking and theorem proving
    Xiao, Jian-Yu
    Zhang, De-Yun
    Chen, Hai-Quan
    Dong, Hao
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2005, 35 (05): : 531 - 536
  • [44] Verification of B+ Trees: An Experiment Combining Shape Analysis and Interactive Theorem Proving
    Ernst, Gidon
    Schellhorn, Gerhard
    Reif, Wolfgang
    SOFTWARE ENGINEERING AND FORMAL METHODS, 2011, 7041 : 188 - 203
  • [45] An executable semantics of object-oriented models for simulation and theorem proving
    Yatake, Kenro
    Katayama, Takuya
    MSVVEIS 2008: MODELLING, SIMULATION, VERIFICATION AND VALIDATION OF ENTERPRISE INFORMATION SYSTEMS, 2008, : 71 - 80
  • [46] Theorem-Proving Analysis of Digital Control Logic Interacting with Continuous Dynamics
    Hulette, Geoffrey C.
    Armstrong, Robert C.
    Mayo, Jackson R.
    Ruthruff, Joseph R.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2015, 317 : 71 - 83
  • [47] Analysis of the effects of theorem proving with mathematical models on the proving skills of the students studying in the department of teaching elementary mathematics
    Ciltas, Alper
    Yilmaz, Kubra
    2ND INTERNATIONAL CONFERENCE ON LIFELONG LEARNING AND LEADERSHIP FOR ALL (ICLEL 2016), 2016, : 798 - 810
  • [48] Proving Termination by Dependency Pairs and Inductive Theorem Proving
    Carsten Fuhs
    Jürgen Giesl
    Michael Parting
    Peter Schneider-Kamp
    Stephan Swiderski
    Journal of Automated Reasoning, 2011, 47 : 133 - 160
  • [49] Proving Termination by Dependency Pairs and Inductive Theorem Proving
    Fuhs, Carsten
    Giesl, Juergen
    Parting, Michael
    Schneider-Kamp, Peter
    Swiderski, Stephan
    JOURNAL OF AUTOMATED REASONING, 2011, 47 (02) : 133 - 160
  • [50] MUFFIN - A USER INTERFACE DESIGN EXPERIMENT FOR A THEOREM-PROVING ASSISTANT
    JONES, CB
    MOORE, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 328 : 337 - 375