Zaloguj się

Gotowe bibliografie tematyczne / Control Flow Graph (CFG) / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Control Flow Graph (CFG).

Rozprawy doktorskie na temat „Control Flow Graph (CFG)”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 40 najlepszych rozpraw doktorskich naukowych na temat „Control Flow Graph (CFG)”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Sánchez, Yagüe Mónica. "Information extraction and validation of CDFG in NoGap." Thesis, Linköpings universitet, Datorteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-93905.

Pełny tekst źródła

Streszczenie:

A Control Data Flow Graph (CDFG) is a Directed Acyclic Graph (DAG) in which a node can be either an operation node or a control node. The target of this kind of graph is to capture allt he control and data flow information of the original hardware description while preserving the various dependencies. This kind of graph is generated by Novel Generator of Accelerators and Processors (NoGap), a design automation tool for Application Specific Instruction-set Processor (ASIP) and accelerator design developed by Per Karlström from the Department of Electrical Engineering of Linköping University. Th

Style APA, Harvard, Vancouver, ISO itp.

2

Self, Joel P. "On-the-Fly Dynamic Dead Variable Analysis." BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/886.

Pełny tekst źródła

Streszczenie:

State explosion in model checking continues to be the primary obstacle to widespread use of software model checking. The large input ranges of variables used in software is the main cause of state explosion. As software grows in size and complexity the problem only becomes worse. As such, model checking research into data abstraction as a way of mitigating state explosion has become more and more important. Data abstractions aim to reduce the effect of large input ranges. This work focuses on a static program analysis technique called dead variable analysis. The goal of dead variable analysis

Style APA, Harvard, Vancouver, ISO itp.

3

LI, ZHEN. "Control Flow Graph Based Attacks : In the Context of Flattened Programs." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-155770.

Pełny tekst źródła

Streszczenie:

This report addresses de-obfuscation on programs. The targeted obfuscation scheme is the control flow flattening, which is an obfuscation method focusing on hiding the control flow of a program. This scheme introduces a special block named dispatcher into the program. The control flow of the program is reconstructed to be directed back to the dispatcher whenever the execution of a basic block ends. By doing this, in the flattened program, each basic block could be recognized as a precursor or a successor of any other basic blocks. While the realcontrol flow of the program is merely disclosed d

Style APA, Harvard, Vancouver, ISO itp.

4

Torbey, Elie. "Control/data flow graph synthesis using evolutionary computation and behavioral estimation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ37080.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Stanier, James. "Removing and restoring control flow with the Value State Dependence Graph." Thesis, University of Sussex, 2012. http://sro.sussex.ac.uk/id/eprint/7576/.

Pełny tekst źródła

Streszczenie:

This thesis studies the practicality of compiling with only data flow information. Specifically, we focus on the challenges that arise when using the Value State Dependence Graph (VSDG) as an intermediate representation (IR). We perform a detailed survey of IRs in the literature in order to discover trends over time, and we classify them by their features in a taxonomy. We see how the VSDG fits into the IR landscape, and look at the divide between academia and the 'real world' in terms of compiler technology. Since most data flow IRs cannot be constructed for irreducible programs, we perform a

Style APA, Harvard, Vancouver, ISO itp.

6

Torbey, Elie Carleton University Dissertation Engineering Electronics. "Control/data flow graph synthesis using evolutionary computation and behavioral estimation." Ottawa, 1999.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Stange, Yuri. "Visualization of Code Flow." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-162108.

Pełny tekst źródła

Streszczenie:

Visual representation of Control Flow Graphs (CFG) is a feature available in many tools, such as decompilers. These tools often rely on graph drawing frameworks which implement the Sugiyama hierarchical style graph drawing method, a well known method for drawing directed graphs. The main disadvantage of the Sugiyama framework, is the fact that it does not take into account the nature of the graph to be visualized, specically loops are treated as second class citizens. The question this paper attempts to answer is; how can we improve the visual representation of loops in the graph? A method bas

Style APA, Harvard, Vancouver, ISO itp.

8

Pogulis, Jakob. "Generation of dynamic control-dependence graphs for binary programs." Thesis, Linköpings universitet, Databas och informationsteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-110247.

Pełny tekst źródła

Streszczenie:

Dynamic analysis of binary files is an area of computer science that has many purposes. It is useful when it comes to debugging software in a development environment and the developer needs to know which statements affected the value of a specific variable. But it is also useful when analyzing a software for potential vulnerabilities, where data controlled by a malicious user could potentially result in the software executing adverse commands or executing malicious code. In this thesis a tool has been developed to perform dynamic analysis of x86 binaries in order to generate dynamic control-de

Style APA, Harvard, Vancouver, ISO itp.

9

Caron, David. "Generating a control/data-flow graph representation of a circuit from VHDL for use in circuit synthesis." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0011/MQ27011.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Matsusaki, Cristina Toshie Motohashi. "Redes F-MFG (Functional Mark Flow Graph) e sua aplicação no projeto de sistemas antropocêntricos." Universidade de São Paulo, 1998. http://www.teses.usp.br/teses/disponiveis/3/3132/tde-17122004-154654/.

Pełny tekst źródła

Streszczenie:

Este trabalho introduz a formalização algébrica do F-MFG (Functional Mark Flow Graph) para a análise e simulação computacional de modelos de sistemas antropocêntricos de produção, onde são enfocadas a interação e a interface do elemento humano com o sistema produtivo. Abordando os sistemas antropocêntricos como uma classe de sistemas a eventos discretos, o F-MFG, que é uma técnica baseada nas redes de Petri, comprova ter potencial para descrever detalhadamente as ações e estados do sistema. O F-MFG, em conjunto com a Metodologia PFS/MFG (Production Flow Schema/ Mark Flow Graph), estabelece um

Style APA, Harvard, Vancouver, ISO itp.

11

Seidler, Steffen. "Über Minoren gerichteter Graphen." Master's thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-68153.

Pełny tekst źródła

Streszczenie:

Seit 1983 begründet die Publikationsreihe "Graph Minors" von N. Robertson und P.D. Seymour im Wesentlichen die Minorentheorie mit mächtigen Hilfsmitteln wie der Baumzerlegung und weitreichenden Resultaten wie dem Minorensatz. Für gerichtete Graphen existiert allerdings noch keine einheitliche Minorentheorie und verschiedene Ansätze werden in dieser Arbeit systematisiert. Einige gerichtete Versionen der Baumzerlegung (gerichtete Baumzerlegung nach B. Reed, arboreale, D- und DAG-Zerlegung) werden unter einheitlichen Aspekten untersucht. Die D-Weite ist dabei besonders vielversprechend. Enge Ver

Style APA, Harvard, Vancouver, ISO itp.

12

Kraut, Daniel. "Generování modelů pro testy ze zdrojových kódů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403157.

Pełny tekst źródła

Streszczenie:

The aim of the masters thesis is to design and implement a tool for automatic generation of paths in source code. Firstly was acquired a study of model based testing and possible design for the desired automatic generator based on coverage criteria defined on CFG model. The main point of the master theis is the tool design and description of its implementation. The tool supports many coverage criteria, which allows the user of such tool to focus on specific artefact of the system under test. Moreover, this tool is tuned to allow aditional requirements on the size of generated test suite, refle

Style APA, Harvard, Vancouver, ISO itp.

13

Segura, Salvador Albert. "High-performance and energy-efficient irregular graph processing on GPU architectures." Doctoral thesis, Universitat Politècnica de Catalunya, 2021. http://hdl.handle.net/10803/671449.

Pełny tekst źródła

Streszczenie:

Graph processing is an established and prominent domain that is the foundation of new emerging applications in areas such as Data Analytics and Machine Learning, empowering applications such as road navigation, social networks and automatic speech recognition. The large amount of data employed in these domains requires high throughput architectures such as GPGPU. Although the processing of large graph-based workloads exhibits a high degree of parallelism, memory access patterns tend to be highly irregular, leading to poor efficiency due to memory divergence.In order to ameliorate these issues,

Style APA, Harvard, Vancouver, ISO itp.

14

