Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
High-density reachability analysis
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Counterexample-guided choice of projections in approximate symbolic model checking
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
RuleBase: Model Checking at IBM
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Efficient Verification with BDDs using Implicitly Conjoined Invariants
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Functional formal verification on designs of pSeries microprocessors and communication subsystems
IBM Journal of Research and Development - POWER5 and packaging
| Hi-index | 0.00 |
We describe a framework for finding counter-examples in a transition system. This framework constructs an on-the-fly heuristic for choosing states that are good candidates for exploration, and refines this heuristic when it realizes it made mistakes. The refinements are always relative to the mistakes made, and therefore the amount of overhead needed for constructing the heuristic is minimized. This heuristic is used for partial exploration of the state space, directed toward reaching a user specified set of states. Empirical results show this method to be a strong competitor to the standard BFS based methods.