Author:
Nadel Alexander,Ryvchin Vadim
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Silva, J.P.M., Sakallah, K.A.: Robust search algorithms for test pattern generation. In: FTCS, pp. 152–161 (1997)
2. Lecture Notes in Computer Science;O. Shtrichman,2001
3. Whittemore, J., Kim, J., Sakallah, K.A.: SATIRE: A new incremental satisfiability engine. In: DAC, pp. 542–545. ACM (2001)
4. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electr. Notes Theor. Comput. Sci. 89(4) (2003)
5. Cabodi, G., Lavagno, L., Murciano, M., Kondratyev, A., Watanabe, Y.: Speeding-up heuristic allocation, scheduling and binding with SAT-based abstraction/refinement techniques. ACM Trans. Design Autom. Electr. Syst. 15(2) (2010)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CaDiCaL 2.0;Lecture Notes in Computer Science;2024
2. FastPass;Proceedings of the 2023 International Symposium on Physical Design;2023-03-26
3. Incremental Property Directed Reachability;Formal Methods and Software Engineering;2023
4. Combining Incomplete Search and Clause Generation: An Application to the Orienteering Problems with Time Windows;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2023
5. Combining BMC and Complementary Approximate Reachability to Accelerate Bug-Finding;Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design;2022-10-30