• Title/Summary/Keyword: System Testing Graph

Search Result 34, Processing Time 0.031 seconds

A study on Dirty Pipe Linux vulnerability

  • Tanwar, Saurav;Kim, Hee Wan
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.3
    • /
    • pp.17-21
    • /
    • 2022
  • In this study, we wanted to examine the new vulnerability 'Dirty Pipe' that is founded in Linux kernel. how it's exploited and what is the limitation, where it's existed, and overcome techniques and analysis of the Linux kernel package. The study of the method used the hmark[1] program to check the vulnerabilities. Hmark is a whitebox testing tool that helps to analyze the vulnerability based on static whitebox testing and automated verification. For this purpose of our study, we analyzed Linux kernel code that is downloaded from an open-source website. Then by analyzing the hmark tool results, we identified in which file of the kernel it exists, cvss level, statistically depicted vulnerabilities on graph which is easy to understand. Furthermore, we will talk about some software we can use to analyze a vulnerability and how hmark software works. In the case of the Dirty Pipe vulnerability in Linux allows non-privileged users to execute malicious code capable of a host of destructive actions including installing backdoors into the system, injecting code into scripts, altering binaries used by elevated programs, and creating unauthorized user profiles. This bug is being tracked as CVE-2022-0847 and has been termed "Dirty Pipe"[2] since it bears a close resemblance to Dirty Cow[3], and easily exploitable Linux vulnerability from 2016 which granted a bad actor an identical level of privileges and powers.

A Novel Test Scheduling Algorithm Considering Variations of Power Consumption in Embedded Cores of SoCs (시스템 온 칩(system-on-a-chip) 내부 코어들의 전력소모 변화를 고려한 새로운 테스트 스케쥴링 알고리듬 설계)

  • Lee, Jae-Min;Lee, Ho-Jin;Park, Jin-Sung
    • Journal of Digital Contents Society
    • /
    • v.9 no.3
    • /
    • pp.471-481
    • /
    • 2008
  • Test scheduling considering power dissipation is an effective technique to reduce the testing time of complex SoCs and to enhance fault coverage under limitation of allowed maximum power dissipation. In this paper, a modeling technique of test resources and a test scheduling algorithm for efficient test procedures are proposed and confirmed. For test resources modeling, two methods are described. One is to use the maximum point and next maximum point of power dissipation in test resources, the other one is to model test resources by partitioning of them. A novel heuristic test scheduling algorithm, using the extended-tree-growing-graph for generation of maximum embedded cores usable simultaneously by using relations between test resources and cores and power-dissipation-changing-graph for power optimization, is presented and compared with conventional algorithms to verify its efficiency.

  • PDF

A Study on the Behavioral technology Synthesis of VHDL for Testability (검사 용이화를 위한 VHDL의 동작기술 합성에 관한 연구)

  • Park, Jong-Tae;Choi, Hyun-Ho;Her, Hyong-Pal
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.4
    • /
    • pp.329-334
    • /
    • 2002
  • For the testability, this paper proposed the algorithm at autonomous synthesis which includes the data path structure as the self testing as possible on high level synthesis method when VHDL, coding is used in the system design area. In the proposed algorithm of this paper, MUXs and registers are assigned to the data path of designed system. And the designed data path could be mapped the H/W specification of described VHDL coding to the testable library. As a results, it was mapped H/W to the assign algorithm that is minimized MUX and the registers in collision graph.

Change Impact Analysis for Object-Oriented softwares in the distributed environment (분산 객체지향 소프트웨어를 위한 수정 영향 분석)

  • Kim, Kyung-Hee;Park, Jai-Nyun;Yoon, Yong-Ik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.5
    • /
    • pp.1280-1290
    • /
    • 1999
  • Applying the change impact analysis to the distributed environment is not straightforward since it is based on the centralized system environment. In this paper, we investigate the change impact analysis of object-oriented shoftwares in the distributed environment. We first, categories the types of changes common in object-oriented software into three sets: data, method, and class level changes. We, then, analyze the impact of each set of changes and represent it in the form of a DPDG. A DPDG is a graph showing relationship of object oriented softwares - with data elements. classes, design documents, servers - in the distributed environment. DPDG searches element of software to retest when the software is changed. Thus, DPDG saves effort of software to retest. In this paper, We propose the table of firewall for retest elements that be discovered by DPDG and implement the table of firewall. The table of firewall is used VIST that we design a software testing tool. The VIST utilizes the minimized firewall, then saves efforts and costs of retesting for distributed object-oriented software.

  • PDF

