Xu Zhou

Dr. Xu Zhou

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2017 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
WGWeiwei Gong
Weiwei Gong
XZXu Zhou
Xu Zhou
In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design. This paper reviews the main algorithms of the SAT solver in recent years, including serial SAT algorithms, parallel SAT algorithms, SAT algorithms based on GPU, and SAT algorithms based on FPGA. The development of SAT is analyzed comprehensively in this paper. Finally, several possible directions for the development of the SAT problem are proposed.

25 January 2019 in IEEE Access
Verified
Journal Article
Open access
CSCongxi Song
Congxi Song
BYBo Yu
Bo Yu
XZXu Zhou
Xu Zhou
QYQiang Yang
Qiang Yang

25 January 2015 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
KLKai Lu
Kai Lu
XZXu Zhou
Xu Zhou
XWXiaoping Wang
Xiaoping Wang
TBTom Bergan
Tom Bergan
CCChen Chen
Chen Chen

1 April 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HZHangwei Zhang
Hangwei Zhang
KLKai Lu
Kai Lu
XZXu Zhou
Xu Zhou
QYQidi Yin
Qidi Yin
PWPengfei Wang
Pengfei Wang
TYTai Yue
Tai Yue
Cyber attacks against the web management interface of Internet of Things (IoT) devices often have serious consequences. Current research uses fuzzing technologies to test the web interfaces of IoT devices. These IoT fuzzers generate messages (a test case sent from the client to the server to test its functionality) without considering their dependency, which is unlikely to bypass the early check of the server. These invalid test cases significantly reduce the efficiency of fuzzing. To overcome this problem, we propose a stateful message generation (SMG) mechanism for IoT web fuzzing. SMG addresses two problems in IoT fuzzing. First, we retrieve the message dependency by using web front-end analysis and status analysis. These dependent messages, which can easily bypass the server check, are used as a valid seed. Second, we adopt a multi-message seed format to preserve the dependency of the messages when mutating the seed to get a valid test case, so that the test case can bypass the state check of the server to make a valid test. Message dependency preservation is implemented by our proposed parameter mutation and structural mutation methods. We implement SMG in our IoT fuzzer, SIoTFuzzer, which applies IoT firmware on the latest Linux-based simulation tool, FirmAE. We test nine IoT devices including a router and an IP camera and adopt a vulnerability detection mechanism. Our evaluation results show that (1) SIoTFuzzer is capable of finding real-world vulnerabilities in IoT devices; (2) our SMG is effective as it enables Boofuzz (a popular protocol fuzzer) to find command injection and cross-site scripting (XSS) vulnerabilities; and (3) compared to FirmFuzz, SIoTFuzzer found all the vulnerabilities in our benchmarks, while FirmFuzz found only four—the efficiency of our tool increased by 20.57% on average.

25 November 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
CSCongxi Song
Congxi Song
XZXu Zhou
Xu Zhou
QYQidi Yin
Qidi Yin
XHXinglu He
Xinglu He
HZHangwei Zhang
Hangwei Zhang
KLKai Lu
Kai Lu
Fuzzing is an effective technology in software testing and security vulnerability detection. Unfortunately, fuzzing is an extremely compute-intensive job, which may cause thousands of computing hours to find a bug. Current novel works generally improve fuzzing efficiency by developing delicate algorithms. In this paper, we propose another direction of improvement in this field, i.e., leveraging parallel computing to improve fuzzing efficiency. In this way, we develop P-fuzz, a parallel fuzzing framework that can utilize massive, distributed computing resources to fuzz. P-fuzz uses a database to share the fuzzing status such as seeds, the coverage information, etc. All fuzzing nodes get tasks from the database and update their fuzzing status to the database. Also, P-fuzz handles some data races and exceptions in parallel fuzzing. We compare P-fuzz with AFL and a parallel fuzzing framework Roving in our experiment. The result shows that P-fuzz can easily speed up AFL about 2.59× and Roving about 1.66× on average by using 4 nodes.

22 February 2014 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
ZWZhendong Wu
Zhendong Wu
KLKai Lu
Kai Lu
XWXiaoping Wang
Xiaoping Wang
XZXu Zhou
Xu Zhou