Thierry, Aurélien. "Désassemblage et détection de logiciels malveillants auto-modifiants." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0011/document.

Pełny tekst źródła

Streszczenie:

Cette thèse porte en premier lieu sur l'analyse et le désassemblage de programmes malveillants utilisant certaines techniques d'obscurcissement telles que l'auto-modification et le chevauchement de code. Les programmes malveillants trouvés dans la pratique utilisent massivement l'auto-modification pour cacher leur code utile à un analyste. Nous proposons une technique d'analyse hybride qui utilise une trace d'exécution déterminée par analyse dynamique. Cette analyse découpe le programme auto-modifiant en plusieurs sous-parties non auto-modifiantes que nous pouvons alors étudier par analyse sta

Style APA, Harvard, Vancouver, ISO itp.

15

Nielsen, Jerel Bendt. "Robust Visual-Inertial Navigation and Control of Fixed-Wing and Multirotor Aircraft." BYU ScholarsArchive, 2019. https://scholarsarchive.byu.edu/etd/7584.

Pełny tekst źródła

Streszczenie:

With the increased performance and reduced cost of cameras, the robotics community has taken great interest in estimation and control algorithms that fuse camera data with other sensor data.In response to this interest, this dissertation investigates the algorithms needed for robust guidance, navigation, and control of fixed-wing and multirotor aircraft applied to target estimation and circumnavigation.This work begins with the development of a method to estimate target position relative to static landmarks, deriving and using a state-of-the-art EKF that estimates static landmarks in its state

Style APA, Harvard, Vancouver, ISO itp.

16

Voráč, Ladislav. "Řiditelné filtry s maximálním možným přeladěním a netradičními aktivními prvky." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218353.

Pełny tekst źródła

Streszczenie:

The thesis is paid to design frequency filters steerable jet active elements of the MO–CF (Multiple-Output Current Follower) and also newly-developed current active element DACA (Digitally Adjustable Current Amplifier) in the company ON Semiconductor. The first three chapters focus on basic properties of frequency filters, used components and circuit design methods. The digitally controllable current amplifier DACA is used for managing the radio frequency filters and adjust it using the current amplification parameter A through the digital input CTR. For the design of filters of the second ord

Style APA, Harvard, Vancouver, ISO itp.

17

Neikter, Carl-Fredrik. "Cache Prediction and Execution Time Analysis on Real-Time MPSoC." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15394.

Pełny tekst źródła

Streszczenie:

<p>Real-time systems do not only require that the logical operations are correct. Equally important is that the specified time constraints always are complied. This has successfully been studied before for mono-processor systems. However, as the hardware in the systems gets more complex, the previous approaches become invalidated. For example, multi-processor systems-on-chip (MPSoC) get more and more common every day, and together with a shared memory, the bus access time is unpredictable in nature. This has recently been resolved, but a safe and not too pessimistic cache analysis approach for

Style APA, Harvard, Vancouver, ISO itp.

18

Samala, Harikrishna. "Methodology to Derive Resource Aware Context Adaptable Architectures for Field Programmable Gate Arrays." DigitalCommons@USU, 2009. https://digitalcommons.usu.edu/etd/484.

Pełny tekst źródła

Streszczenie:

The design of a common architecture that can support multiple data-flow patterns (or contexts) embedded in complex control flow structures, in applications like multimedia processing, is particularly challenging when the target platform is a Field Programmable Gate Array (FPGA) with a heterogeneous mixture of device primitives. This thesis presents scheduling and mapping algorithms that use a novel area cost metric to generate resource aware context adaptable architectures. Results of a rigorous analysis of the methodology on multiple test cases are presented. Results are compared against publ

Style APA, Harvard, Vancouver, ISO itp.

19

Thierry, Aurélien. "Désassemblage et détection de logiciels malveillants auto-modifiants." Electronic Thesis or Diss., Université de Lorraine, 2015. http://www.theses.fr/2015LORR0011.

Pełny tekst źródła

Streszczenie:

Cette thèse porte en premier lieu sur l'analyse et le désassemblage de programmes malveillants utilisant certaines techniques d'obscurcissement telles que l'auto-modification et le chevauchement de code. Les programmes malveillants trouvés dans la pratique utilisent massivement l'auto-modification pour cacher leur code utile à un analyste. Nous proposons une technique d'analyse hybride qui utilise une trace d'exécution déterminée par analyse dynamique. Cette analyse découpe le programme auto-modifiant en plusieurs sous-parties non auto-modifiantes que nous pouvons alors étudier par analyse sta

Style APA, Harvard, Vancouver, ISO itp.

20

Silva, Francisco Coelho da. "Estimador e caracterizador de consumo de energia para software embarcado." Universidade Federal do Amazonas, 2011. http://tede.ufam.edu.br/handle/tede/3288.

Pełny tekst źródła

Streszczenie:

Made available in DSpace on 2015-04-22T22:00:44Z (GMT). No. of bitstreams: 1 Francisco.pdf: 2605316 bytes, checksum: ee1fad3d9d9e7780947fc166b5909203 (MD5) Previous issue date: 2011-03-24<br>The energy consumption in the past years became a very important issue in embedded system projects. The high production and wide application of mobile devices have forced the emergence of various restrictions to this system, such as: weight, size and lifetime of batteries and multiple functionalities. Mobile devices works under limited power source that autonomy and lifetime are directly related to ene

Style APA, Harvard, Vancouver, ISO itp.

21

Ďuričeková, Daniela. "Statická analýza možných hodnot proměnných v programech v C." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236176.

Pełny tekst źródła

Streszczenie:

Value-range analysis is a static analysis technique based on arguing about the values that a variable may take on a given program point. It can be used to prove absence of run-time errors such as out-of-bound array accesses. Since value-range analysis collects information on each program point, data-flow analysis can be used in association with it. The main goal of this work is designing and implementing such a value-range analysis tool. The work begins with an introduction into the topic, an explanation of data-flow and value-range analyses and a description of abstract interpretation, which

Style APA, Harvard, Vancouver, ISO itp.

22

Peyret, Thomas. "Architecture matérielle et flot de programmation associé pour la conception de systèmes numériques tolérants aux fautes." Thesis, Lorient, 2014. http://www.theses.fr/2014LORIS348/document.

Pełny tekst źródła

Streszczenie:

Que ce soit dans l’automobile avec des contraintes thermiques ou dans l’aérospatial et lenucléaire soumis à des rayonnements ionisants, l’environnement entraîne l’apparition de fautesdans les systèmes électroniques. Ces fautes peuvent être transitoires ou permanentes et vontinduire des résultats erronés inacceptables dans certains contextes applicatifs. L’utilisation decomposants dits « rad-hard » est parfois compromise par leurs coûts élevés ou les difficultésd’approvisionnement liés aux règles d’exportation.Cette thèse propose une approche conjointe matérielle et logicielle indépendante de l

Style APA, Harvard, Vancouver, ISO itp.

23

Leslous, Mourad. "Highlight and execute suspicious paths in Android malware." Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S090/document.

Pełny tekst źródła

Streszczenie:

Les smartphones sont devenus omniprésents dans notre vie quotidienne à cause des options qu'ils proposent. Aujourd'hui, Android est installé sur plus de 80% des smartphones. Les applications mobiles recueillent une grande quantité d'informations sur l'utilisateur. Par conséquent, Android est devenu une cible préférée des cybercriminels. Comprendre le fonctionnement des malwares et comment les détecter est devenu un défi de recherche important. Les malwares Android tentent souvent d'échapper à l'analyse statique en utilisant des techniques telles que l'obfuscation et le chargement dynamique du

Style APA, Harvard, Vancouver, ISO itp.

24

El, Sibaïe Besognet Rémy. "Programmation Web Réactive dans un cadre typé statiquement pour l'orchestration de contenus multimédia riches." Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUS169/document.

Pełny tekst źródła

Streszczenie:

Le but de cette thèse est d'apporter de nouvelles possibilités au domaine de la programmation Web, dont les technologies répandues ne capturent pas toutes les problématiques engendrées par les interactions dans une application. Notre solution est un langage, Pendulum, inspiré de la programmation synchrone réactive en Esterel et se présentant comme une extension à OCaml. Il permet de gagner en sûreté et en expressivité en particulier dans la gestion d'interaction multiples. Dans une première partie, nous présentons notre perception de la programmation Web d'aujourd'hui en partant du standard po

