| A. Pardo. Automatic Abstraction Techniques for Formal Verification of Digital Systems. PhD thesis, University of Colorado at Boulder, Dept. of Computer Science, August 1997. |
....initial abstraction and in the refinement process. Variable abstraction is also performed in a similar manner. Therefore, our abstraction refinement methodology relates to their technique in essentially the same way as it relates to the classical localization reduction. A number of other papers [16, 18, 19] have proposed abstraction refinement techniques for CTL model checking. However, these papers do not use counterexamples to refine the abstraction. We believe that the methods described in these papers are orthogonal to our technique and may even be combined with ours in order to achieve better ....
A. Pardo. Automatic Abstraction Techniques for Formal Verification of Digital Systems. PhD thesis, University of Colorado at Boulder, Dept. of Computer Science, August 1997.
....abstraction as well as in the refinement process. Variable abstraction is also performed in a similar manner. Therefore, our abstraction refinement methodology relates to their technique in essentially the same way as it relates to the classical localization reduction. A number of other papers [70, 86, 87] have proposed abstractionrefinement techniques for CTL model checking. These techniques use the 12 BDD size as abstraction criterion. When the BDD size exceed a certain limit, the abstraction is applied. Govindaraju and Dill [52] tries to identify the first spurious state in an abstract ....
A. Pardo. Automatic Abstraction Techniques for Formal Verification of Digital Systems. PhD thesis, University of Colorado at Boulder, Dept. of Computer Science, August 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC