Relevant bibliographies by topics / Control-dependence graph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Control-dependence graph'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Control-dependence graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Control-dependence graph"

1

Gautam, Pratiksha, and Hemraj Saini. "Non-Trivial Software Clone Detection Using Program Dependency Graph." International Journal of Open Source Software and Processes 8, no. 2 (April 2017): 1–24. http://dx.doi.org/10.4018/ijossp.2017040101.

Full text
Abstract:
Code clones are copied fragments that occur at different levels of abstraction and may have different origins in a software system. This article presents an approach which shows the significant parts of source code. Further, by using significant parts of a source code, a control flow graph can be generated. This control flow graph represents the statements of a code/program in the form of basic blocks or nodes and the edges represent the control flow between those basic blocks. A hybrid approach, named the Program Dependence Graph (PDG) is also presented in this article for the detection of non-trivial code clones. The program dependency graph approach consists of two approaches as a control dependency graph and a data dependency graph. The control dependency graph is generated by using a control flow graph. This article proposes an approach which can easily generate control flow graphs and by using control flow graph and reduced flowgraph approach, the trivial software clone, a similar textual structure, can be detected.The proposed approach is based on a tokenization concept.
APA, Harvard, Vancouver, ISO, and other styles
2

NAKAI, Satoru, and Akio NODA. "Sequence Control Program Analysis by Directed Graph of Data Dependence." Transactions of the Society of Instrument and Control Engineers 50, no. 1 (2014): 24–29. http://dx.doi.org/10.9746/sicetr.50.24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cytron, Ron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. "Efficiently computing static single assignment form and the control dependence graph." ACM Transactions on Programming Languages and Systems 13, no. 4 (October 1991): 451–90. http://dx.doi.org/10.1145/115372.115320.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mikov, A. I. "Connectivity of dynamic graphs in multiply connected spaces." Informatization and communication, no. 2 (April 30, 2020): 108–13. http://dx.doi.org/10.34219/2078-8320-2020-11-2-108-113.

Full text
Abstract:
Dynamic geometric graphs are natural mathematical models of many real-world systems placed and moving in space: computer ad hoc networks, transport systems, territorial distributed systems for various purposes. An important property of such graphs is connectivity, which is difficult to maintain during movement due to the presence of obstacles on the ground. In this paper, a model of a multiply connected region with obstacles of the “city blocks” type is constructed and the behavior of the characteristics of dynamic graphs located in such domains is studied. A probabilistic approach to the study of graphs is proposed, in which their characteristics are considered as random processes. For graphs of different scales, dependences of the connectivity probability, the number of components on the parameters of a multiply connected region, and the radius of stable signal reception / transmission were found. The mathematical expectation of the number of components in the starting random geometric graph is found. The significant influence not only of geometrical parameters, but also of the topological characteristics of a multiply-connected domain has been revealed. Graphs of changes in the probability of connectedness of a dynamic graph over time are constructed on the basis of calculating the average value over the set of realizations of the random process of moving network nodes. They are characterized by a periodic component that correlates with the structure of a multiply connected region, and a component that exponentially decreases with time. The dependence of the probability of connectedness of the graph on the direction of the network displacement vector was studied, which turned out to be very significant. The results obtained give an idea of the influence of a multiply-connected domain on the dynamics of graphs, and can be used in control algorithms for mobile distributed systems to ensure their spatial connectivity.
APA, Harvard, Vancouver, ISO, and other styles
5

Medynskyi, Denys, and Iryna Borets. "STUDY OF THE PROBLEM OF OPTIMAL MAINTENANCE OF UNMANNED AERIAL VEHICLES IN CONDITIONS OF A SHORTAGE OF VEHICLES." EUREKA: Physics and Engineering 2 (March 31, 2020): 47–57. http://dx.doi.org/10.21303/2461-4262.2020.001170.

