This work is supported by the National Key Research and Development Program of China under Grant No.2023YFB4503400;the National Natural Science Foundation of China under Grant Nos.62322205,62072195,and 61825202.
Data race is one of the most important concurrent anomalies in multi-threaded programs.Emerging con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by a...
funded by the National Natural Science Foundation of China(Grant Nos.61862051,62241206 and 62062001);the Science and Technology Plan Project of Guizhou Province(Grant No.Qiankehe Foundation-ZK[2022]General 550).
1Introduction The satisfiability(SAT)problem has been considered the"seed"of other NP-complete problems.The regular partial exact(k,d)-SAT problem is an important extension of the SAT problem.For any(k,d)-CNF formula ...
supported by the National Natural Science Foundation of China(Grant Nos.62076108,61972360,and 61872159).
Model-based diagnosis(MBD)with multiple observations shows its significance in identifying fault location.The existing approaches for MBD with multiple observations use observations which is inconsistent with the pred...
This work is supported by Ministry of Higher Education(MOHE)through Fundamental Research Grant Scheme(FRGS)(FRGS/1/2020/STG06/UTHM/03/7).
Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algor...
supported in part by the National Natural Science Foundation of China under Grant No.61871242;in part by the State Key Laboratory of ASIC(Application Specific Integrated Circuit)&System of China under Grant No.2021KF008.
Boolean satisfiability (SAT) is widely used as a solver engine in electronic design automation (EDA). Typically, SAT is used to determine whether one or more groups of variables can be combined to form a true formula....
supported by the National Natural Science Foundation of China(61772516,61902030,61772517).
Differential cryptanalysis is one of the most critical analysis methods to evaluate the security strength of cryptographic algorithms.This paper first applies the genetic algorithm to search for differential character...
Universiti Sains Malaysia for Short Term Grant with Grant Number 304/PMATHS/6315390.
The effectiveness of the logic mining approach is strongly correlated to the quality of the induced logical representation that represent the behaviour of the data.Specifically,the optimum induced logical representati...
the National Natural Science Foundation of China(Grant Nos.61762019,61862051 and 62062001);The Science and Technology Foundation of Guizhou Province(Qian Ke Ping Tai Ren Cai[2019]QNSYXM-05).
1Introduction The satisfiability(SAT)problem is always a core problem in the field of computer science.Its theoretical and applied research have long been the common attention of many scholars in the field of artifici...
This work was supported by the National Natural Science Foundation of China(Grant Nos.61762019 and 61862051),the Young Science and Technology Talent Growth Fund Project of Education Department of Guizhou Province(Qian Jiao He KY Zi[2017J343),the Science and Technology Foundation of Guizhou Province([2019]1299),the Top-notch Talent Program of Guizhou province(KY[2018]080),the Industrial Technology Foundation of Qiannan State(Qiannan Ke He Gong Zi(2017)16 Hao,[2017]10),the General program of Qiannan Normal University for Nationalities(qnsy2018016 and QNSYRC201715).
1 Introduction The propositional satisfiability(SAT)problem is an important and prototypical NP-hard problem in theoretical computer science[1].Many efforts have been made for designing high-performance SAT solvers.Th...
supported by the National Natural Science Foundation of China(Nos.61672261 and 61872159)。
Static compaction methods aim at finding unnecessary test patterns to reduce the size of the test set as a post-process of test generation.Techniques based on partial maximum satisfiability are often used to track man...