Style APA, Harvard, Vancouver, ISO itp.

25

Laouadi, Rabah. "Analyse du flot de contrôle multivariante : application à la détection de comportements des programmes." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT255.

Pełny tekst źródła

Streszczenie:

Sans exécuter une application, est-il possible de prévoir quelle est la méthode cible d’un site d’appel ? Est-il possible de savoir quels sont les types et les valeurs qu’une expression peut contenir ? Est-il possible de déterminer de manière exhaustive l’ensemble de comportements qu’une application peut effectuer ? Dans les trois cas, la réponse est oui, à condition d’accepter une certaine approximation. Il existe une classe d’algorithmes − peu connus à l’extérieur du cercle académique − qui analysent et simulent un programme pour calculer de manière conservatrice l’ensemble des informations

Style APA, Harvard, Vancouver, ISO itp.

26

El, Sibaïe Besognet Rémy. "Programmation Web Réactive dans un cadre typé statiquement pour l'orchestration de contenus multimédia riches." Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS169.

Pełny tekst źródła

Streszczenie:

Le but de cette thèse est d'apporter de nouvelles possibilités au domaine de la programmation Web, dont les technologies répandues ne capturent pas toutes les problématiques engendrées par les interactions dans une application. Notre solution est un langage, Pendulum, inspiré de la programmation synchrone réactive en Esterel et se présentant comme une extension à OCaml. Il permet de gagner en sûreté et en expressivité en particulier dans la gestion d'interaction multiples. Dans une première partie, nous présentons notre perception de la programmation Web d'aujourd'hui en partant du standard po

Style APA, Harvard, Vancouver, ISO itp.

27

Cecchetto, Sylvain. "Analyse du flot de données pour la construction du graphe de flot de contrôle des codes obfusqués." Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0042.

Pełny tekst źródła

Streszczenie:

L’augmentation des cyberattaques dans le monde fait de l’analyse des codes malveillants un domaine de recherche prioritaire. Ces logiciels utilisent diverses méthodes de protection, encore appelées obfuscations, visant à contourner les antivirus et à ralentir le travail d’analyse. Dans ce contexte, cette thèse apporte une solution à la construction du Graphe de Flot de Contrôle (GFC) d’un code binaire obfusqué. Nous avons développé la plateforme BOA (Basic blOck Analysis) qui effectue une analyse statique d’un code binaire protégé. Pour cela, nous avons défini une sémantique s’appuyant sur l’o

Style APA, Harvard, Vancouver, ISO itp.

28

Laouadi, Rabah. "Analyse du flot de contrôle multivariante : application à la détection de comportements des programmes." Electronic Thesis or Diss., Montpellier, 2016. http://www.theses.fr/2016MONTT255.

Pełny tekst źródła

Streszczenie:

Sans exécuter une application, est-il possible de prévoir quelle est la méthode cible d’un site d’appel ? Est-il possible de savoir quels sont les types et les valeurs qu’une expression peut contenir ? Est-il possible de déterminer de manière exhaustive l’ensemble de comportements qu’une application peut effectuer ? Dans les trois cas, la réponse est oui, à condition d’accepter une certaine approximation. Il existe une classe d’algorithmes − peu connus à l’extérieur du cercle académique − qui analysent et simulent un programme pour calculer de manière conservatrice l’ensemble des informations

Style APA, Harvard, Vancouver, ISO itp.

29

Zanasi, Fabio. "Interacting Hopf Algebras- the Theory of Linear Systems." Thesis, Lyon, École normale supérieure, 2015. http://www.theses.fr/2015ENSL1020/document.

Pełny tekst źródła

Streszczenie:

Dans cette thèse, on présente la théorie algébrique IH par le biais de générateurs et d’équations.Le modèle libre de IH est la catégorie des sous-espaces linéaires sur un corps k. Les termes de IH sont des diagrammes de cordes, qui, selon le choix de k, peuvent exprimer différents types de réseaux et de formalismes graphiques, que l’on retrouve dans des domaines scientifiques divers, tels que les circuits quantiques, les circuits électriques et les réseaux de Petri. Les équations de IH sont obtenues via des lois distributives entre algèbres de Hopf – d’où le nom “Interacting Hopf algebras” (al

Style APA, Harvard, Vancouver, ISO itp.

30

Lee, Byeongcheol. "Call graph correction using control flow constraints." Thesis, 2006. http://hdl.handle.net/2152/30457.

Pełny tekst źródła

Streszczenie:

Dynamic optimizers for object-oriented languages collect a variety of profile data to drive optimization decisions. In particular, the dynamic call graph (DCG) informs key structural optimizations such as which methods to optimize and how to optimize them. Unfortunately, current low-overhead call-stack hardware and software sampling methods are subject to sampling bias, which loses accuracy of 40 to 50% when compared with a perfect call graph. This paper introduces DCG correction, a novel approach that uses static and dynamic control-flow graphs (CFGs) to improve DCG accuracy. We introduce the

Style APA, Harvard, Vancouver, ISO itp.

31

Gu, Chung Cheng, and 顧峻誠. "RTL Simulation on Control Data Flow Graph." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/34508739877326789518.

Pełny tekst źródła

Streszczenie:

碩士<br>國立清華大學<br>電機工程學系<br>89<br>In the top-down design flow, the RTL(Register Transfer Level) design is one of the most widely used design representations for Digital IC's. Therefore, it is important to ensure that the design functionality is correct at this level. Recently, the ASIC design is more and more complex and the functional verification takes more and more efforts accordingly. Very often, we need to debug an RTL code that has been proven incorrect. In this thesis, we present an RTL simulation platform based on Control Data Flow Graph (CDFG). Upon this platform, RTL diagnosis or code

Style APA, Harvard, Vancouver, ISO itp.

32

Hsieh, Ming-Shiang, and 謝明祥. "Scenario Control Graph: A Model to Control the Flow of Temporal Scenarios in Multimedia." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/31494304796405529173.

Pełny tekst źródła

Streszczenie:

碩士<br>國立臺灣大學<br>電機工程學系<br>85<br>In this article, we focus on the issues of temporal specification in multimedia and hypermedia. In the past years, many temporal modelshave been proposed for multimedia, such as Refined Temporal Model,Petri-Net, Interval-based Approach, Basic Hierarchical Specification, and Reference Points. Among them, the Refined Temporal Model (RTM), based ongraph and visualization, is a powerful and simple one.But RTM has also some disadvantages. First, it cannot be used

Style APA, Harvard, Vancouver, ISO itp.

33

Hsu, Chung-Han, and 許中瀚. "On the Usability of Control Flow Graph for Detecting Android Malware." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/43208484173393719995.

Pełny tekst źródła

Streszczenie:

碩士<br>國立臺灣海洋大學<br>資訊工程學系<br>102<br>The rapid development of mobile devices make it a valuable target for malicious attackers. Therefore, a lot of tools have been developed to detect malicious applications that attempt to compromise mobile devices. In this paper, we discuss the usability of control flow graphs (CFG) on detecting malicious applications. CFG is the representation used by the androguard tool to construct malicious signatures. We first develop an algorithm to automatically generate CFG-based signatures. However, although the resulted signature has a good detection rate (95%+), it a

Style APA, Harvard, Vancouver, ISO itp.

34

Islam, Shariq. "Code Based Analysis of Object-Oriented Systems Using Extended Control Flow Graph." Thesis, 2013. http://ethesis.nitrkl.ac.in/4753/1/109CS0324.pdf.

Pełny tekst źródła

Streszczenie:

The basic features of object-oriented software i.e. encapsulation, inheritance and poly- morphism makes it dicult to apply traditional testing methods to them. Traditional testing methods have been successfully implemented in procedural systems. One of the most commonly used example of white-box testing is basis path testing which ensures that every path of a program is executed at least once. Control Flow Graph(CFG) is a very well-known model that is used for identication of basis paths in procedural systems. McCabes cyclomatic complexity(CC) metric deter- mines that number of linearly indepe

Style APA, Harvard, Vancouver, ISO itp.

35

"Construction of GCCFG for Inter-procedural Optimizations in Software Managed Manycore (SMM)." Master's thesis, 2014. http://hdl.handle.net/2286/R.I.26839.

Pełny tekst źródła

Streszczenie:

abstract: Software Managed Manycore (SMM) architectures - in which each core has only a scratch pad memory (instead of caches), - are a promising solution for scaling memory hierarchy to hundreds of cores. However, in these architectures, the code and data of the tasks mapped to the cores must be explicitly managed in the software by the compiler. State-of-the-art compiler techniques for SMM architectures require inter-procedural information and analysis. A call graph of the program does not have enough information, and Global CFG, i.e., combining all the control flow graphs of the program has

Style APA, Harvard, Vancouver, ISO itp.

36

WENG, CI-ZONG, and 翁慈宗. "Graph theory with application on software engineering-automatic layout algorithm of data flow diagram and complexity of system control flow." Thesis, 1986. http://ndltd.ncl.edu.tw/handle/38527139044838426563.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Mohamed, ATEF. "Software Architecture-Based Failure Prediction." Thesis, 2012. http://hdl.handle.net/1974/7538.

Pełny tekst źródła

Streszczenie:

Depending on the role of software in everyday life, the cost of a software failure can sometimes be unaffordable. During system execution, errors may occur in system components and failures may be manifested due to these errors. These errors differ with respect to their effects on system behavior and consequent failure manifestation manners. Predicting failures before their manifestation is important to assure system resilience. It helps avoid the cost of failures and enables systems to perform corrective actions prior to failure occurrences. However, effective runtime error detection and fail

Style APA, Harvard, Vancouver, ISO itp.

38

Morkhande, Rahul Raj Kumar. "Characterization of Divergence resulting from Workload, Memory and Control-Flow behavior in GPGPU Applications." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5453.

Pełny tekst źródła

Streszczenie:

GPGPUs have emerged as high-performance computing platforms and are used for boosting the performance of general non-graphics applications from various scientifi c domains. These applications span varied areas like social networks, defense, bioinformatics, data science, med- ical imaging, uid dynamics, etc [3]. In order to efficiently exploit the computing potential of these accelerators, the application should be well mapped to the underlying architecture. As a result, different characteristics of behaviors can be seen in applications running on GPG- PUs. Applications are characterize

Style APA, Harvard, Vancouver, ISO itp.

39

Seidler, Steffen. "Über Minoren gerichteter Graphen." Master's thesis, 2010. https://tud.qucosa.de/id/qucosa%3A25569.

Pełny tekst źródła

Streszczenie:

Seit 1983 begründet die Publikationsreihe "Graph Minors" von N. Robertson und P.D. Seymour im Wesentlichen die Minorentheorie mit mächtigen Hilfsmitteln wie der Baumzerlegung und weitreichenden Resultaten wie dem Minorensatz. Für gerichtete Graphen existiert allerdings noch keine einheitliche Minorentheorie und verschiedene Ansätze werden in dieser Arbeit systematisiert. Einige gerichtete Versionen der Baumzerlegung (gerichtete Baumzerlegung nach B. Reed, arboreale, D- und DAG-Zerlegung) werden unter einheitlichen Aspekten untersucht. Die D-Weite ist dabei besonders vielversprechend. Enge Ver

Style APA, Harvard, Vancouver, ISO itp.

40

Shao, Danhua. "Application of local semantic analysis in fault prediction and detection." Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-05-1086.

Pełny tekst źródła

Streszczenie:

To improve quality of software systems, change-based fault prediction and scope-bounded checking have been used to predict or detect faults during software development. In fault prediction, changes to program source code, such as added lines or deleted lines, are used to predict potential faults. In fault detection, scope-bounded checking of programs is an effective technique for finding subtle faults. The central idea is to check all program executions up to a given bound. The technique takes two basic forms: scope-bounded static checking, where all bounded executions of a program are transfo

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!