• Title/Summary/Keyword: Checking Application

Search Result 285, Processing Time 0.03 seconds

A JTAG Protection Method for Mobile Application Processors (모바일 애플리케이션 프로세서의 JTAG 보안 기법)

  • Lim, Min-Soo;Park, Bong-Il;Won, Dong-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.706-714
    • /
    • 2008
  • In this paper, we suggest a practical and flexible system architecture for JTAG(Joint Test Action Group) protection of application processors. From the view point of security, the debugging function through JTAG port can be abused by malicious users, so the internal structures and important information of application processors, and the sensitive information of devices connected to an application processor can be leak. This paper suggests a system architecture that disables computing power of computers used to attack processors to reveal important information. For this, a user authentication method is used to improve security strength by checking the integrity of boot code that is stored at boot memory, on booting time. Moreover for user authorization, we share hard wired secret key cryptography modules designed for functional operation instead of hardwired public key cryptography modules designed for only JTAG protection; this methodology allows developers to design application processors in a cost and power effective way. Our experiment shows that the security strength can be improved up to $2^{160}{\times}0.6$second when using 160-bit secure hash algorithm.

A Study on the Remote Manufacturing System for the developing of Direct Numeric Control System using the Vericut Applications (Vericut으로 구현한 원격 가공 시스템)

  • 김희중;이동훈;김정욱;정재현
    • Proceedings of the Korean Society of Marine Engineers Conference
    • /
    • 2002.05a
    • /
    • pp.205-208
    • /
    • 2002
  • The vericut is one of the best CAM application for manufacturing data verification system. It is much applied in most manufacturing company for checking the manufacturing work. Using it a off-line manufacturing system is connected for on-line working on local area network. First, we choose the serial communication to chain an off-line manufacturing system and a personal computer which link with the server running the vericut.

  • PDF

Development of automatic surface grinder using PLC (PLC를 이용한 자동 연마석 평면 연삭기 개발)

  • 주해호;이재원;박현제
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.71-74
    • /
    • 1992
  • This paper describes the automation of the surface grinder for a grinding wheel by application of programmable logic controller(PLC) with a position sensor, and a limit switch. The control system is designed to provide feeding a workpiece on the turn table and pressing it by the upper disk automatically. In this development the automation of checking the thickness of a grinding wheel is most important. In order to measure the relative displacement, the proximity sensors were employed and the sensitivities of the sensors were investicated and discussed the superiority. It has been shown by model experiment that the automation system of the surface grinder is performed satisfactory.

  • PDF

Efficient Application to SAT Using DNF (DNF를 이용한 SAT의 효율적 적용)

  • 남명진;최진영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.881-883
    • /
    • 2003
  • 하드웨어 검증과 모델 체킹 등의 분야에서, SAT(satisfiability problem)나 항진 명제 검사(tautology checking)는 매우 중요한 문제이다. 그러나 이들은 모두 NP-complete 문제이므로 그 복잡도가 매우 크다. 이를 해결하기 위해 여러 가지 연구가 이루어져 왔으며, 여러 효율적인 알고리즘이 존재한다. 이러한 알고리즘은 대부분 일반 표현식을 CNF(conjunctive normal form)로 바꾸어 입력 형식으로 사용한다. 이 논문에서는 일반 표현식을 입력으로 받아 DNF로 변환한 뒤 DNF의 특성을 이용하여 SAT를 검사하는 효율적인 방법을 제시한다.

  • PDF

Development of Tunnel Management Database System for Korea National Railways (철도 터널 유지관리 데이타베이스 시스템 개발)

  • 황희수;홍선호;박지원;양재성
    • Proceedings of the KSR Conference
    • /
    • 1998.11a
    • /
    • pp.111-118
    • /
    • 1998
  • This paper describes the development of the database system for tunnel management of Korea National Railways. In order to make the system both target independent and accessible by KNR network or modem, authors developed the system as a web-based application using java language and IBM DB2 database. The system includes the searching, reporting, graphical representation and statistical functions for tunnel data, maintenance records and checking records. Later, the system will be extended to include the process for tunnel state rating and maintenace prioritiy decision-making.

  • PDF

Model Checking of Concurrent Object-Oriented Systems (병렬 객체지향 시스템의 검증)

  • Cho, Seung-Mo;Kim, Young-Gon;Bae, Doo-Hwan;Byun, Sung-Won;Kim, Sang-Taek
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.1
    • /
    • pp.1-12
    • /
    • 2000
  • Model checking is a formal verification technique which checks the consistency between a requirement specification and a behavior model of the system by explorating the state space of the model. We apply model checking to the formal verification of the concurrent object-oriented system, using an existing model checker SPIN which has been successful in verifying concurrent systems. First, we propose an Actor-based modeling language, called APromela, by extending the modeling language Promela which is a modeling language supported in SPIN. APromela supports not only all the primitives of Promela, but additional primitives needed to model concurrent object-oriented systems, such as class definition, object instantiation, message send, and synchronization.Second, we provide translation rules for mapping APromela's such modeling primitives to Promela's. As an application of APromela, we suggest a verification method for UML models. By giving an example of specification, translation, and verification, we also demonstrate the applicability of our proposed approach, and discuss the limitations and further research issues.

  • PDF

A Study on the Safety Design Rule Checking System for Automatic Verification of Design Errors (설계오류 자동 검증을 위한 안전 설계 Rule Checking 체계에 관한 연구)

  • Dukhan Kim;Yuho Yang;Youngwoo Chon
    • Journal of the Society of Disaster Information
    • /
    • v.20 no.1
    • /
    • pp.60-68
    • /
    • 2024
  • Purpose: When designing plants and workplaces such as handling and using chemicals, a system that can automatically determine whether the design has been made in compliance with domestic safety management laws is established to shorten the review time and increase accuracy. Method: Safety design standards for chemical handling and use workplaces were investigated, and types and systems were derived that could automatically judge design errors by dividing the articles into semantic units. Result: An automatic design review method performed when designing a building was proposed, and a system that can review the safety design requirements required when designing a chemical handling business site through the development of a rule checker was proposed. After confirming whether the law is subject to application, the safety design rules are classified into semantic units through preprocessing. The classified results can be classified into four types, and the specifications, space, conditions, situations, and specific devices and facilities to reinforce safety were analyzed as representative types. It proposes a system that prepares a diagram for the safety design rule and allows it to be reviewed through the rule checker program.

A Study on the Provision of Tourist Information Using a Mobile Application (모바일 앱을 활용한 관광정보 제공 연구)

  • Min, Jeongsik;Hong, Subin;An, Dasol;Jang, Woosun;Koo, Minjeong
    • The Journal of the Convergence on Culture Technology
    • /
    • v.2 no.3
    • /
    • pp.29-34
    • /
    • 2016
  • This study is about developing an app that offers tourist information and it was made to search festivals, camping, and glamping regions near the area. Also, by providing cooking recipe, it was made to provide convenience at the tour site. While searching recommended regions, it offers help in searching accommodations and checking in and checking out process. If the service is expanded nation-wide from the Gyeonggido area that this study was applied to, it will be more convenient for users and if the service is expanded and coupled with local coupons, quality services will be provided.

A Study on the Risk Analysis of Construction Method (건축공법 내부 리스크 분석에 관한 연구)

  • 윤여완;양극영
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2002.11a
    • /
    • pp.117-121
    • /
    • 2002
  • The purpose of this study was to Identification the Risk of construction method to protect and reduce the risk of construction period. For this study we are using the pre and during construction period Inspection list. The inspection list was used by construction company for check a flaw of Construction field. So we rearrange the individual item of inspection list to match the Risk factor. This inspection list usually has the difference of importance because this list is not made by Method which is not focused on Method. Therefore, To find the difference of these importance, We surveyed this matter by doing interview of specialist group. To find the application of field and the possibility of measurement of Risk status, We tested Risk occurring frequency and it's strength by checking the level of Risk. The results of this study were as follows; Each Method Check List made out through the rearrangement of Construction Inspection list which used in construction company. To solve and compensate the matter which happened by changing the each Method Check List to each General Inspection List, we added the each Method Check List by checking the importance of check list of each process. By doing this, The Check List for finding Risk level of Method was created by using the check list of each Method.

  • PDF

THE POWER OF PROGRAMMED GRAMMARS WITH GRAPHS FROM VARIOUS CLASSES

  • Barbaiani Madalina;Bibire Cristina;Dassow Jurgen;Delaney Aidan;Fazekas Szilard;Ionescu Mihai;Liu Guangwu;Lodhi Atif;Nagy Benedek
    • Journal of applied mathematics & informatics
    • /
    • v.22 no.1_2
    • /
    • pp.21-38
    • /
    • 2006
  • Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.