A Theorem Proving Approach to Formal Verification of a Cognitive Agent

2021 ◽  
pp. 1-11
Author(s):  
Alexander Birch Jensen
Keyword(s):  
Formal Verification ◽  
Theorem Proving ◽  
Cognitive Agent

Formal Verification Methods

2015 ◽  
pp. 10-20
Keyword(s):  
Model Checking ◽  
Formal Verification ◽  
Formal Methods ◽  
Theorem Proving ◽  
Critical Systems ◽  
Verification Methods

This chapter provides a brief introduction to the domain of formal methods (Boca, Bowen, & Siddiqi, 2009) and the most commonly used verification methods (i.e., theorem proving [Harrison, 2009] and model checking [Baier & Katoen, 2008]). Due to their inherent precision, formal verification methods are increasingly being used in modeling and verifying safety and financial-critical systems these days.

scholarly journals A Methodology for the Formal Verification of Dynamic Fault Trees Using HOL Theorem Proving

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 136176-136192 ◽  
Author(s):  
Yassmeen Elderhalli ◽  
Osman Hasan ◽  
Sofiene Tahar
Keyword(s):  
Formal Verification ◽  
Theorem Proving ◽  
Fault Trees

scholarly journals Social processes, program verification and all that

2009 ◽  
Vol 19 (5) ◽  
pp. 877-896 ◽  
Author(s):  
ANDREA ASPERTI ◽  
HERMAN GEUVERS ◽  
RAJA NATARAJAN
Keyword(s):  
Formal Verification ◽  
Program Development ◽  
Theorem Proving ◽  
Scientific Knowledge ◽  
Program Verification ◽  
Interactive Theorem Proving ◽  
Social Processes ◽  
Social Nature ◽  
The Social

In a controversial paper (De Millo et al. 1979) at the end of the 1970's, R. A. De Millo, R. J. Lipton and A. J. Perlis argued against formal verifications of programs, mostly motivating their position by an analogy with proofs in mathematics, and, in particular, with the impracticality of a strictly formalist approach to this discipline. The recent, impressive achievements in the field of interactive theorem proving provide an interesting ground for a critical revisiting of their theses. We believe that the social nature of proof and program development is uncontroversial and ineluctable, but formal verification is not antithetical to it. Formal verification should strive not only to cope with, but to ease and enhance the collaborative, organic nature of this process, eventually helping us to master the growing complexity of scientific knowledge.

Digital Hardware Design Formal Verification Based on HOL System

2014 ◽  
Vol 716-717 ◽  
pp. 1382-1386
Author(s):  
Da Xiao ◽  
Yue Fei Zhu ◽  
Sheng Li Liu ◽  
Dong Xia Wang ◽  
You Qiang Luo
Keyword(s):  
Formal Verification ◽  
Theorem Proving ◽  
Hardware Design ◽  
Detection Methods ◽  
Hardware Trojan ◽  
Symbol Table ◽  
Hardware Trojan Detection ◽  
Trojan Detection ◽  
Digital Hardware

This article selects HOL theorem proving systems for hardware Trojan detection and gives the symbol and meaning of theorem proving systems, and then introduces the symbol table, item and the meaning of HOL theorem proving systems. In order to solve the theorem proving the application of the system in hardware Trojan detection requirements, this article analyses basic hardware Trojan detection methods which applies for theorem proving systems and introduces the implementation methods and process of theorem proving about hardware Trojan detection.

Sign in / Sign up

Export Citation Format

Share Document