Deductive vs. model-theoretic approaches to formal verification
The well-known duality between proof- and model-theoretic approaches in classic logic assumes even greater significance in the application of these approaches for formal verification of software and hardware designs.
In this talk, we will survey the main model-theoretic and deductive approaches to formal verification, as illustrated by enumerative and symbolic model checking techniques and deductive verification systems such as STeP, PVS, HOL, etc. We will motivate the current feeling that only the combination of these dual approaches will enable us to formally verify really complex and large systems. Some proposed ideas about how model-checking and deduction can be effectively combined in a mutually beneficial way will be described, and illustrated on simple case studies.