Flow Graph Research Articles

Dynamic Spatio-Temporal Hypergraph Convolutional Network for Traffic Flow Forecasting

Graph convolutional networks (GCN) are an important research method for intelligent transportation systems (ITS), but they also face the challenge of how to describe the complex spatio-temporal relationships between traffic objects (nodes) more effectively. Although most predictive models are designed based on graph convolutional structures and have achieved effective results, they have certain limitations in describing the high-order relationships between real data. The emergence of hypergraphs breaks this limitation. A dynamic spatio-temporal hypergraph convolutional network (DSTHGCN) model is proposed in this paper. It models the dynamic characteristics of traffic flow graph nodes and the hyperedge features of hypergraphs simultaneously, achieving collaborative convolution between graph convolution and hypergraph convolution (HGCN). On this basis, a hyperedge outlier removal mechanism (HOR) is introduced during the process of node information propagation to hyper-edges, effectively removing outliers and optimizing the hypergraph structure while reducing complexity. Through in-depth experimental analysis on real-world datasets, this method has better performance compared to other methods.

Heterogeneous Online Computational Platform for GEM-Based Plasma Impurity Monitoring Systems

The fusion energy research field presents many intricate challenges that require resolution. Many diagnostic systems employed in experiments are approaching the limits of current technology. Implementing efficient measurements requires using an appropriate set of tools to facilitate the optimal utilization of hardware. Fusion energy measurements must provide low latency processing with the capacity for future improvements and the ability to handle complex data flows efficiently. The presented work addresses these requirements and describes the implementation of a high-performance, low-latency software platform with convenient development for soft X-ray (SXR) plasma impurities emission tracing—the Asynchronous Complex Computation Platform (AC2P). This article presents the architectural design, implementation details, and performance and latency measurements based on the raw data acquired from the WEST tokamak and laboratory tests. AC2P provides the tools to develop low-latency, multi-core, multi-device complex data flow graph scale-up solutions for measuring impurities in hot plasmas. The system has been designed to operate online during experiments, calculate the energy distribution, position and occurrence time of SXR photons, monitor the data stream’s quality and archive any abnormalities for subsequent offline verification and algorithm improvement. This article presents AC2P, which operates as part of the SXR measurement system on the WEST tokamak.

UniBin: Assembly semantic-enhanced binary vulnerability detection without disassembly

The widespread reuse of open-source code amplifies the impact of vulnerabilities. Current vulnerability detection methods predominantly rely on binary code similarity comparisons, which involve disassembling to obtain assembly code or control flow graphs. These methods depend on specific disassembly tools and complex preprocessing, limiting their applicability and detection speed. This paper proposes UniBin, a vulnerability detection method based on the multi-layer Transformer encoder. By employing bidirectional LM, unidirectional LM, and sequence-to-sequence LM tasks on both binary and assembly code during the pre-training phase, UniBin learns richer semantic information from binary machine code, enabling efficient similarity comparison without disassembly and mitigating the limitations of disassembly. We cross-compile 55 widely used open-source C projects as datasets. After 52 hours of pre-training and 8 hours of fine-tuning, UniBin reaches an average accuracy of 98.3% in similarity detection across compilation conditions, outperforming the state-of-the-art method. For search tasks across optimization options with a pool size of 1000, the Recall@1 metric improves by 28.2% (from 67.9% to 87.1%). UniBin eliminates dependency on specific disassembly tools and improves end-to-end binary analysis speed by over 36%. In real-world vulnerability detection tasks, UniBin detects all vulnerability functions with the lowest false positive rate of 0.16%.

A Joint Estimation Method of Distribution Network Topology and Line Parameters Based on Power Flow Graph Convolutional Networks

Accurate identification of network topology and line parameters is essential for effective management of distribution systems. An innovative joint estimation method for distribution network topology and line parameters is presented, utilizing a power flow graph convolutional network (PFGCN). This approach addresses the limitations of traditional methods that rely on costly voltage phase angle measurements. The node correlation principle is applied to construct a node correlation matrix, and a minimum distance iteration algorithm is proposed to generate candidate topologies, which serve as graph inputs for the parameter estimation model. Based on the topological dependencies and convolutional properties of AC power flow equations, a PFGCN model is designed for line parameter estimation. Parameter refinement is achieved through an alternating iterative process of pseudo-trend calculation and neural network training. Training convergence and loss function values are used as feedback to filter and validate candidate topologies, enabling precise joint estimation of both topologies and parameters. The proposed method’s accuracy, transferability, and robustness are demonstrated through experiments on the IEEE-33 and modified IEEE-69 distribution systems. Multiple metrics, including MAPE, IAE, MAE, and R2, highlight the proposed method’s advantages over Adaptive Ridge Regression (ARR). In the C33 scenario, the proposed method achieves MAPEs of 4.6% for g and 5.7% for b, outperforming the ARR method with MAPEs of 7.1% and 7.9%, respectively. Similarly, in the IC69 scenario, the proposed method records MAPEs of 3.0% for g and 5.9% for b, surpassing the ARR method’s 5.1% and 8.3%.

MVD-HG: multigranularity smart contract vulnerability detection method based on heterogeneous graphs

Smart contracts have significant losses due to various types of vulnerabilities. However, traditional vulnerability detection methods rely extensively on expert rules, resulting in low detection accuracy and poor adaptability to novel attacks. To address these problems, in this paper, deep learning methods are combined with smart contract vulnerability code detection approaches. syntax trees (ASTs), which are special isomorphic graph structures, are an important bridge between source code and graph neural networks. By learning the AST, the model can understand the semantics of the source code. Moreover, graph neural networks have an increasing ability to address complex heterogeneous graphs. Therefore, control flow graphs are fused with data flow graphs on the basis of the ASTs to build heterogeneous graphs with richer code semantics. Furthermore, multigranularity analysis of the vulnerability detection results is performed, including coarse-grained contract-level vulnerability detection and fine-grained line-level vulnerability detection. Through this multigranularity detection approach, vulnerabilities in contracts can be identified and analysed more comprehensively, providing a richer perspective and more solutions for vulnerability detection. The experimental results show that the proposed multigranularity vulnerability detection method based on heterogeneous graphs (MVD-HG) improves both the accuracy and range of the detected vulnerability types in contract-level vulnerability detection tasks; moreover, in the line-level vulnerability detection task, the MVD-HG model achieves significant results and addresses the shortcomings of existing methods. In addition, based on code generation methods used in related fields, a data enhancement method based on the source code is developed, which effectively expands the experimental dataset to address the reduced credibility of the results due to insufficient amounts of data.

Dynamics of veering triangulations: infinitesimal components of their flow graphs and applications

Dynamics of veering triangulations: infinitesimal components of their flow graphs and applications

A dual-level graph attention network and transformer for enhanced trajectory prediction under road network constraints

Predicting vehicle future trajectories enables various Location-Based Services (LBS), including traffic flow monitoring, vehicle route planning, etc. Vehicles are constrained to predefined road networks. Their traveling behaviors are influenced by both their own attributes and road network characteristics hidden in other vehicles’ travel histories. Most of the existing methods fail to sufficiently leverage such collaborative trajectory data under road network constraints. This paper proposes a novel model, called HGT-RN (Hierarchical Graph Attention Network and Transformer Networks for Enhanced Trajectory Prediction under Road Network Constraints), which exploits all vehicles’ trajectories and integrates road network constraints. Specifically, HGT-RN creates a dual-level Graph Attention Network (GAT) based on global traffic flow and local individual trajectory graph to learn trajectory embeddings: (i) Weighted-directional global traffic flow graph and Weighted-Directional GAT to learn the global-level trajectory embedding by aggregating the neighbors’ embeddings based on the spatial transitional relationships among road intersections over all vehicles’ trajectories, considering the preference of current trajectory; and (ii) Local individual trajectory graph attention network to learn the local-level trajectory embedding by modeling the transitions within the current trajectory at each intersection. When incorporating the trajectory embeddings into a transformer model for future trajectory prediction, a road network topology-aware loss function is designed to improve accuracy. Extensive experiments conducted on three city-scale real-world taxi trajectory datasets demonstrate that HGT-RN significantly outperforms existing baseline models. The code is available at https://github.com/zjy9826/HGT-RN.