Full text
Abstract:
The ways to find the ways of solving the problem of optimal service for unmanned aerial vehicles in the conditions of vehicle shortage are explored. In the study of theory of optimal control and discrete optimization insufficiently explored the problem of optimal graph coverage by the chains of a fixed pattern with the help of a description system of ordinary differential equations. With the help of the graph theory investigated the optimization problem of the «Upper Cover» for unmanned aerial vehicles service in the conditions of vehicle shortage has been solved. Study of the problem relates to the mathematical dependence of transport systems. It can be used for determination of the optimal ratio between the amount of Unmanned Aerial Vehicles and fuel (electricity) reserves used by the Unmanned Aerial Vehicles. The method of solving the problem of determining the weight of the arcs of the graph and the problem of constructing a chain is based on that dependence. Part of the problem is the task of docking. The combinatorial task of choosing a set of stations for servicing points of the initial unmanned aerial vehicles dislocation is based on the dependence mentioned. Effective method for solving the problem of optimal coverage of a graph for supply chains with constraints is developed on the bases of the dependence. The proposed research methods can significantly reduce the cost of delivery of urgent goods using unmanned aerial vehicles. The proposed research methods can significantly reduce the cost of delivery of urgent goods using unmanned aerial vehicles. Perspective of further researches is studying of mathematical model of optimal servicing the delivery areas in the conditions of the lack of UAV. The constraints for practical purposes must have a group-theoretical approach to solving optimization problems and be reduced for the constructing an optimal cost matrix analysis. Algebraic approach is used, when there is a need in solving a large set of similar types of optimization problems with different constraints in the right hand side only. It is possible to apply a heuristic algorithm for solving the problem of optimal UAV service. The problem means optimal coverage of a special graph with chains with restriction on the chain length
APA, Harvard, Vancouver, ISO, and other styles
6

Kuzeev, I. R., A. S. Valiev, and V. Yu Pivovarov. "Influence of Alternating Current Frequency on Output Voltage at Electromagnetic Method of Metal Control." Materials Science Forum 945 (February 2019): 879–84. http://dx.doi.org/10.4028/www.scientific.net/msf.945.879.

Full text
Abstract:
The equipment of oil refineries and other hazardous production facilities operate under high pressures and temperatures. Such operation conditions require continuous control and equipment remaining operation life period assessment. The existing methods of diagnostics are based on probabilistic remaining life assessment and use data regarding wall thickness variation during the operation process. The present article presents the method of accumulated damage assessment and its approximation to the limiting state, based on electromagnetic processes studying by means of eddy current control method. The main purpose of studies was determination of optimal value of input signal frequency, which could the most informative for determination of regularity of electric signal parameters change depending on the level of accumulated damages. Steel grade 09Г2С samples were used as the subject of studies. The samples were exposed to static tension under constant rate and during the process of samples deformation we measured the value of electric signal under three frequencies: 100 Hz, 10 kHz, and 1 MHz Based on the obtained results we prepared output signal voltage-relative elongation dependencies, which showed that accumulation of plastic deformations in metal leads to reduction of signal amplitude. Particularly interesting was dependence under 1 MHz frequency, under which electromagnetic processes occur in subsurface and surface layers. This dependence was of some regular nature, which was described by means of the sinusoidal function. Graph of the obtained function qualitatively describes the experimental dependence. On the basis of obtained results we can make a conclusion that optimal input signal frequency is within megahertz range, under which difference between the sinusoidal function graph and the empirical curve is minimum.
APA, Harvard, Vancouver, ISO, and other styles
7

Sun, Yu Qiang, A. Ling Yin, Xiao Kang Wang, and Qiao Ying Liu. "Parallel Study of Integrated Test in Software Testing Process." Advanced Materials Research 468-471 (February 2012): 2459–62. http://dx.doi.org/10.4028/www.scientific.net/amr.468-471.2459.

Full text
Abstract:
With the view of the phenomenon that different test modules have significant differences in the assembly test system, and there is some dependence between these modules, through the dependence theory of the parallel technology, there is the possibility of parallelization used in the integrated test system. In this paper, we analyses various control flows of each program or relation between the modules, and then gets all kinds of dependency between these modules, at the same time transforms the dependency into control flow graph, lastly gets the dependency of actual test cases. On this basis, according to the former implementation plan in parallel research, we can arrange parallel orders of modules the integrated test system, it can effectively improve the efficiency of software testing, and greatly saves the test time.
APA, Harvard, Vancouver, ISO, and other styles
8

Sahu, Madhusmita. "Conditioned Slicing of Interprocedural Programs." International Journal of Rough Sets and Data Analysis 6, no. 1 (January 2019): 43–60. http://dx.doi.org/10.4018/ijrsda.2019010103.

Full text
Abstract:
Program slicing is a technique to decompose programs depending on control flow and data flow amongst several lines of code in a program. Conditioned slicing is a generalization of static slicing and dynamic slicing. A variable, the desired program point, and a condition of interest form a slicing criterion for conditioned slicing. This paper proposes an approach to calculate conditioned slices for programs containing multiple procedures. The approach is termed Node-Marking Conditioned Slicing (NMCS) algorithm. In this approach, first and foremost step is to build an intermediate symbolization of a given program code and the next step is to develop an algorithm for finding out conditioned slices. The dependence graph, termed System Dependence Graph (SDG), is used to symbolize intermediate presentation. After constructing SDG, the NMCS algorithm chooses nodes that satisfy a given condition by the process of marking and unmarking. The algorithm also finds out conditioned slices for every variable at every statement during the process. NMCS algorithm employs a stack to save call context of a method. Few edges in SDG are labeled to identify the statement that calls a method. The proposed algorithm is implemented, and its performance is tested with several case study projects.
APA, Harvard, Vancouver, ISO, and other styles
9

Davydov, M. N., A. P. Lipatova, and Yu S. Tkachenko. "Methods for Estimating the Actual Size of Defects Based on the Lengths of Their Frontal Images." Proceedings of the Southwest State University 23, no. 2 (July 9, 2019): 18–28. http://dx.doi.org/10.21869/2223-1560-2019-23-2-18-28.

Full text
Abstract:
Purpose of research. The present paper concerns the close analysis of detecting the sizes of defects and ways of their identification. The aim is to solve the problem of rational choice of equipment, which will make it possible to fully, clearly and reliably judge the quality of the product. This is important because, depending on the material of the product, the resulting defect sizes may vary.Methods. For this purpose, this article discusses a method for determining the actual size of defects’ images in ultrasonic control of export oil pump cases made of 20GL steel grade using a flaw detector with digital-focused antenna arrays. The paper describes the main differences in the configuration of equipment that uses different techniques of image restoration, and the feasibility of applying multi-channel sensors for the control of this type parts. The design of the antenna array and phased antenna array has been considered as well as the principle of operation of sensors with phased array antenna and digital phased array antenna. The study of the cast body of export oil pump has been completed, during which defects such as “microporosity” was found. There have been identified their maximum permissible front distances and the formula to determine their actual size has been deduced. The dependence of frontal sizes of defect images on the depth of their occurrence in the product has been considered.Results. According to the obtained data, a graph of dependence of the frontal size of a defect image on the depth of occurrence has been constructed. Using this graph, it is possible to determine the maximum permissible sizes of defect images for intermiary depth, excluding calculations, which confirms the economic efficiency in the analysis of the control results using this method.Conclusion. The authors substantiate the feasibility of using equipment with phased array antenna and digital phased array antenna.
APA, Harvard, Vancouver, ISO, and other styles
10

Rus, Teodor, and Eric van Wyk. "Using Model Checking in a Parallelizing Compiler." Parallel Processing Letters 08, no. 04 (December 1998): 459–71. http://dx.doi.org/10.1142/s0129626498000468.

Full text
Abstract:
In this paper we describe the usage of temporal logic model checking in a parallelizing compiler to analyze the structure of a source program and locate opportunities for optimization and parallelization. The source program is represented as a process graph in which the nodes are sequential processes and the edges are control and data dependence relationships between the computations at the nodes. By labeling the nodes and edges with descriptive atomic propositions and by specifying the conditions necessary for optimizations and parallelizations as temporal logic formulas, we can use a model checker to locate nodes of the process graph where particular optimizations can be made. To discover opportunities for new optimizations or modify existing ones in this parallelizing compiler, we need only specify their conditions as temporal logic formulas; we do not need to add to or modify the code of the compiler. This greatly simplifies the process of locating optimization and parallelization opportunities in the source program and makes it easier to experiment with complex optimizations. Hence, this methodology provides a convenient, concise, and formal framework in which to carry out program optimizations by compilers.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Control-dependence graph"

1

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/.

Full text
Abstract:
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 an empirical study of irreducibility in current versions of open source software, and then compare them with older versions of the same software. We also study machine-generated C code from a variety of different software tools. We show that irreducibility is no longer a problem, and is becoming less so with time. We then address the problem of constructing the VSDG. Since previous approaches in the literature have been poorly documented or ignored altogether, we give our approach to constructing the VSDG from a common IR: the Control Flow Graph. We show how our approach is independent of the source and target language, how it is able to handle unstructured control flow, and how it is able to transform irreducible programs on the fly. Once the VSDG is constructed, we implement Lawrence's proceduralisation algorithm in order to encode an evaluation strategy whilst translating the program into a parallel representation: the Program Dependence Graph. From here, we implement scheduling and then code generation using the LLVM compiler. We compare our compiler framework against several existing compilers, and show how removing control flow with the VSDG and then restoring it later can produce high quality code. We also examine specific situations where the VSDG can put pressure on existing code generators. Our results show that the VSDG represents a radically different, yet practical, approach to compilation.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
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-dependence graphs over the execution. These graphs can be used to determine which conditional statements that resulted in a certain outcome. The tool has been developed for x86 Linux systems using the dynamic binary instrumentation framework PIN, developed and maintained by Intel. Techniques for utilizing the additional information about the control flow for a program available during the dynamic analysis in order to improve the control flow information have been implemented and tested. The basic theory of dynamic analysis as well as dynamic slicing is discussed, and a basic overview of the implementation of a dynamic analysis tool is presented. The impact on the performance of the dynamic analysis tool for the techniques used to improve the control flow graph is significant, but approaches to improving the performance are discussed.
APA, Harvard, Vancouver, ISO, and other styles
3

Léchenet, Jean-Christophe. "Certified algorithms for program slicing." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC056/document.