A Method of Test Case Generation Using BPMN-Based Path Search (BPMN 기반 경로 탐색을 이용한 테스트 케이스 생성 기법)

  • Park, JeJun;Kang, DongSu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.3
    • /
    • pp.125-134
    • /
    • 2017
  • The SOA (Service Oriented Architecture) based softwares are escalated because of quickly coping with business requirement. SOA can not apply to existing test method because of loosely coupled service and massage exchange architecture. In this paper, we suggest a method of test case generation using BPMN (Business Process Model and Notation). First we model processes, then make Business Flow Graph (BFG). After searching the euler path through symmetrized BFG about input and output degrees, we generate test cases. A method of test case generation using BPMN can apply at SOA-based system, and reduce the number of test cases.

An Improvement of the Deadlock Avoidance Algorithm (Deadlock 회피책에 대한 개선방안 연구)

  • Kim, Tae-Yeong;Park, Dong-Won
    • The Journal of Engineering Research
    • /
    • v.1 no.1
    • /
    • pp.49-57
    • /
    • 1997
  • In this paper, the follow-up works of Habermann's deadlock avoidance algorithm is investigated from the view of correction, efficiency and concurrency. Habermann's deadlock avoidance algorithm is briefly surveyed and in-depth discussion of follow-up algorithms modified and improved is presented. Then, further improvement of Kameda's algorithm will be discussed. His algorithm for testing deadlock-freedom in computer system converts the Habermann's model into a labeled bipartite graph so that the deadlock detection problem can be equivalent to finding complete matching for Mormon marriage problem. His algorithm has a running time of O($mn^1.5$) because Dinic's algorithm is used. The speed of above algorithm can be enhanced by employing a faster algorithm for finding a maximal matching. The wave method by Kazanov is used for.

  • PDF

Economical Gas Chamber for In-situ Gas Measurement and Analysis of Gas Response Characteristics according to Sensor Voltage (인시투 가스 측정이 가능한 경제적 가스 챔버 구현 및 센서 전압에 따른 가스 응답 특성 분석)

  • Choi, Yun-Suk;Lee, In Hwan
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.18 no.5
    • /
    • pp.1-8
    • /
    • 2019
  • Breath analysis using a portable device is better than the classical breath analysis system in terms of installation and operation. There is an increasing need to develop cost-effective equipment for testing gas sensors from the viewpoint of functionalities that can be applied applicable to portable devices. In the present study, an economical gas chamber for in-situ gas measurement is implemented with a single gas chamber without using expensive gas storage and control equipment; the gas response characteristics are analyzed using the above-described chamber. The main features of the implemented gas chamber are simple injection procedure, improved gas diffusion, easy measurement and cleaning, support for low-power mode measurement function for portable devices, and open source platform. Moreover, an analysis of gas response characteristics based on changes in sensor voltage show that the sensitivity and 90% response time are affected by the sensor voltage. Furthermore, the sensitivity graph has an inflection point in a specific range. The gas sensor applied in this study showed fast response speed and high sensitivity for sensor voltages of 3.0-3.5 V, regardless of the concentration of acetone gas, the target gas used in this study.

An Index Structure for Substructure Searching In Chemical Databases (화학 데이타베이스에서 부분구조 검색을 위한 인덱스 구조)

  • Lee Hwangu;Cha Jaehyuk
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.641-649
    • /
    • 2004
  • The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