Автоматизований метод перевірки та налагодження тестових сценаріїв на основі формальної моделі

Introduction. Model-based test cases generation is a popular strategy for test automation. It helps to reduce time spent on the development of a test suite and can improve level of coverage. However, many reports show shortage of such test cases in poor quality and doubtable efficiency. Purpose. The main goal of the proposed method is cost-effective validation, assessment, debugging and concretization of generated test cases. The method helps improve quality and efficiency of the test cases, make their scenario meaningful and goal-oriented. The method also develops debugging facilities and simplifies data dependency analysis and test scenario editing. Methods. We propose an automated post-processing method which allows to evaluate path that is examined by the test case, and to make safe changes to the path which will eliminate the shortcomings while leaving the coverage targets of the test case unharmed. The method is based on visualization of the path along the control flow graph of the model with additional information about factual evaluation history of all variables and possible alternative variants of behavior. For consistent substitution of certain values in the signal parameters, which would determine the artifacts of the test environment (such as, for example, files, databases, etc.) and check boundary cases (in predicates of conditions, indexing of arrays, etc.), a method of interactive specification of symbolic traces has been developed. Results. The role of the user in deciding whether to add a test case to the project test suite and make changes to it remains crucial, but to reduce labor intensity, the following processes are automated: evaluation of test scenarios according to certain objective characteristics (level of coverage, ability to detect defects, data cohesion, etc.); highlighting of possible alternatives for making corrections; consistent updating of computations for the corresponding corrections. A prototype was developed based on the proposed methods. The empirical results demonstrated a positive impact on the overall efficiency (ability to detect defects and reduce resource consumption) and quality (meaningfulness, readability, maintenance, usefulness for debugging, etc) of the generated test suites. The method allows to make automatically generated test cases trustable and usable. Conclusion. The proposed toolkit significantly reduces the time spent on researching the results of test generation and validation of the obtained tests and their editing. Unlike existing simulation methods, the proposed method not only informs about the values of variables, but also explores the history of their computations and additionally provides information about admissible alternatives. Further we plan to improve the process of localizing the causes of test failure at execution phase to speed up the search for defects.

Tipping prediction of a class of large-scale radial-ring neural networks

Understanding the emergence and evolution of collective dynamics in large-scale neural networks remains a complex challenge. This paper seeks to address this gap by applying dynamical systems theory, with a particular focus on tipping mechanisms. First, we introduce a novel (n+mn)-scale radial-ring neural network and employ Coates’ flow graph topological approach to derive the characteristic equation of the linearized network. Second, through deriving stability conditions and predicting the tipping point using an algebraic approach based on the integral element concept, we identify critical factors such as the synaptic transmission delay, the self-feedback coefficient, and the network topology. Finally, we validate the methodology’s effectiveness in predicting the tipping point. The findings reveal that increased synaptic transmission delay can induce and amplify periodic oscillations. Additionally, the self-feedback coefficient and the network topology influence the onset of tipping points. Moreover, the selection of activation function impacts both the number of equilibrium solutions and the convergence speed of the neural network. Lastly, we demonstrate that the proposed large-scale radial-ring neural network exhibits stronger robustness compared to lower-scale networks with a single topology. The results provide a comprehensive depiction of the dynamics observed in large-scale neural networks under the influence of various factor combinations.

Architecture of an automated program complex based on a multiple kernel svm classifier for analyzing malicious executable files

