Least Fixpoint MBM: Improved Technique for Approximate Reachability
暂无分享,去创建一个
[1] Enrico Macii,et al. Automatic state space decomposition for approximate FSM traversal based on circuit analysis , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] Robert K. Brayton,et al. Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[3] Alan J. Hu,et al. Approximate reachability with BDDs using overlapping projections , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).
[4] Enrico Macii,et al. Algorithms for approximate FSM traversal based on state space decomposition , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[5] A. Richard Newton,et al. Don't care minimization of multi-level sequential logic networks , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[6] G. Hachtel,et al. Approximate Reachability Don't Cares for CTL model checking , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).
[7] Fabio Somenzi,et al. Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] Tiziano Villa,et al. VIS: A System for Verification and Synthesis , 1996, CAV.