Följ
Shengping Xiao
Shengping Xiao
华东师范大学 (East China Normal University)
Verifierad e-postadress på stu.ecnu.edu.cn
Titel
Citeras av
Citeras av
År
On-the-fly synthesis for LTL over finite traces
S Xiao, J Li, S Zhu, Y Shi, G Pu, M Vardi
Proceedings of the AAAI Conference on Artificial Intelligence 35 (7), 6530-6537, 2021
192021
Ltlf synthesis as AND-OR graph search: Knowledge compilation at work
G De Giacomo, M Favorito, J Li, MY Vardi, S Xiao, S Zhu
IJCAI, 2022
152022
Sat-based automata construction for LTL over finite traces
Y Shi, S Xiao, J Li, J Guo, G Pu
2020 27th Asia-Pacific Software Engineering Conference (APSEC), 1-10, 2020
112020
Accelerate safety model checking based on complementary approximate reachability
X Zhang, S Xiao, Y Xia, J Li, M Chen, G Pu
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2023
12023
Identifying boundary conditions with the syntax and semantic information of goals
Y Xia, J Li, S Xiao, W Miao, G Pu
arXiv preprint arXiv:2203.12903, 2022
12022
Model-Guided Synthesis for LTL over Finite Traces
S Xiao, Y Li, X Huang, Y Xu, J Li, G Pu, O Strichman, MY Vardi
International Conference on Verification, Model Checking, and Abstract …, 2023
2023
Computing minimal unsatisfiable core for LTL over finite traces
T Niu, S Xiao, X Zhang, J Li, Y Huang, J Shi
Journal of Logic and Computation, exad049, 2023
2023
FuzzBtor2: A Random Generator of Word-Level Model Checking Problems in Btor2 Format
S Xiao, C Zhang, J Li, G Pu
International Conference on Tools and Algorithms for the Construction and …, 2023
2023
LTLf Satisfiability Checking via Formula Progression (S).
T Niu, Y Xu, S Xiao, L Xiao, Y Huang, J Li
SEKE, 357-362, 2023
2023
Combining BMC and Complementary Approximate Reachability to Accelerate Bug-Finding
X Zhang, S Xiao, J Li, G Pu, O Strichman
Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided …, 2022
2022
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–10