Full text
Abstract:
La simplification syntaxique, ou slicing, est une technique permettant d’extraire, à partir d’un programme et d’un critère consistant en une ou plusieurs instructions de ce programme, un programme plus simple, appelé slice, ayant le même comportement que le programme initial vis-à-vis de ce critère. Les méthodes d’analyse de code permettent d’établir les propriétés d’un programme. Ces méthodes sont souvent coûteuses, et leur complexité augmente rapidement avec la taille du code. Il serait donc souhaitable d’appliquer ces techniques sur des slices plutôt que sur le programme initial, mais cela nécessite de pouvoir justifier théoriquement l’interprétation des résultats obtenus sur les slices. Cette thèse apporte cette justification pour le cas de la recherche d’erreurs à l’exécution. Dans ce cadre, deux questions se posent. Si une erreur est détectée dans une slice, cela veut-il dire qu’elle se déclenchera aussi dans le programme initial ? Et inversement, si l’absence d’erreurs est prouvée dans une slice, cela veut-il dire que le programme initial en est lui aussi exempt ? Nous modélisons ce problème sur un mini-langage impératif représentatif, autorisant les erreurs et la non-terminaison, et montrons le lien entre la sémantique du programme initial et la sémantique de sa slice, ce qui nous permet de répondre aux deux questions précédentes. Pour généraliser ces résultats, nous nous intéressons à la première brique d’un slicer indépendant du langage : le calcul générique des dépendances de contrôle. Nous formalisons une théorie élégante de dépendances de contrôle sur des graphes orientés finis arbitraires prise dans la littérature et améliorons l’algorithme de calcul proposé.Pour garantir un maximum de confiance dans les résultats, tous ces travaux sont prouvés dans l’assistant de preuve Coq ou dans l’outil de preuve Why3
Program slicing is a technique that extracts, given a program and a criterion that is one or several instructions in this program, a simpler program, called a slice, that has the same behavior as the initial program with respect to the criterion. Program analysis techniques focus on establishing the properties of a program. These techniques are costly, and their complexity increases with the size of the program. Therefore, it would be interesting to apply these techniques on slices rather than the initial program, but it requires theoretical foundations to interpret the results obtained on the slices. This thesis provides this justification for runtime error detection. In this context, two questions arise. If an error is detected in the slice, does this mean that it can also be triggered in the initial program? On the contrary, if the slice is proved to be error-free, does this mean that the initial program is error-free too? We model this problem using a small representative imperative language containing errors and non-termination, and establish the link between the semantics of the initial program and of its slice, which allows to give a precise answer to the two questions raised above. To apply these results in a more general context, we focus on the first step towards a language-independent slicer: an algorithm computing control dependence. We formalize an elegant theory of control dependence on arbitrary finite directed graphs taken from the literature and improve the proposed algorithm. To ensure a high confidence in the results, we prove them in the Coq proof assistant or in the Why3 proof plateform
APA, Harvard, Vancouver, ISO, and other styles
4

Hammer, Christian. "Information flow control for Java a comprehensive approach based on path conditions in dependence graphs." Karlsruhe Univ-Verl. Karlsruhe, 2009. http://d-nb.info/996983112/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hammer, Christian [Verfasser], and G. [Akademischer Betreuer] Snelting. "Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs / Christian Hammer ; Betreuer: G. Snelting." Karlsruhe : KIT Scientific Publishing, 2009. http://d-nb.info/1185493255/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Graf, Jürgen [Verfasser], and G. [Akademischer Betreuer] Snelting. "Information Flow Control with System Dependence Graphs - Improving Modularity, Scalability and Precision for Object Oriented Languages / Jürgen Graf ; Betreuer: G. Snelting." Karlsruhe : KIT-Bibliothek, 2016. http://d-nb.info/1129258866/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
Abstract:
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 failure prediction techniques encounter a prohibitive challenge with respect to the control flow representation of large software systems with intricate control flow structures. In this thesis, we provide a technique for failure prediction from runtime errors of large software systems. Aiming to avoid the possible difficulties and inaccuracies of the existing Control Flow Graph (CFG) structures, we first propose a Connection Dependence Graph (CDG) for control flow representation of large software systems. We describe the CDG structure and explain how to derive it from program source code. Second, we utilize the proposed CDG to provide a connection-based signature approach for control flow error detection. We describe the monitor structure and present the error checking algorithm. Finally, we utilize the detected errors and erroneous state parameters to predict failure occurrences and modes during system runtime. We craft runtime signatures based on these errors and state parameters. Using system error and failure history, we determine a predictive function (an estimator) for each failure mode based on these signatures. Our experimental evaluation for these techniques uses a large open-source software (PostgreSQL 8.4.4 database system). The results show highly efficient control flow representation, error detection, and failure prediction techniques. This work contributes to software reliability by providing a simple and accurate control flow representation and utilizing it to detect runtime errors and predict failure occurrences and modes with high accuracy.
Thesis (Ph.D, Computing) -- Queen's University, 2012-09-25 23:44:12.356
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Control-dependence graph"

1