Subject matter. This article presents the development and architecture of an automated program complex designed to identify and analyze malicious executable files using a classifier based on a multiple kernel support vector machine (SVM). Goal. The aim of the work is to create an automated system that enhances the accuracy and efficiency of malware detection by combining static and dynamic analysis into a single framework capable of processing large volumes of data with optimal time expenditure. Tasks. To achieve this goal, tasks were carried out that included developing a program complex that automates the collection of static and dynamic data from executable files using tools like IDA Pro, IDAPython, and Drakvuf; integrating a multiple kernel SVM classifier to analyze the collected heterogeneous data; validating the system's effectiveness based on a substantial dataset containing 1,389 executable samples; and demonstrating the system's scalability and practical applicability in real-world conditions. Methods. The methods involved a hybrid approach that combines static analysis – extracting byte code, disassembled instructions, and control flow graphs using IDA Pro and IDAPython – with dynamic analysis, which entails monitoring real-time behavior using Drakvuf. The multiple kernel SVM classifier integrates different data representations using various kernels, allowing for both linear and nonlinear relationships to be considered in the classification process. Results. The results of the study show that the system achieves a high level of accuracy and completeness, as evidenced by key performance metrics such as an F-score of 0.93 and ROC AUC and PR AUC values. The automated program complex reduces the analysis time of a single file from an average of 11 minutes to approximately 5 minutes, effectively doubling the throughput compared to previous methods. This significant reduction in processing time is critically important for deployment in environments where rapid and accurate malware detection is necessary. Furthermore, the system's scalability allows for efficient processing of large data volumes, making it suitable for real-world applications. Conclusions. In conclusion, the automated program complex developed in this study demonstrates significant improvements in the accuracy and efficiency of malware detection. By integrating multiple kernel SVM classification with static and dynamic analysis, the system shows potential for real-time malware detection and analysis. Its scalability and practical applicability indicate that it could become an important tool in combating modern cyber threats, providing organizations with an effective means to enhance their cybersecurity.

Atrial Fibrillation Prevalence In Ischemic Strokes In An Irish Hospital. Spotlight On Anticoagulation Failure In Patients On Direct Oral Anticoagulants

Abstract Background Global atrial fibrillation (AF) burden in acute ischemic stroke patients approximates at 30%. An Audit in 2022, in the concerned hospital identified lack of compliance and under-dosing as major causes of ischemic strokes whilst on direct acting anticoagulants (DOACs). This year, we sought repeat the audit of process with focus on ischemic strokes with pre-existing AF patients established on DOACs, to study trends related to anticoagulation failure. Methods The study was a retrospective observational audit study of all patients admitted with a diagnosis of acute ischemic stroke to the concerned hospital from January 2023 to December 2023 who had known diagnosis of atrial fibrillation and were prescribed a DOAC prior to their admission in the concerned hospital with an ischemic stroke. Patients were identified via HIPE coding and in-hospital stroke registry. Data was collected via charts review, compiled via flow charts, graphs and excel sheets, and studied. Results 143 patients were admitted to the hospital’s stroke service with ischemic stroke in the set time frame. 46 (32%) had Atrial Fibrillation (AF) which was deemed to be the cause of their stroke. 29 (20.2%) had pre-existing diagnosed AF, and 22 of those patients were prescribed DOACs. In all patients already on DOACs, compliance was found questionable or lack of in 11 (50%). 8 (36.3%) patients were on low dose (adjusted dose DOACs). 3 patients were diagnosed with DOAC failure without cause. All new and existing AF patients not anticoagulated, were commenced on anticoagulation. Conclusion The audit showed under dosage and poor compliance were major causes of anticoagulation failure in stroke patients who were anticoagulated with DOACs. Similar results were noted as secondary results in last year’s audit in the concerned hospital. As part of quality improvement process, a specialist DOAC clinic was being set up with further audit process planned for the coming year.

DetectVul: A statement-level code vulnerability detection for Python

