Network protocols are the foundation of modern communication, yet their implementations often contain semantic vulnerabilities stemming from inadequate understanding of specification semantics. Existing gray-box and black-box testing approaches lack semantic modeling of protocols, making it difficult to precisely express testing intent and cover boundary conditions. Moreover, they typically rely on coarse-grained oracles such as crashes, which are inadequate for identifying deep semantic vulnerabilities. To address these limitations, we present a semantics-aware fuzzing framework, SemFuzz. The framework leverages large language models to extract structured semantic rules from RFC documents and generates test cases that intentionally violate these rules to encode specific testing intents. It then detects deep semantic vulnerabilities by comparing the observed responses with the expected ones. Evaluation on seven widely deployed protocol implementations shows that SemFuzz identified sixteen potential vulnerabilities, ten of which have been confirmed. Among the confirmed vulnerabilities, five were previously unknown and four have been assigned CVEs. These results demonstrate the effectiveness of SemFuzz in detecting semantic vulnerabilities.

A good task assignment is an important guarantee to achieve great combat effectiveness. This paper investigates the task assignment problem, where the value of the targets is time changing in the battlefield, and presents a solution approach that is a combination of two algorithms: the multidestination route planning algorithm based on dynamic programming and the multisubgroup ant colony algorithm (MSACO). The two algorithms coordinately solve the task assignment problem. The route planning algorithm can obtain available routes between any two targets and provide reasonable routing information for MSACO. Then, the ant colony algorithm is applied to solve the task assignment problem. To solve the task assignment problem in the battlefield environment, several key technologies are introduced to improve the traditional ant colony algorithm, which include the subgroup selection strategy, the dynamic candidate aggregate policy, the state transferring policy, and the information-element updating mechanism. Simulation results show that the proposed approach can produce a reasonable and available plan for all the test cases in short computational time.