Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (17)
  • Open Access

    ARTICLE

    Smart Contract Vulnerability Detection Based on Symbolic Execution and Graph Neural Networks

    Haoxin Sun1, Xiao Yu1,*, Jiale Li1, Yitong Xu1, Jie Yu1, Huanhuan Li1, Yuanzhang Li2, Yu-An Tan2

    CMC-Computers, Materials & Continua, Vol.86, No.2, pp. 1-15, 2026, DOI:10.32604/cmc.2025.070930 - 09 December 2025

    Abstract Since the advent of smart contracts, security vulnerabilities have remained a persistent challenge, compromsing both the reliability of contract execution and the overall stability of the virtual currency market. Consequently, the academic community has devoted increasing attention to these security risks. However, conventional approaches to vulnerability detection frequently exhibit limited accuracy. To address this limitation, the present study introduces a novel vulnerability detection framework called GNNSE that integrates symbolic execution with graph neural networks (GNNs). The proposed method first constructs semantic graphs to comprehensively capture the control flow and data flow dependencies within smart contracts. More >

  • Open Access

    ARTICLE

    Advancing Code Obfuscation: Novel Opaque Predicate Techniques to Counter Dynamic Symbolic Execution

    Yan Cao#, Zhizhuang Zhou#, Yan Zhuang*

    CMC-Computers, Materials & Continua, Vol.84, No.1, pp. 1545-1565, 2025, DOI:10.32604/cmc.2025.062743 - 09 June 2025

    Abstract Code obfuscation is a crucial technique for protecting software against reverse engineering and security attacks. Among various obfuscation methods, opaque predicates, which are recognized as flexible and promising, are widely used to increase control-flow complexity. However, traditional opaque predicates are increasingly vulnerable to Dynamic Symbolic Execution (DSE) attacks, which can efficiently identify and eliminate them. To address this issue, this paper proposes a novel approach for anti-DSE opaque predicates that effectively resists symbolic execution-based deobfuscation. Our method introduces two key techniques: single-way function opaque predicates, which leverage hash functions and logarithmic transformations to prevent constraint More >

  • Open Access

    ARTICLE

    Binary Program Vulnerability Mining Based on Neural Network

    Zhenhui Li1, Shuangping Xing1, Lin Yu1, Huiping Li1, Fan Zhou1, Guangqiang Yin1, Xikai Tang2, Zhiguo Wang1,*

    CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 1861-1879, 2024, DOI:10.32604/cmc.2023.046595 - 27 February 2024

    Abstract Software security analysts typically only have access to the executable program and cannot directly access the source code of the program. This poses significant challenges to security analysis. While it is crucial to identify vulnerabilities in such non-source code programs, there exists a limited set of generalized tools due to the low versatility of current vulnerability mining methods. However, these tools suffer from some shortcomings. In terms of targeted fuzzing, the path searching for target points is not streamlined enough, and the completely random testing leads to an excessively large search space. Additionally, when it… More >

  • Open Access

    ARTICLE

    Evolution Performance of Symbolic Radial Basis Function Neural Network by Using Evolutionary Algorithms

    Shehab Abdulhabib Alzaeemi1, Kim Gaik Tay1,*, Audrey Huong1, Saratha Sathasivam2, Majid Khan bin Majahar Ali2

    Computer Systems Science and Engineering, Vol.47, No.1, pp. 1163-1184, 2023, DOI:10.32604/csse.2023.038912 - 26 May 2023

    Abstract 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 algorithms for training the Symbolic Radial Basis Function Neural Network (SRBFNN) through the behavior’s integration of satisfiability programming. Inspired by evolutionary algorithms, which can iteratively find the near-optimal solution, different Evolutionary Algorithms (EAs) were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation (SRBFNN-2SAT). The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different… More >

  • Open Access

    ARTICLE

    Lacunary Generating Functions of Hybrid Type Polynomials in Viewpoint of Symbolic Approach

    Nusrat Raza1, Umme Zainab2 and Serkan Araci3,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.130, No.2, pp. 903-921, 2022, DOI:10.32604/cmes.2022.017669 - 13 December 2021

    Abstract In this paper, we introduce mon-symbolic method to obtain the generating functions of the hybrid class of Hermite-associated Laguerre and its associated polynomials. We obtain the series definitions of these hybrid special polynomials. Also, we derive the double lacunary generating functions of the Hermite-Laguerre polynomials and the Hermite-Laguerre-Wright polynomials. Further, we find multiplicative and derivative operators for the Hermite-Laguerre-Wright polynomials which helps to find the symbolic differential equation of the Hermite-Laguerre-Wright polynomials. Some concluding remarks are also given. More >

  • Open Access

    ARTICLE

    A Survey on Binary Code Vulnerability Mining Technology

    Pengzhi Xu1,2, Zetian Mai1,2, Yuhao Lin1, Zhen Guo1,2,*, Victor S. Sheng3

    Journal of Information Hiding and Privacy Protection, Vol.3, No.4, pp. 165-179, 2021, DOI:10.32604/jihpp.2021.027280 - 22 March 2022

    Abstract With the increase of software complexity, the security threats faced by the software are also increasing day by day. So people pay more and more attention to the mining of software vulnerabilities. Although source code has rich semantics and strong comprehensibility, source code vulnerability mining has been widely used and has achieved significant development. However, due to the protection of commercial interests and intellectual property rights, it is difficult to obtain source code. Therefore, the research on the vulnerability mining technology of binary code has strong practical value. Based on the investigation of related technologies,… More >

  • Open Access

    ARTICLE

    A New Method Based on Evolutionary Algorithm for Symbolic Network Weak Unbalance

    Yirong Jiang1, Weijin Jiang2,3,4,*, Jiahui Chen2,*, Yang Wang2, Yuhui Xu2, Lina Tan2, Liang Guo5

    Journal on Internet of Things, Vol.1, No.2, pp. 41-53, 2019, DOI:10.32604/jiot.2019.07231

    Abstract The symbolic network adds the emotional information of the relationship, that is, the “+” and “-” information of the edge, which greatly enhances the modeling ability and has wide application in many fields. Weak unbalance is an important indicator to measure the network tension. This paper starts from the weak structural equilibrium theorem, and integrates the work of predecessors, and proposes the weak unbalanced algorithm EAWSB based on evolutionary algorithm. Experiments on the large symbolic networks Epinions, Slashdot and WikiElections show the effectiveness and efficiency of the proposed method. In EAWSB, this paper proposes a More >

  • Open Access

    ARTICLE

    Optimization Algorithm for Reduction the Size of Dixon Resultant Matrix: A Case Study on Mechanical Application

    Shang Zhang1, *, Seyedmehdi Karimi2, Shahaboddin Shamshirband3, 4, *, Amir Mosavi5,6

    CMC-Computers, Materials & Continua, Vol.58, No.2, pp. 567-583, 2019, DOI:10.32604/cmc.2019.02795

    Abstract In the process of eliminating variables in a symbolic polynomial system, the extraneous factors are referred to the unwanted parameters of resulting polynomial. This paper aims at reducing the number of these factors via optimizing the size of Dixon matrix. An optimal configuration of Dixon matrix would lead to the enhancement of the process of computing the resultant which uses for solving polynomial systems. To do so, an optimization algorithm along with a number of new polynomials is introduced to replace the polynomials and implement a complexity analysis. Moreover, the monomial multipliers are optimally positioned More >

  • Open Access

    ARTICLE

    Bäcklund Transformations: a Link Between Diffusion Models and Hydrodynamic Equations

    J.R. Zabadal1, B. Bodmann1, V. G. Ribeiro2, A. Silveira2, S. Silveira2

    CMES-Computer Modeling in Engineering & Sciences, Vol.103, No.4, pp. 215-227, 2014, DOI:10.3970/cmes.2014.103.215

    Abstract This work presents a new analytical method to transform exact solutions of linear diffusion equations into exact ones for nonlinear advection-diffusion models. The proposed formulation, based on Bäcklund transformations, is employed to obtain velocity fields for the unsteady two-dimensional Helmholtz equation, starting from analytical solutions of a heat conduction type model. More >

  • Open Access

    ARTICLE

    Stochastic Finite Element Analysis and Reliability Of Steel Telecommunication Towers

    M.M. Kamiński1, J. Szafran1

    CMES-Computer Modeling in Engineering & Sciences, Vol.83, No.2, pp. 143-168, 2012, DOI:10.32604/cmes.2012.083.143

    Abstract The main issue in this article is computational probabilistic analysis and reliability assessment of the steel telecommunication towers subjected to material and environmental uncertainty. Such a discussion is important since very wide, frequent and relatively modern application of these structures, which are subjected to various sources of uncertainty and having at this moment no rich and time-dependent failure evidence. Numerical analysis is based on the generalized stochastic perturbation technique implemented as the Stochastic Finite Elements using the Response Function Method applied with the use of computer algebra system. A simultaneous usage of the engineering FEM… More >

Displaying 1-10 on page 1 of 17. Per Page