Detecting vulnerabilities in source code using graph neural networks (GNN) has gained significant attention in recent years. However, the detection performance of these approaches relies highly on the graph structure, and constructing meaningful graphs is expensive. Moreover, they often operate at a coarse level of granularity (such as function-level), which limits their applicability to other scripting languages like Python and their effectiveness in identifying vulnerabilities. To address these limitations, we propose DetectVul, a new approach that accurately detects vulnerable patterns in Python source code at the statement level. DetectVul applies self-attention to directly learn patterns and interactions between statements in a raw Python function; thus, it eliminates the complicated graph extraction process without sacrificing model performance. In addition, the information about each type of statement is also leveraged to enhance the model’s detection accuracy. In our experiments, we used two datasets, CVEFixes and Vudenc, with 211,317 Python statements in 21,571 functions from real-world projects on GitHub, covering seven vulnerability types. Our experiments show that DetectVul outperforms GNN-based models using control flow graphs, achieving the best F1 score of 74.47%, which is 25.45% and 18.05% higher than the best GCN and GAT models, respectively.

AugPersist: Automatically augmenting the persistence of coverage-based greybox fuzzing for persistent software

Fuzzing is one of the most successful approaches for verifying software functionalities and discovering security vulnerabilities. However, the software with persistent runtime characteristics (e.g., web service programs) cannot be effectively tested by current coverage-based greybox (CG) fuzzers, which strictly rely on the termination state of the target software to feed test cases synchronously and obtain code coverage. The present approach requires delicate analysis and modification of the target to eliminate its persistence, but leads to excessive non-essential restarts during testing, resulting in low throughput.To improve the convenience and efficiency of CG fuzzing for persistent software, we propose augmenting persistence (AugPersist) as a complementary method. AugPersist introduces the concept of persistent basic block (PBB) to leverage the inherent code features of persistent software. PBB can be found automatically and quickly before fuzzing based on the execution flow graph (EFG). On this basis, we develop a low- delay synchronous communication so that after regular test cases are fed into the target, the fuzzer can derive code coverage without rebooting the target, thus significantly minimizing extraneous restarts. Additionally, by utilizing the self-adaptive forkserver, we can dynamically adjust the re-execution point of the target to the PBB position, which further minimizes losses when test cases trigger exceptions and cause necessary restarts.To show the potential of augmenting persistence, we create two implementations, AFL-AugPersist and AFLNet-AugPersist, using AFL and AFLNet as baselines. We evaluate both with their respective baselines on different benchmarks. AFL-AugPersist makes stateless persistent software easier to be fuzzed than AFL and provides 4.9 × to 71.1 × throughput improvement compared to AFL. The throughput of AFLNet-AugPersist improves by a maximum of 210.0 × and a minimum of 3.3 × compared to AFLNet. These results show that AugPersist significantly contributes to the convenience and efficiency of CG fuzzing on persistent software.

Software Weakness Detection in Solidity Smart Contracts Using Control and Data Flow Analysis: A Novel Approach with Graph Neural Networks

Smart contracts on blockchain platforms are susceptible to security issues that can lead to significant financial losses. This study converts the Solidity code into abstract syntax trees and generates control flow graphs and data flow graphs. These graphs train a graph convolutional network model to detect security weaknesses. The proposed system outperforms traditional tools, achieving higher accuracy, recall, precision, and F1 scores when detecting weaknesses such as integer overflow/underflow, reentrancy, delegate call to the untrusted callee, and time-based issues. This study demonstrates that leveraging control and data flow analysis with graph neural networks significantly enhances smart contract security and provides a robust and reliable solution.

SAT-Based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

