• Title/Summary/Keyword: control flow graph

Search Result 105, Processing Time 0.03 seconds

A Design and Implementation of Combustor Control System (연소기 제어 시스템 설계 및 구현)

  • Chang, Jun-Hyup;Kim, Kun-Woo;Jeon, Chang-Ho;Keum, Tae-Hoon;Kim, Seung-Gon;Lee, Sang-Jun;Lee, Won-Joo
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2011.06a
    • /
    • pp.127-128
    • /
    • 2011
  • 본 논문에서는 Flow 모니터링 및 제어, Graph 출력, Test, History 등의 기능을 제공하는 연소기 제어 시스템을 설계하고 구현한다. Flow 모니터링 및 제어 기능은 각 채널의 현재 유량을 표시하고, 제어할 수 있다. Graph 출력 기능은 현재 채널의 상태를 그래프로 나타낸다. Test는 현재 구성된 환경이 정상적으로 동작하는지 시험하는 기능을 제공하며, Setting은 각 채널의 채널명, Point set, Range, 허용오차를 설정한다. 그리고 History는 저장된 데이터를 읽어와 Error기록, 사용자에 의해 저장된 데이터, 24시간마다 자동 저장되는 데이터를 그래프로 표시해 준다. 본 논문에서 제안한 연소기 제어 시스템을 이용해서 실제 유량을 측정한 결과, 정확한 유량의 측정을 할 수 있었다.

  • PDF

The Analysis of an Extended Mark Flow Graph's Operation for Design of the Discrete-event Control System (이산제어시스템 설계를 위한 확장된 마크흐름선도의 동작해석)

  • Yeo, Jeong-Mo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.7
    • /
    • pp.1896-1907
    • /
    • 1998
  • 확장된 마크흐름선도(EMFG: Extednded Mark Flow Graph)는 기존의 MFG를 개선한 그래프로서, 회로변수식에 의해 실제회로로 쉽게 구현가능하므로 이산제어시스템의 모델링과 설계 및 구현의 강력한 도구로 사용될 수 있다. 본 논문은 EMFG의 트랜지션들이 점화하는 과정 및 트랜지션들이 점화완료하였을 때 각 박스들의 마크수 변화를 부울함수식과 벡터를 사용하여 표현하였다. 또한 시스템의 상태변화를 쉽게 판단할 수 있게 하는 EMFG의 동작알고리듬을 제안하였으며, 제안된 알고리듬은 3-비트 증가계수기를 설계한 EMFG와 시간트랜지션이 포함된 가상의 EMFG에서 잘 수행되었다. EMFG의 동작이 부울함수로 해석가능해짐으로 인해 시스템의 분석 및 설계가 용이하며 컴퓨터를 이용한 자동화된 시스템의 분석과 설계가 가능하다.

  • PDF

A Object-oriented Program Dependency Graph for Object-oriented Program Representation (객체지향 프로그램 표현을 위한 객체지향 프로그램 종속성 그래프)

  • Ryu, Hee-Yeol;Park, Joong-Yang;Park, Jae-Heung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.10
    • /
    • pp.2567-2574
    • /
    • 1998
  • Many software engineering tools and techniques rely on fraphic representations of software, such as control flow graphs, program dependene graphs, or system dependence graphs. Existing graphic representations for object-oriented programs are compkicated, reduplicated. We thus propose a new graphic representation for object-oriented programs. Object-oriented Program Dependency Graph (OPDG). An OPDG consists of class dependence graph, class hierarchy graph and procedure dependence graph. Other features of OPDG are (1) the representation is compact; (2) the representation is easy to extend for the incremental development of a program; and (3) the repreesentation can be extended to provide dynamic information.

  • PDF

Water loss Control in DMA Monitoring System Used Wireless Technology

  • Malithong, P.;Gulphanich, S.;Suesut, T.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.773-777
    • /
    • 2005
  • This article is about using information technology to apply with water loss inspection system in District Metering Area (DMA). Inspector can check Flow rate and Minimum Night Flow; NMF via Smart Phone or PDA include sending SMS Alert in case the Pressure, Flow rate and NMF is over the range of controlling. This will be used as equipment to implement water loss in international proactive and can keep on water loss reduction more efficiency. The system consists of Data Logger which collects data of Flow rate from DMA Master Meter. PC is Wap Server which dial via modem in order to get data through FTP Protocal that will convert text file to Microsoft Access Database. Wappage will use xhtml language to show database on Wapbrowser and can show the result on Smart Phone or PDA by graph and table for system analysis.

  • PDF

Generating Verification Conditions from BIRS Code using Basic Paths for Java Bytecode Verification (자바 바이트코드 검증을 위해 기본경로를 통한 BIRS 코드로부터 검증조건 생성)

  • Kim, Je-Min;Kim, Seon-Tae;Park, Joon-Seok;Yoo, Weon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.8
    • /
    • pp.61-69
    • /
    • 2012
  • BIRS is an intermediate representation for verifying Java program. Java program in the form of bytecode could be translated into BIRS code. Verification conditions are generated from the BIRS code to verify the program. We propose a method generating verification conditions for BIRS code. Generating verification conditions is composed of constructing control flow graph for BIRS code, depth first searching for the control flow graph to generate basic paths, and calculating weakest preconditions of the basic paths.

Efficient method for finding patched vulnerability with code filtering in Apple iOS (코드 필터링 기법을 이용한 iOS 환경에서의 패치 분석 방법론)

  • Jo, Je-gyeong;Ryou, Jae-cheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.5
    • /
    • pp.1021-1026
    • /
    • 2015
  • Increasing of damage by phishing, government and organization response more rapidly. So phishing use malware and vulnerability for attack. Recently attack that use patch analysis is increased when Microsoft announce patches. Cause of that, researcher for security on defense need technology of patch analysis. But most patch analysis are develop for Microsoft's product. Increasing of mobile environment, necessary of patch analysis on mobile is increased. But ordinary patch analysis can not use mobile environment that there is many file and small size. So we suggest this research that use code filtering instead of Control Flow Graph and Abstract Syntax Tree.

Cross-architecture Binary Function Similarity Detection based on Composite Feature Model

  • Xiaonan Li;Guimin Zhang;Qingbao Li;Ping Zhang;Zhifeng Chen;Jinjin Liu;Shudan Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2101-2123
    • /
    • 2023
  • Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

The Study for Implementation method of Concurrency Control for DataBase Flow Graphs (DBFG를 이용한 동시성제어 구현 방법에 관한 연구)

  • 남태희;위승민
    • Journal of the Korea Society of Computer and Information
    • /
    • v.1 no.1
    • /
    • pp.147-158
    • /
    • 1996
  • This paper proposed a concurrency control structure based on specialized data flow graphs that was analysed a run-time concurrency control activity to be integrated with the task scheduler Data were viewed as flowing on the arcs from one node to another in a stream of discrete to tokens. The network that Is based upon the Entity-Relationship model, can be viewed a fixed problems used query tokens as a data flow graph. The performance was measured used in the various expriments compared the overall performance of the different concurrency control methods, DBFG (DataBase Flow graphs) scheduling had the knowledge to obtain better performance than 2PL in a distributed environment.

  • PDF

Implementation of Loop Peeling in CTOC (CTOC에서 루프 벗기기 구현)

  • Kim, Ki-Tae;Kim, Je-Min;Yoo, Weon-Hee
    • 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.

  • PDF

A JCML and a GUI-based Editor for Specifying Job Control Flow on Grid (그리드에서 작업 흐름을 효과적으로 제어하기 위한 JCML과 GUI 기반의 편집기)

  • 황석찬;최재영;이상산
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.3_4
    • /
    • pp.152-159
    • /
    • 2004
  • The Grid system is an emerging computing infrastructure that will substitute for existing distributed systems. However end users have a difficulty in using the Grid because of its complicated usage, which is an inherent characteristic from the heterogeneous mechanism of the Grid. In this paper, we present the JCML(Job Control Markup Language) and its GUI-based editor, which not only provide users with ease of use, improved working environment, but assist users to execute their jobs efficiently The JCML is a job control language that improves the RSL of Globus, which defines global services in Grid. The JCML is designed to support flexibility among various Grid services using standard XML. And it makes use of a graph representation method, GXL(Graph eXchange Language), to specify detailed job properties and dependencies among jobs using nodes and edges. The JCML editor provides users with GUI-based interface. With the JCML editor, a complicated job order can be easily completed using very simple manipulations with a mouse, such as a drag-and-drop.