• The Journal of the Korea Contents Association
• /
• v.6 no.1
• /
• pp.160-169
• /
• 2006

This paper describes the data structure for program analysis and optimization of bytecode level. First we create an extended CFG(Control Flow Graph). Because of the special properties of bytecode, we must adaptively extend the existing control flow analysis techniques. We build basic blocks to create the CFG and create various data that can be used for optimization. The created CFG can be tested for comprehension and maintenance of Java bytecode, and can also be used for other analyses such as data flow analysis. This paper implements CTOC's CTOC-BR(CTOC-Bytecode tRanslator) for control flow analysis of bytecode level. CTOC(Classes To Optimized Classes) is a Java bytecode framework for optimization and analysis. This paper covers the first part of the CTOC framework. CTOC-BR is a tool that converts the bytecode into tree form for easy optimization and analysis of bytecode in CTOC.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.876-880
• /
• 2009

A control flow graph(CFG) is an essential data structure for program analyses based on graph theory or control-/data- flow analyses. Esterel is an imperative synchronous language and its synchronous parallelism makes it difficult to construct a CFG of an Esterel program. In this work, we present a method to construct over-approximated CFGs for Esterel. Our method is very intuitive and generated CFGs include not only exposed paths but also invisible ones. Though the CFGs may contain some inexecutable paths due to complex combinations of parallelism and exception handling, they are very useful for other program analyses.

• International journal of advanced smart convergence
• /
• v.4 no.2
• /
• pp.14-19
• /
• 2015

Recently, water sewage disposal facilities are able to manage real-time data collection and record management through compact broadband modem LAN switching technology. Therefore, it needs more stable and efficient facility management. So, we required practical use of environmental facilities convergence based on broadband integrated modem. In this paper, we proposed short distance wireless communication network of compact broadband modem for sewage disposal facilities. And it received data inside of water treatment facility using the two communication methods (IEEE802.11x and IEEE802.15.4x). Then, our proposed an data-flow control algorithm of wireless network technology will prioritize processing data when emergency happen through collecting data, analysis data and processing. Lastly, we proved usefulness by experiment and simulation analysis.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.397-404
• /
• 2006

Successful software attacks require both injecting malicious code into a program's address space and altering the program's flow control to the injected code. Code section can not be changed at program's runtime, so malicious code must be injected into data section. Detoured flow control into data section is a signal of software attack. We propose a new software attack detection method which verify the target address of CALL, JMP, RET instructions, which alter program's flow control, and detect a software attack when the address is not in code section. Proposed method can detect all change of flow control related data, not only program's return address but also function pointer, buffer of longjmp() function and old base pointer, so it can detect the more attacks.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.643-650
• /
• 2004

Control flow graph is used for Performing many Program-analysis techniques, such as data-flow and control-dependence analysis, and software-engineering techniques, such as program slicing and testings. For these analyses to be safe and useful, the CFG should incorporate the exception flows that are induced by exceptions. In previous research to construct control flow graph, normal flows and exception flows are computed at the same time, since these two flows are known to be mutually dependent. By investigating realistic Java programs, we found that the cases when these two flows are mutually dependent rarely happen. So, we can decouple exception flow analysis from normal flow analysis. In this paper we propose an analysis that estimates exception flows. We also propose exception flow graph to represent exception flows. And we show that the control flow graph that accounts for exception flows can be constructed by merging exception flow graph onto normal control flow graph.

• Journal of KSNVE
• /
• v.6 no.5
• /
• pp.607-616
• /
• 1996

A combined computational fluid dynamics(CFD)-Kirchhoff method is presented for predicting high-speed impulsive noise generated by a hovering blade. Two types of Kirchhoff integral formula are used; one for the classical linear Kirchhoff formulation and the other for the nonlinear Kirchhoff formulation. An Euler finite difference solver is solved first to obtain the flow field close to the blade, and then this flow field is used as an input to a Kirchhoff formulation to predict the acoustic far-field. These formulas are used at Mach numbers of 0.90 and 0.95 to investigate the effectiveness of the linear and nonlinear Kirchhoff formulas for delocalized flow. During these calculiations, the retarded time equation is also carefully examined, in particular, for the cases of the control surface located outside of the sonic cylinder, where multiple roots are obtained. Predicted results of acoustic far-field pressure with the linear Kirchhoff formulation agree well with experimental data when the control surface is at the certain location(R=1.46), but the correlation is getting worse before or after this specific location of the control surface due to the delocalized nonlinear aerodynamic flow field. Calculations based on the nonlinear Kirchhoff equation using a linear sonic cylinder as a control surface show a reasonable agreement with experimental data in negative amplitudes for both tip Mach numbers of 0.90 and 0.95, except some computational integration problems over a shock. This concliudes that a nonlinear formulation is necessary if the control surface is close to the blade and the flow is delocalized.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.237-241
• /
• 2012

In wireless sensor networks, the importance of transporting data correctly with reliability is increasing gradually along with the need to support communications between the nodes and sink. Data flow from the sink to the nodes requires reliability for control or management that is very sensitive and intolerant of error; however, data flow from the nodes to the sink is relatively tolerant. In this paper, with emphasis on the data flow from the sink to the nodes, we propose a mechanism that considers accurate transport with reliability hop-by-hop. During the process of sending the data, if errors occur or data is missing, the proposed mechanism supports error recovery using a fixed window with selective acknowledgment. In addition, this mechanism supports congestion control depending on the buffer condition. Through the simulation, we show that this mechanism is accurate, reliable, and proper for transport in wireless sensor networks.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.723-736
• /
• 1999

Code optimization phase in a compiler are very important because the phase reduces the running time and the storage size of machine codes. I developed flow analyzers and optimizers on intermediate codes. The flow analyzers generate control-flow and data-flow information. The optimizers transform the intermediate codes into the improved codes using this information. This paper describes the development of flow analyzers and optimizers. I also examined the execution performance, the cost and the dependency of each optimization.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.41-47
• /
• 2000

Ideograph is a truly unifies data and procedural dependencies. Ideograph can be used to assist various program optimization, such as common expression elimination, code motion, constant folding etc. In this paper, we propose an improved representation of the data and control flow dependencies information for the efficient program execution. In pursuing this goal, we propose a model and in particularly implement a dependency information extractor and information table, which contains data and control flow information per a basic block And then we design and implementation of the optimized abstract syntax tree using Ideograph which has a control flow information and data flow information for source program.