作者: Felice Balarin , Alberto L. Sangiovanni-Vincentelli
关键词: Heuristic 、 Abstraction (linguistics) 、 Theoretical computer science 、 Containment (computer programming) 、 Boolean function 、 Computation 、 Formal verification 、 Computer science 、 Series (mathematics) 、 Refinement
摘要: We propose an iterative approach to formal verification by language containment. start with some initial abstraction and then iteratively refine it, guided the failure report from tool. show that procedure will terminate, a series of heuristic aimed at reducing size BDD's used in computation, formulate several open problems could improve efficiency procedure. Finally, we present discuss experimental results.