نتایج جستجو برای: Control Flow Graph (CFG)

تعداد نتایج: 1924486  

2007
Byeongcheol Lee Kevin Resnick Michael D. Bond Kathryn S. McKinley

To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with low runtime overhead. As object-oriented programmers compose increasingly complex programs, inaccurate call graphs will inhibit analysis and optimizations. This paper demonstrates how to use static and dynamic control flow grap...

Journal: :Lecture Notes in Computer Science 2022

Control-Flow Integrity (CFI) is a popular technique to defend against State-of-the-Art exploits, by ensuring that every (indirect) control-flow transfer points legitimate address and it part of the Control-flow Graph (CFG) program. Enabling CFI in real systems not straightforward, since many cases actual CFG program can only be approximated. Even case where there perfect knowledge CFG, all retu...

Journal: :Machine Learning 2022

Bug localization plays an important role in software maintenance. Traditional works treat the source code from lexical perspective, while some recent researches indicate that exploiting program structure is beneficial for improving bug localization. Control flow graph (CFG) a widely used representation, which essentially represents structure. Although using neural network feature learning strai...

2014
VIpIN Verma VINay arOra

Test sequence generation through code is mainly done by using some sort of a flow graph viz. Control Flow Graph (CFG), Concurrent Control Flow Graph (CCFG), event Graph etc. approaches that use UmL also need flow graph as an intermediate representation for final test sequence generation. In the present approach, a Flow Graph for a new concept i.e. Java7 Fork/Join is constructed and hence, by tr...

2012
Mojtaba Eskandari Sattar Hashemi

Metamorphic malware propagation has persuaded the security society to consider about new approaches to confront this generation of malware with novel solutions. Control Flow Graph, CFG, has been successful in detection of simple malwares. By now, it needs to improve the CFG based detection methods to detect metamorphic malwares efficiently. Our Approach has improved the simple CFG with benefici...

2012
Reza Meimandi Parizi

The ever-growing usage of aspect-oriented development methodology in the field of software engineering requires tool support for both research environments and industry. So far, tool support for many activities in aspect-oriented software development has been proposed, to automate and facilitate their development. For instance, the AJaTS provides a transformation system to support aspect-orient...

2017
Rémi Géraud Mirko Koscina Paul Lenczner David Naccache David Saulpic

One of the big challenges in program obfuscation consists in modifying not only the program’s straight-line code (SLC) but also the program’s control flow graph (CFG). Indeed, if only SLC is modified, the program’s CFG can be extracted and analyzed. Usually, the CFG leaks a considerable amount of information on the program’s structure. In this work we propose a method allowing to re-write a cod...

2016
Irene Díez-Franco Igor Santos

Attackers have evolved classic code-injection attacks, such as those caused by buffer overflows to sophisticated Turing-complete codereuse attacks. Control-Flow Integrity (CFI) is a defence mechanism to eliminate control-flow hijacking attacks caused by common memory errors. CFI relies on static analysis for the creation of a program’s controlflow graph (CFG), then at runtime CFI ensures that t...

Journal: :Jurnal Repositor 2023

Pengujian perangkat lunak merupakan salah satu fase yang penting untuk dilakukan dalam membangun lunak. Salah jenis pengujian digunakan adalah whitebox testing dengan metode cyclomatic complexity (CC). cara dapat menghitung banyaknya node dan edge dari control flow graph (CFG) merepresentasikan suatu kode program. Tujuan penelitian ini membuat sebuah perhitungan otomatis nilai CC CFG sumber Sis...

Journal: :CoRR 2014
Ahmed Tamrawi Kang Gui Suresh Kothari

Efficient and accurate path-sensitive analyses pose the challenges of: (a) analyzing an exponentially-increasing number of paths in a control-flow graph (CFG), and (b) checking feasibility of paths in a CFG. We address these challenges by introducing an equivalence relation on the CFG paths to partition them into equivalence classes. It is then sufficient to perform analysis on these equivalenc...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید