Author:
Chauhan P.,Clarke E.,Jha S.,Kukula J.,Veith H.,Wang D.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. J. R. Burch, E. M. Clarke, and D. E. Long. Representing circuits more efficiently in Symbolic Model Checking. In 28th ACM/IEEE Design Automation Conference, 1991.
2. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic Model Checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proceedings of the International Conference on Very Large Scale Int egration, Edinburgh, Scotland, August 1991.
3. C. J. P. B’elisle. Convergence theorems for a class of simulated annealing algorithms. Journal of Applied Probability, 29:885–892, 1992.
4. T. N. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Information Processing Letters, 42:153–159, 1992.
5. Lect Notes Comput Sci;A. Cimatti,1999
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Partial Quantifier Elimination and Property Generation;Computer Aided Verification;2023
2. Quantifier elimination by dependency sequents;Formal Methods in System Design;2014-08-14
3. Partial Quantifier Elimination;Hardware and Software: Verification and Testing;2014
4. Digital System Verification: A Combined Formal Methods and Simulation Framework;Synthesis Lectures on Digital Circuits and Systems;2010-01
5. Efficient guided symbolic reachability using reachability expressions;International Journal on Software Tools for Technology Transfer;2008-01-08