Coarse-Grain Reconfigurable Arrays (CGRAs) represent emerging low-power architectures designed to accelerate Compute-Intensive Loops (CILs). The effectiveness of CGRAs in providing acceleration relies on the quality of mapping: how efficiently the CIL is compiled onto the platform. State-of-the-Art (SoA) compilation techniques utilize modulo scheduling to minimize the Iteration Interval (II) and use graph algorithms like Max-Clique Enumeration to address mapping challenges. Our work approaches the mapping problem through a satisfiability (SAT) formulation. We introduce the Kernel Mobility Schedule (KMS), an ad hoc schedule used with the Data Flow Graph and CGRA architectural information to generate Boolean statements that, when satisfied, yield a valid mapping. Experimental results demonstrate SAT-MapIt outperforming SoA alternatives in almost 50% of explored benchmarks. Additionally, we evaluated the mapping results in a synthesizable CGRA design and emphasized the runtime metrics trends, i.e., energy efficiency and latency, across different CILs and CGRA sizes. We show that a hardware-agnostic analysis performed on compiler-level metrics can optimally prune the architectural design space, while still retaining Pareto-optimal configurations. Moreover, by exploring how implementation details impact cost and performance on real hardware, we highlight the importance of holistic software-to-hardware mapping flows, as the one presented herein.

Semantic Code Clone Detection Based on Community Detection

Semantic code clone detection is to find code snippets that are structurally or syntactically different, but semantically identical. It plays an important role in software reuse, code compression. Many existing studies have achieved good performance in non-semantic clone, but semantic clone is still a challenging task. Recently, several works have used tree or graph, such as Abstract Syntax Tree (AST), Control Flow Graph (CFG) or Program Dependency Graph (PDG) to extract semantic information from source codes. In order to reduce the complexity of tree and graph, some studies transform them into node sequences. However, this transformation will lose some semantic information. To address this issue, we propose a novel high-performance method that utilizes community detection to extract features of AST while preserving its semantic information. First, based on the AST of source code, we exploit community detection to split AST into different subtrees to extract the underlying semantics information of different code blocks, and use centrality analysis to quantify the semantic information as the weight of AST nodes. Then, the AST is converted into a sequence of tokens with weights, and a Siamese neural network model is used to detect the similarity of token sequences for semantic code clone detection. Finally, to evaluate our approach, we conduct experiments on two standard benchmark datasets, Google Code Jam (GCJ) and BigCloneBench (BCB). Experimental results show that our model outperforms the eight publicly available state-of-the-art methods in detecting code clones. It is five times faster than the tree-based method (ASTNN) in terms of time complexity.

Dynamic Flow Algorithm with Intermediate Storage for Emergency Evacuation Allowing Lane Reversal based on Incomplete Intuitionistic Fuzzy Preference Relation

Background Evacuation in case of disasters is of the greatest importance because of significant occurrences of natural and artificial disasters worldwide, which is why a reliable evacuation plan is always needed. However, evacuation models are difficult to develop due to various uncertain aspects that need to be considered, multiple and often conflicting criteria for evaluation and as lack of expertise regarding a specific preference of alternatives. Objective This study aims to transport the maximum number of evacuees in a dynamic network with lane reversal by a safe pattern of transportation, i.e., allowing storage at intermediate nodes. The optimal order of shelters and intermediate nodes for a reliable evacuation plan will be defined by incomplete intuitionistic fuzzy preference relation. Methods The illustrated method incorporates multiple and often conflicting criteria into a process of emergency decision-making. When evaluating evacuation alternatives, a decision-maker may hesitate and be unsure which alternative is better or not have sufficient expertise to evaluate a pair of alternatives. To model uncertainty and hesitation, intuitionistic fuzzy values are used to describe alternatives in more detail. This study relies on flow models and graph theory to simulate the movement of evacuees to safe destinations. Furthermore, fuzzy methods and their recent modifications are applied to determine the effective priority order of shelters. A case study which simulates the evacuation of aggrieved to safe destinations is presented. Results A method of evaluating the shelters and intermediate nodes for evacuation based on incomplete intuitionistic fuzzy preference relation is proposed. The method allows the missed values of experts’ assessments to be filled in regarding the evacuation alternatives and deals with intuitionistic fuzzy values, which describe experts’ hesitation. The dynamic character of flow distribution enables transit arc capacities and time factors to be processed. The contraflow technique, which is a powerful tool to decrease traffic jams and congestion on roads by reversing the movement along the unused segments, is applied to maximize the number of survivors. Conclusion The results of the method were compared to those of existing methods, and their consistency was proved. In the future, we intend to apply interval-valued intuitionistic preference relations and iterative algorithms to improve the consistency of intuitionistic preference relations to the tasks of transporting the maximum possible number of aggrieved to safe locations.

