From Refutation to Verification
نویسنده
چکیده
Model checking has won some industrial acceptance in debugging designs. Theorem proving and formal verification are less popular. An approach built around automated abstractions could integrate theorem proving with model checking in an acceptable way and provide a bridge between refutation and verification.
منابع مشابه
Abstraction for Verification and Refutation in Model Checking
ION FOR VERIFICATION AND REFUTATION IN MODEL CHECKING
متن کاملSAT Techniques and Knowledge Base Verification
Abstrract:For many application domains the best way to produce intelligent behavior is to encode knowledge about this domain to knowledge base. Verification of KB is one of the crucial issues in developing reliable knowledgebased systems. SAT techniques as resolution and DPLL can be used for verifying knowledge bases. We give a transformation of a DPLL refutation to a resolution refutation of a...
متن کاملVerification and Refutation of Probabilistic Specifications via Games
We develop an abstraction-based framework to check probabilistic specifications of Markov Decision Processes (MDPs) using the stochastic two-player game abstractions (i.e. “games”) developed by Kwiatkowska et al. as a foundation. We define an abstraction preorder for these game abstractions which enables us to identify many new game abstractions for each MDP — ranging from compact and imprecise...
متن کاملThe Importance of Non-theorems and Counterexamples in Program Verification
We argue that the detection and refutation of non-theorems, and the discovery of appropriate counterexamples, is of vital importance to the Grand Challenge of a Program Verifier.
متن کاملFirst-Order Logic Theorem Proving via Counterexample-Guided Abstraction Refinement
Counterexample-guided abstraction refinement is a well-established technique in verification. In this paper we instantiate the idea for firstorder logic theorem proving. Given a clause set N we propose its abstraction into a clause set N ′ belonging to a decidable first-order fragment. The abstraction preserves satisfiability: if N ′ is satisfiable, so is N . A refutation in N ′ can then either...
متن کامل