Learning Material Bookmarking Service based on Collective Intelligence (집단지성 기반 학습자료 북마킹 서비스 시스템)

  • Jang, Jincheul;Jung, Sukhwan;Lee, Seulki;Jung, Chihoon;Yoon, Wan Chul;Yi, Mun Yong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.179-192
    • /
    • 2014
  • Keeping in line with the recent changes in the information technology environment, the online learning environment that supports multiple users' participation such as MOOC (Massive Open Online Courses) has become important. One of the largest professional associations in Information Technology, IEEE Computer Society, announced that "Supporting New Learning Styles" is a crucial trend in 2014. Popular MOOC services, CourseRa and edX, have continued to build active learning environment with a large number of lectures accessible anywhere using smart devices, and have been used by an increasing number of users. In addition, collaborative web services (e.g., blogs and Wikipedia) also support the creation of various user-uploaded learning materials, resulting in a vast amount of new lectures and learning materials being created every day in the online space. However, it is difficult for an online educational system to keep a learner' motivation as learning occurs remotely, with limited capability to share knowledge among the learners. Thus, it is essential to understand which materials are needed for each learner and how to motivate learners to actively participate in online learning system. To overcome these issues, leveraging the constructivism theory and collective intelligence, we have developed a social bookmarking system called WeStudy, which supports learning material sharing among the users and provides personalized learning material recommendations. Constructivism theory argues that knowledge is being constructed while learners interact with the world. Collective intelligence can be separated into two types: (1) collaborative collective intelligence, which can be built on the basis of direct collaboration among the participants (e.g., Wikipedia), and (2) integrative collective intelligence, which produces new forms of knowledge by combining independent and distributed information through highly advanced technologies and algorithms (e.g., Google PageRank, Recommender systems). Recommender system, one of the examples of integrative collective intelligence, is to utilize online activities of the users and recommend what users may be interested in. Our system included both collaborative collective intelligence functions and integrative collective intelligence functions. We analyzed well-known Web services based on collective intelligence such as Wikipedia, Slideshare, and Videolectures to identify main design factors that support collective intelligence. Based on this analysis, in addition to sharing online resources through social bookmarking, we selected three essential functions for our system: 1) multimodal visualization of learning materials through two forms (e.g., list and graph), 2) personalized recommendation of learning materials, and 3) explicit designation of learners of their interest. After developing web-based WeStudy system, we conducted usability testing through the heuristic evaluation method that included seven heuristic indices: features and functionality, cognitive page, navigation, search and filtering, control and feedback, forms, context and text. We recruited 10 experts who majored in Human Computer Interaction and worked in the same field, and requested both quantitative and qualitative evaluation of the system. The evaluation results show that, relative to the other functions evaluated, the list/graph page produced higher scores on all indices except for contexts & text. In case of contexts & text, learning material page produced the best score, compared with the other functions. In general, the explicit designation of learners of their interests, one of the distinctive functions, received lower scores on all usability indices because of its unfamiliar functionality to the users. In summary, the evaluation results show that our system has achieved high usability with good performance with some minor issues, which need to be fully addressed before the public release of the system to large-scale users. The study findings provide practical guidelines for the design and development of various systems that utilize collective intelligence.

Construction of Global Finite State Machine from Message Sequence Charts for Testing Task Interactions (태스크 상호작용 테스팅을 위한 MSC 명세로부터의 전체 유한 상태 기계 생성)

  • Lee, Nam-Hee;Kim, Tai-Hyo;Cha, Sung-Deok;Shin, Seog-Jong;Hong, H-In-Pyo;Park, Ki-Wung
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.634-648
    • /
    • 2001
  • Message Sequence Charts(MSC) has been used to describe the interactions of numerous concurrent tasks in telecommunication software. After the MSC specification is verified in requirement analysis phase, it can be used not only to synthesize state-based design models, but also to generate test sequences. Until now, the verification is accomplished by generating global state transition graph using the location information only. In this paper, we extend the condition statement of MSC to describe the activation condition of scenarios and the change of state variables, and propose an approach to construct global finite state machine (GFSM) using this information. The GFSM only includes feasible states and transitions of the system. We can generate the test sequences using the existing FSM-based test sequence generation technology.

  • PDF