Integrating model checking and theorem proving in a reflective functional language

被引:0
|
作者
Melham, T [1 ]
机构
[1] Univ Oxford, Comp Lab, Oxford OX1 3QD, England
来源
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Forte is a formal verification system developed by Intel's Strategic CAD Labs for applications in hardware design and verification. Forte integrates model checking and theorem proving within a functional programming language, which both serves as an extensible specification language and allows the system to be scripted and customized. The latest version of this language, called reFL(ect), has quotation and antiquotation constructs that build and decompose expressions in the language itself. This provides combination of pattern-matching and reflection features tailored especially for the Forte approach to verification. This short paper is an abstract of an invited presentation given at the International Conference on Integrated Formal Methods in 2004, in which the philosophy and architecture of the Forte system are described and an account is given of the role of reFLect in the system.
引用
收藏
页码:36 / 39
页数:4
相关论文
共 50 条
  • [41] A Theorem Proving Approach to Programming Language Semantics
    Roy, Subhajit
    2023 IEEE/ACM 45TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING-SOFTWARE ENGINEERING EDUCATION AND TRAINING, ICSE-SEET, 2023, : 153 - 165
  • [42] Proving more properties with bounded model checking
    Awedh, M
    Somenzi, F
    COMPUTER AIDED VERIFICATION, 2004, 3114 : 96 - 108
  • [43] A Note on the Need for Radical Membership Checking in Mechanical Theorem Proving in Geometry
    Roanes-Lozano, Eugenio
    Roanes-Macias, Eugenio
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2013, 2013, 8136 : 288 - 300
  • [44] The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
    Mintchev, S
    Lester, D
    HIGHER-ORDER ALGEBRA, LOGIC, AND TERM REWRITING, 1996, 1074 : 144 - 162
  • [45] Integrating equational reasoning into instantiation-based theorem proving
    Ganzinger, H
    Korovin, K
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 71 - 84
  • [46] Using the VIRT programming language for automatic theorem proving
    A. I. Baranovskii
    Cybernetics and Systems Analysis, 1999, 35 : 918 - 929
  • [47] Using the VIRT programming language for automatic theorem proving
    Baranovskii, AI
    CYBERNETICS AND SYSTEMS ANALYSIS, 1999, 35 (06) : 918 - 929
  • [48] Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving
    van Gastel, Bernard
    Lensink, Leonard
    Smetsers, Sjaak
    van Eekelen, Marko
    SCIENCE OF COMPUTER PROGRAMMING, 2011, 76 (02) : 82 - 99
  • [49] Model checking for infinite state systems using data abstraction, assumption commitment style reasoning and theorem proving
    Dingel, J
    Filkorn, T
    COMPUTER AIDED VERIFICATION, 1995, 939 : 54 - 69
  • [50] Model Checking for Proving and Improving Fault Tolerance of Satellites
    Kiesbye, Jonis
    Grover, Kush
    Kretinsky, Jan
    2023 IEEE AEROSPACE CONFERENCE, 2023,