Smart contract vulnerabilities detection with bidirectional encoder representations from transformers and control flow graph

Smart contract vulnerabilities detection with bidirectional encoder representations from transformers and control flow graph

SCL-CVD: Supervised contrastive learning for code vulnerability detection via GraphCodeBERT

Detecting vulnerabilities in source code is crucial for protecting software systems from cyberattacks. Pre-trained language models such as CodeBERT and GraphCodeBERT have been applied in multiple code-related downstream tasks such as code search and code translation and have achieved notable success. Recently, this pre-trained and fine-tuned paradigm has also been applied to detect code vulnerabilities. However, fine-tuning pre-trained language models using cross-entropy loss has several limitations, such as poor generalization performance and lack of robustness to noisy labels. In particular, when the vulnerable code and the benign code are very similar, it is difficult for deep learning methods to differentiate them accurately. In this context, we introduce a novel approach for code vulnerability detection using supervised contrastive learning, namely SCL-CVD, which leverages GraphCodeBERT. This method aims to enhance the effectiveness of existing vulnerable code detection approaches. SCL-CVD represents the source code as data flow graphs. These graphs are then processed by GraphCodeBERT, which has been fine-tuned using a supervised contrastive loss function combined with R-Drop. This fine-tuning process is designed to generate more resilient and representative code embedding. Additionally, we incorporate LoRA (Low-Rank Adaptation) to streamline the fine-tuning process, significantly reducing the time required for model training. Finally, a Multilayer Perceptron (MLP) is employed to detect vulnerable code leveraging the learned representation of code. We designed and conducted experiments on three public benchmark datasets, i.e., Devign, Reveal, Big-Vul, and a combined dataset created by merging these sources. The experimental results demonstrate that SCL-CVD can effectively improve the performance of code vulnerability detection. Compared with the baselines, the proposed approach has a relative improvement of 0.48%∼3.42% for accuracy, 0.93%∼45.99% for precision, 35.68%∼67.48% for recall, and 16.31%∼49.67% for F1-score, respectively. Furthermore, compared to baselines, the model fine-tuning time of the proposed approach is reduced by 16.67%∼93.03%. In conclusion, our approach SCL-CVD offers significantly greater cost-effectiveness over existing approaches.

A Survey on Malware Detection with Graph Representation Learning

Malware detection has become a major concern due to the increasing number and complexity of malware. Traditional detection methods based on signatures and heuristics are used for malware detection, but unfortunately, they suffer from poor generalization to unknown attacks and can be easily circumvented using obfuscation techniques. In recent years, Machine Learning (ML) and notably Deep Learning (DL) achieved impressive results in malware detection by learning useful representations from data and have become a solution preferred over traditional methods. Recently, the application of Graph Representation Learning (GRL) techniques on graph-structured data has demonstrated impressive capabilities in malware detection. This success benefits notably from the robust structure of graphs, which are challenging for attackers to alter, and their intrinsic explainability capabilities. In this survey, we provide an in-depth literature review to summarize and unify existing works under the common approaches and architectures. We notably demonstrate that Graph Neural Networks (GNNs) reach competitive results in learning robust embeddings from malware represented as expressive graph structures such as Function Call Graphs (FCGs) and Control Flow Graphs (CFGs). This study also discusses the robustness of GRL-based methods to adversarial attacks, contrasts their effectiveness with other ML/DL approaches, and outlines future research for practical deployment.