Showing 21 - 40 results of 807 for search '"Control flow"', query time: 0.38s Refine Results
  1. 21
  2. 22

    CFA2: a Context-Free Approach to Control-Flow Analysis by Dimitrios Vardoulakis, Olin Shivers

    Published 2011-05-01
    “…In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and return well: they remember only a bounded number of pending calls because they approximate programs with control-flow graphs. …”
    Get full text
    Article
  3. 23
  4. 24
  5. 25
  6. 26

    Compiler Optimizations Impact the Reliability of the Control-Flow of Radiation-Hardened Software by Ronaldo Rodrigues Ferreira, Rafael Baldiati Parizi, Luigi Carro, Álvaro Freitas Moreira

    Published 2013-08-01
    “… http://dx.doi.org/10.5028/jatm.v5i3.224 This paper discusses how compiler optimizations influence software reliability when the optimized application is compiled with a technique to enable the software itself to detect and correct radiation-induced control-flow errors. Supported  by a comprehensive fault-injection campaign using an established benchmark suite in the embedded systems domain, we show that the compiler is a non-negligible source of noise when hardening the software against radiationinduced soft errors. …”
    Get full text
    Article
  7. 27
  8. 28

    Software protection system : binary control flow obfuscation for portable executables by Chew, Ron Jun Hong.

    Published 2012
    “…These obfuscation techniques include control flow flattening and branch conversion and they are directed at the control flow of a program to hide its intended logic and behavior. …”
    Get full text
    Final Year Project (FYP)
  9. 29

    The Construction of an Universal Linearized Control Flow Graph for Static Code Analysis of Algorithms by V. A. Bitner, N. V. Zaborovsky

    Published 2013-04-01
    “…This paper presents the description of a possible way to build the universal linearized control flow graph which is supposed to be architecture-independent and applicable to the description of any high level language programs. …”
    Get full text
    Article
  10. 30
  11. 31

    The Construction of an Universal Linearized Control Flow Graph for Static Code Analysis of Algorithms by V. A. Bitner, N. V. Zaborovsky

    Published 2013-01-01
    “…<p>This paper presents the description of a possible way to build the universal linearized control flow graph which is supposed to be architecture-independent and applicable to the description of any high level language programs. …”
    Get full text
    Article
  12. 32
  13. 33

    Bratter: An Instruction Set Extension for Forward Control-Flow Integrity in RISC-V by Seonghwan Park, Dongwook Kang, Jeonghwan Kang, Donghyun Kwon

    Published 2022-02-01
    “…In recent decades, there has been an increasing number of studies on control flow integrity (CFI), particularly those implementing hardware-assisted CFI solutions that utilize a special instruction set extension. …”
    Get full text
    Article
  14. 34

    SCGformer: Smart contract vulnerability detection based on control flow graph and transformer by KeXin Gong, Xiangmei Song, Na Wang, Chunyang Wang, Huijuan Zhu

    Published 2023-12-01
    “…To address this problem, we propose a novel vulnerability detection method based on transformer by constructing the control flow graph (CFG) of smart contracts operation codes (opcodes), which shields the difference of various versions of program language. …”
    Get full text
    Article
  15. 35

    Process Variants Merging Method Based on Group-fair Control Flow Structure by WANG Wu-song, FANG Huan, ZHENG Xue-wen

    Published 2021-12-01
    “…Merging process variants models can quickly construct a single process model to meet a new demand.The issue of how to merge the process variants models is of great practical value.Therefore,a process variants merging method using group-fair control flow structure is proposed.Firstly,process variants are segmented into individual variant using group-fairness in Petri nets.Then,the control flow paths of the variant fragments are extracted and their corresponding matrix representation are constructed,then the variants are merged into a single flow model.Finally,it is proved that the merged process model captures all the behaviors of the input process models,and it can detect the unexpected behaviors of the merged model compared to the former input models.…”
    Get full text
    Article
  16. 36

    Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs by Thomas Martin Gawlitza, David Monniaux

    Published 2012-09-01
    “…Another well-known source of imprecision of traditional abstract interpretation techniques stems from their use of join operators at merge nodes in the control flow graph. The mentioned weaknesses may prevent these methods from proving safety properties. …”
    Get full text
    Article
  17. 37
  18. 38
  19. 39
  20. 40