Shaoke Cui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shaoke Cui has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Chanjuan Liu
Dalian University of Technology, Dalian, China
2 shared publications - Chuan Luo
Beihang University, Beijing, China
2 shared publications - Chunming Hu
Beihang University, Beijing, China
2 shared publications - Wei Wu
Central South University, Changsha, China
2 shared publications - Chenyao Suo
Tianjin University, Tianjin, China
1 shared publication - Jiabao Lin
Huawei Taylor Lab
1 shared publication
Latest Publications
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3385-3396
CombCT: Compiler Testing via Combinatorial Testing
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3385-3396
Open AccessCombCT: Compiler Testing via Combinatorial Testing
- 9 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (4) , 1841-1851
CirOPT : Toward Effective Combinational Equivalence Checking via Compiler Optimization
Combinational equivalence checking (CEC) is essential for verifying the correctness of circuit designs. With the growing complexity of circuits, effective verification techniques have become increasingly critical. Recently, a conjunctive normal form (CNF)-based approach, converting circuits to CNF for Boolean satisfiability (SAT) solvers, has shown competitive performance compared to state-of-the-art hybrid SAT sweeping approaches. The capability of this CNF-based approach depends on effective CNF conversion. This work presents CirOPT, which is the first CNF conversion method using compiler optimization to equivalently simplify circuits. Extensive experiments are conducted on a broad range of real-world benchmarks, which are far more than the number of benchmarks typically used in empirical studies. The results reveal that, when paired with the state-of-the-art CNF SAT solver Kissat, CirOPT considerably outperforms existing approaches in CEC.
- 9 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (4) , 1841-1851
CirOPT : Toward Effective Combinational Equivalence Checking via Compiler Optimization
Combinational equivalence checking (CEC) is essential for verifying the correctness of circuit designs. With the growing complexity of circuits, effective verification techniques have become increasingly critical. Recently, a conjunctive normal form (CNF)-based approach, converting circuits to CNF for Boolean satisfiability (SAT) solvers, has shown competitive performance compared to state-of-the-art hybrid SAT sweeping approaches. The capability of this CNF-based approach depends on effective CNF conversion. This work presents CirOPT, which is the first CNF conversion method using compiler optimization to equivalently simplify circuits. Extensive experiments are conducted on a broad range of real-world benchmarks, which are far more than the number of benchmarks typically used in empirical studies. The results reveal that, when paired with the state-of-the-art CNF SAT solver Kissat, CirOPT considerably outperforms existing approaches in CEC.