作者: Edmund Clarke , Anubhav Gupta , James Kukula , Ofer Strichman
关键词: Model checking 、 Abstraction (linguistics) 、 Machine learning 、 Constraint satisfaction 、 Computer science 、 Artificial intelligence 、 Boolean satisfiability problem 、 Integer programming 、 Counterexample 、 Propositional calculus 、 Linear programming
摘要: We describe new techniques for model checking in the counterexample guided abstraction/refinement framework. The abstraction phase 'hides' logic of various variables, hence considering them as inputs. This type may lead to 'spurious' counterexamples, i.e. traces that can not be simulated on original (concrete) machine. check whether a is real or spurious with SAT checker. then use combination Integer Linear Programming (ILP) and machine learning refining based counterexample. process repeated until either found property verified.We have implemented these top checker NuSMV solver Chaff. Experimental results prove viability techniques.