Hammer, Christian. Information flow control for java: A comprehensive approach based on path conditions in dependence graphs. Karlsruhe: Univ.-Verl., 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Control-dependence graph"

1

Chalupa, Marek, David Klas̆ka, Jan Strejček, and Lukás̆ Tomovic̆. "Fast Computation of Strong Control Dependencies." In Computer Aided Verification, 887–910. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_41.

Full text
Abstract:
AbstractWe introduce new algorithms for computing non-termination sensitive control dependence (NTSCD) and decisive order dependence (DOD). These relations on vertices of a control flow graph have many applications including program slicing and compiler optimizations. Our algorithms are asymptotically faster than the current algorithms. We also show that the original algorithms for computing NTSCD and DOD may produce incorrect results. We implemented the new as well as fixed versions of the original algorithms for the computation of NTSCD and DOD. Experimental evaluation shows that our algorithms dramatically outperform the original ones.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Control-dependence graph"

1

Natour, I. A. "On the control dependence in the program dependence graph." In the 1988 ACM sixteenth annual conference. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/322609.322862.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sinha, Saurabh, Mary Jean Harrold, and Gregg Rothermel. "System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow." In the 21st international conference. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/302405.302675.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

karuthedath, Abdul vahab, Sreekutty Vijayan, and Vipin Kumar K. S. "System Dependence Graph based test case generation for Object Oriented Programs." In 2020 International Conference on Power, Instrumentation, Control and Computing (PICC). IEEE, 2020. http://dx.doi.org/10.1109/picc51425.2020.9362460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pena, Aldo Benhumea, Leticia Davila-Nicanor, Carlos Omar Gonzalez-Moran, and Giner Alor-Hernandez. "Predictive model to determine quality of service on Cloud Computing: Service Dependence Graph." In 2016 IEEE 13th International Conference on Networking, Sensing and Control (ICNSC). IEEE, 2016. http://dx.doi.org/10.1109/icnsc.2016.7478997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jia, Wen-Chao, Rong-Gui Hu, Yong-Yi Wang, and Xue-Meng Li. "A Method for Multi-dimension Evaluation on Vulnerability Based on Program Dependence Graph." In 2015 Fifth International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC). IEEE, 2015. http://dx.doi.org/10.1109/imccc.2015.45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ferrandi, Fabrizio, Marco Lattuada, Christian Pilato, and Antonino Tumeo. "Performance estimation for task graphs combining sequential path profiling and control dependence regions." In 2009 7th IEEE/ACM International Conference on Formal Methods and Models for Co-Design (MEMOCODE). IEEE, 2009. http://dx.doi.org/10.1109/memcod.2009.5185389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Vance, John M., Ashish Sharma, and Nijesh Jayakar. "Effect of Frequency and Design Parameters on Pocket Damper Seal Performance." In ASME 2002 International Mechanical Engineering Congress and Exposition. ASMEDC, 2002. http://dx.doi.org/10.1115/imece2002-32561.

Full text
Abstract:
Pocket damper seals can produce large amounts of damping in turbomachines where the working fluid is compressible. Even with non-optimum design configurations, they have solved rotordynamic instability problems in high-pressure compressors. They do not rely on viscous effects, so they are ideal for oil-free applications. It is shown here that proper sizing of the seal pockets can maximize the damping. Significant parameters and variables have been identified, both experimentally and theoretically, that reflect the fundamental effects of the pocket damper seal to produce rotordynamic damping. Dimensionless analysis was performed, resulting in significant Pi groups involving damping, stiffness and leakage parameters. Of particular interest is a Helmholtz Pi group that shows 1) the benefit from optimizing the volume of the pockets around the seal, and 2) the frequency dependence of the seal. Dimensionless prediction equations are shown graphically. The graphs were generated by a computer code that uses a single control volume model. The code has been verified experimentally on several different seal test rigs with data taken at different vibration frequencies spaced an octave apart.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Control-dependence graph' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography