A Fast and Practical Algorithm for Absolute Dominators Searching
暂无分享,去创建一个
[1] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[2] H. Fujiwara,et al. ON THE ACCELERATION OF TEST GENERATION ALGORlTHMS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..
[3] Jürgen Schlöffel,et al. Computation and Application of Absolute Dominators in Industrial Designs , 2007, 12th IEEE European Test Symposium (ETS'07).
[4] M. Ray Mercer,et al. A Topological Search Algorithm for ATPG , 1987, 24th ACM/IEEE Design Automation Conference.
[5] Shih-Chieh Chang,et al. Perturb and simplify: multilevel Boolean network optimizer , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Hideo Fujiwara,et al. On the Acceleration of Test Generation Algorithms , 1983, IEEE Transactions on Computers.
[7] Edward S. Lowry,et al. Object code optimization , 1969, CACM.
[8] Robert E. Tarjan,et al. Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..
[9] Dov Harel,et al. A linear algorithm for finding dominators in flow graphs and related problems , 1985, STOC '85.
[10] José C. Monteiro,et al. Switching activity estimation using limited depth reconvergent path analysis , 1997, Proceedings of 1997 International Symposium on Low Power Electronics and Design.