• Proceedings of The KACE
• /
• 2017.08a
• /
• pp.29-30
• /
• 2017

W-grammar(Van Wijngaarden grammar)[1].란 형식 문법의 한 종류인 문맥 자유 문법(Context-free grammar, CFG)의 대안으로, 두 개의 CFG가 서로 상호작용하면서 언어를 정의하도록 구성된 문법을 말하며 그 구성상의 특징을 감안하여 2-level grammar라고도 부른다. 현재 많은 프로그래밍 언어는 CFG를 기반으로 구성되어 있는데, 본 연구에서는 W-grammar로 교육용 프로그래밍 언어를 정의하여 CFG 기반이 아닌 W-grammar 프로그래밍 언어의 진입점을 제공함과 동시에 기저의 문법에 따른 계산가능성에 대해서 연구하는 토대를 쌓는 것을 목표로 한다.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.197-206
• /
• 2008

The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis, and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form in order to efficiently process the loops, and exhibits the procedures for generating the loop tree.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.225-227
• /
• 2022

CFI(Control Flow Integrity)는 제어 흐름을 검증해 프로그램을 보호하는 기법이다. Windows에서는 CFG(Control Flow Guard)란 이름으로 CFI 를 지원하고 LLVM 에서는 동일하게 CFI 란 이름으로 지원한다. 본 논문에서는 Windows CFG 의 몇 가지 한계점을 LLVM IFCC 와 비교해서 찾아보고 대안책을 제안한다. CFG 에 성능, 확장성, 보안 측면에서 LLVM IFCC 와 비교하여 한계점이 존재한다는 것을 확인하였다. 본 논문에서는 각 항에 대한 이론적 근거를 제시하고 문제를 해결할 수 있는 몇 가지 대응책을 소개한다.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.939-946
• /
• 2006

Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. In order to overcome such disadvantages, bytecode analysis and optimization must be performed. We implements CTOC for optimized codes. An extended CFG must be first created in order to analyze and optimize a bytecode. Due to unique bytecode properties, the existing CFG must be expanded according to the bytecode. Furthermore, the CFG must be converted into SSA Form for a static analysis, for which calculation is required for various information such as the dominate relation, dominator tree, immediate dominator, $\phi$-function, rename, and dominance frontier. This paper describes the algorithm and the process for converting the existing CFG into the SSA From. The graph that incorporates the SSA Form is later used for type inference and optimization.

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

• Geomechanics and Engineering
• /
• v.20 no.2
• /
• pp.155-164
• /
• 2020

In recent years, the stability, safety and comfort of trains has received increased attention. The mechanical characteristics and differential settlement of the foundation are the main problems studied in high-speed railway research. The mechanical characteristics and differential settlement of the foundation are greatly affected by the ground treatment. Additionally, the effects of train load and earthquakes have a great impact. The dynamic action of the train will increase the vibration acceleration of the foundation and increase the cumulative deformation, and the earthquake action will affect the stability of the substructure. Earthquakes have an important practical significance for the dynamic analysis of the railway operation stage; therefore, considering the impact of earthquakes on the railway substructure stability has engineering significance. In this paper, finite element model of the CFG (Cement Fly-ash Gravel) pile + cement-soil compacted pile about composite foundation is established, and manual numerical incentive method is selected as the simulation principle. The mechanical characteristics and differential settlement of CFG pile + cement-soil compacted pile about composite foundation under train load are studied. The results show: under the train load, the neutral point of the side friction about CFG pile is located at nearly 7/8 of the pile length; the vertical dynamic stress-time history curves of the cement-soil compacted pile, CFG pile and soil between piles are all regular serrated shape, the vertical dynamic stress of CFG pile changes greatly, but the vertical dynamic stress of cement-soil compacted pile and soil between piles does not change much; the vertical displacement of CFG pile, cement-soil compacted pile and soil between piles change very little.

• Korean Journal of Food Science and Technology
• /
• v.47 no.2
• /
• pp.149-157
• /
• 2015

The effects of feed moisture content (25, 35, and 45%), screw speed (230, 250, and 270 rpm), and barrel temperature (130, 140, and $150^{\circ}C$) on the product yield and soluble arabinoxylan (SAX) content from destarched corn fiber (DCF), and its optimization were investigated. The yield and SAX content of corn fiber gum (CFG) from the extruded destarched corn fiber (EDCF) were higher than those of DCF. Statistical analyses revealed that the feed moisture content and barrel temperature had a significant effect on the CFG yield and total SAX content. The optimum extrusion pretreatment conditions were as follows: feed moisture content, 30%; screw speed, 260 rpm; barrel temperature, $133^{\circ}C$. This study showed that the response surface methodology was suitable for the optimization of the extrusion conditions used to maximize the CFG yield and total SAX content from EDCF.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.27-35
• /
• 2008

The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis. and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form In order to efficiently process the loops, and exhibits the procedures for generating the loop tree.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.5
• /
• pp.985-991
• /
• 2009

A grammar-based test case generation (GBTG) algorithm takes a grammar G and generates a subset of the language L(G) accepted by G, and called test cases for software product testing. As most languages specified with CFG are recursive, usually L(G) is so large that it is not practical to execute all the of the generated cases. Therefore, this paper presents some "tags" : extra-grammatical annotations which are designed to restrict the generation. A number of control mechanisms have been developed to prune the number of test cases generated while still producing a test set that covers the majority of inputs to the system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.958-963
• /
• 2008

Korean language has different structural properties which are controlled by semantic constraints of verbs. Also, most of Korean sentences are complex sentences which consisted of main clause and embedded clause. Therefore it is difficult to describe appropriate syntactic grammar or constraint for the Korean language and the Korean parsing causes various syntactic ambiguities. In this paper, we suggest how to describe CFG-based grammar using sentence patterns as syntactic constraint and solve syntactic ambiguities. To solve this, we classified 44 sentence patterns including complex sentences which have subordinate clause in Korean sentences and used it to reduce syntactic ambiguity. However, it is difficult to solve every syntactic ambiguity using the information of sentence patterns. So, we used semantic markers with semantic constraint. Semantic markers can be used to solve ambiguity by auxiliary particle or comitative case particle.