• Title/Summary/Keyword: Branch Coverage

Search Result 55, Processing Time 0.036 seconds

Automated Test Data Generation for Dynamic Branch Coverage (동적 분기 커버리지를 위한 테스트 데이터 자동 생성)

  • Chung, In Sang
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.7
    • /
    • pp.451-460
    • /
    • 2013
  • In order to achieve high test coverage, it is usual to generate test data using various techniques including symbolic execution, data flow analysis or constraints solving. Recently, a technique for automated test data generation that fulfills high coverage effectively without those sophisticated means has been proposed. However, the technique shows its weakness in the generation of test data that leads to high coverage for programs having branch conditions where different memory locations are binded during execution. For certain programs with flag conditions, in particular, high coverage can not be achieved because specific branches are not executed. To address the problem, this paper presents dynamic branch coverage criteria and a test data generation technique based on the notion of dynamic branch. It is shown that the proposed technique compared to the previous approach is more effective by conducting experiments involving programs with flag conditions.

Cancer Risk Factors in Korean News Media: a Content Analysis

  • Kye, Su Yeon;Kwon, Jeong Hyun;Kim, Yong-Chan;Shim, Minsun;Kim, Jee Hyun;Cho, Hyunsoon;Jung, Kyu Won;Park, Keeho
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.2
    • /
    • pp.731-736
    • /
    • 2015
  • Background: Little is known about the news coverage of cancer risk factors in Korea. This study aimed to examine how the news media encompasses a wide array of content regarding cancer risk factors and related cancer sites, and investigate whether news coverage of cancer risk factors is congruent with the actual prevalence of the disease. Materials and Methods: A content analysis was conducted on 1,138 news stories covered during a 5-year period between 2008 and 2012. The news stories were selected from nationally representative media in Korea. Information was collected about cancer risk factors and cancer sites. Results: Of various cancer risk factors, occupational and environmental exposures appeared most frequently in the news. Breast cancer was mentioned the most in relation to cancer sites. Breast, cervical, prostate, and skin cancer were overrepresented in the media in comparison to incidence and mortality cases, whereas lung, thyroid, liver, and stomach cancer were underrepresented. Conclusions: To our knowledge, this research is the first investigation dealing with news coverage about cancer risk factors in Korea. The study findings show occupational and environmental exposures are emphasized more than personal lifestyle factors; further, more prevalent cancers in developed countries have greater media coverage, not reflecting the realities of the disease. The findings may help health journalists and other health storytellers to develop effective ways to communicate cancer risk factors.

Automated Test Data Generation Based on Branch Coverage for Testing C Programs (C 프로그램을 테스팅하기 위한 분기 커버리지에 기반을 둔 자동 테스트 데이터 생성)

  • Chung, In-Sang
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.11
    • /
    • pp.39-48
    • /
    • 2012
  • It is well known that software testing amounts for a significant portion of software development cost. In order to reduce the cost of software testing. a lot of researches on automated test data generation have been performed. Sophisticated tools for performing symbolic execution or solving a system of path constraints are required to support automated test data generation. Developing or purchasing those tools leads to another factor of increasing the cost involving software testing. In this paper, we propose a dynamic test data generation approach that does not depend on symbolic execution or constraint solving at all. The proposed approach extends Korel's path-oriented method to satisfy the branch coverage criterion effectively. We conducted an experiment to evaluate the effectiveness of the proposed technique with a triangle classification program to show that branch coverage can be easily achieved.

EPfuzzer: Improving Hybrid Fuzzing with Hardest-to-reach Branch Prioritization

  • Wang, Yunchao;Wu, Zehui;Wei, Qiang;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3885-3906
    • /
    • 2020
  • Hybrid fuzzing which combines fuzzing and concolic execution, has proved its ability to achieve higher code coverage and therefore find more bugs. However, current hybrid fuzzers usually suffer from inefficiency and poor scalability when applied to complex, real-world program testing. We observed that the performance bottleneck is the inefficient cooperation between the fuzzer and concolic executor and the slow symbolic emulation. In this paper, we propose a novel solution named EPfuzzer to improve hybrid fuzzing. EPfuzzer implements two key ideas: 1) only the hardest-to-reach branch will be prioritized for concolic execution to avoid generating uninteresting inputs; and 2) only input bytes relevant to the target branch to be flipped will be symbolized to reduce the overhead of the symbolic emulation. With these optimizations, EPfuzzer can be efficiently targeted to the hardest-to-reach branch. We evaluated EPfuzzer with three sets of programs: five real-world applications and two popular benchmarks (LAVA-M and the Google Fuzzer Test Suite). The evaluation results showed that EPfuzzer was much more efficient and scalable than the state-of-the-art concolic execution engine (QSYM). EPfuzzer was able to find more bugs and achieve better code coverage. In addition, we discovered seven previously unknown security bugs in five real-world programs and reported them to the vendors.

An Optimal Algorithm for the Sensor Location Problem to Cover Sensor Networks

  • Kim Hee-Seon;Park Sung-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.17-24
    • /
    • 2006
  • We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.

  • PDF

Ocean Feature Tracking Using Sequential SAR Images

  • Liu, Antony K.;Zhao, Yunhe;Hsu, Ming-Kuang
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.946-949
    • /
    • 2006
  • With repeated coverage, spaceborne SAR (Synthetic Aperture Radar) instruments provide the most efficient means to monitor and study the changes in important elements of the marine environment. Due to highresolution of SAR data, the coverage of SAR sensor is always limited, especially for a repeat cycle. With more SAR sensors from various satellites, new data products such as ocean surface drift can be derived when two SARs' tracks overlap in a short time over coastal areas. Currently, there are two SAR sensors on different satellites with almost the exactly same path. That is, ERS-2 is following ENVISAT with a 30-minutes delay, which will be a good timing for ocean mesosclae feature tracking. For another application, a mystery ship near a big eddy with strong ship wake has been tracked between ERS-2 and ENVISAT SAR images to estimate its ship speed.

  • PDF

Improving development environment for embedded software (내장 소프트웨어를 위한 개발 환경의 개선)

  • AHN, ILSOO
    • Journal of Software Engineering Society
    • /
    • v.25 no.1
    • /
    • pp.1-9
    • /
    • 2012
  • RFID systems have been widely used in various fields such as logistics, distribution, food, security, traffic and others. A RFID middleware, one of the key components of the RFID system, perform an important role in many functions such as filtering, grouping, reporting tag data according to given user specifications and so on. However, manual test data generation is very hard because the inputs of the RFID middleware are generated according to the RFID middleware standards and complex encoding rules. To solve this problem, in this paper, we propose a black box test technique based on RFID middleware standards. Firstly, we define ten types of input conversion rules to generate new test data from existing test data based on the standard specifications. And then, using these input conversion rules, we generate various additional test data automatically. To validate the effectiveness of generated test data, we measure coverage of generated test data on actual RFID middleware. The results show that our test data achieve 78% statement coverage and 58% branch coverage in the classes of filtering and grouping, 79% statement coverage and 64% branch coverage in the classes of reporting.

  • PDF

Reconstruction of Trochanteric Pressure Sores using Perforator-based Flap from the Ascending Branch of Lateral Circumflex Femoral Artery (외측대퇴회선동맥 상행가지의 천공지피판을 이용한 대전자부 욕창의 재건)

  • Kim, Jun-Hyung;Eo, Su-Rak;Cho, Sang-Hun
    • Archives of Plastic Surgery
    • /
    • v.37 no.5
    • /
    • pp.595-599
    • /
    • 2010
  • Purpose: Trochanteric pressure sores management has been improved through the development of musculocutaneous flaps. But it has many drawbacks such as donor site morbidity and functional muscle sacrifice. With the introduction of perforator flap, it is possible to use in every location where musculocutaneous perforators are present. We have reconstructed trochanteric pressure sores using perforator-based flaps from the ascending branch of lateral circumflex femoral artery. Methods: Between May of 2006 and April of 2008, we performed six cases of perforator-based flap from the ascending branch of lateral circumflex femoral artery for the coverage of trochanteric pressure sores. For identifying perforators, a line was drawn from the anterior superior iliac spine to the superolateral border of the patella as the vertical axis, from the pubis to the trochanteric prominence as the horizontal axis. In the lateral aspect of the intersection of these two axes, various flap were designed according to its defects. The flap was raised in the subcutaneous plane above the fascia and the pedicle was traced by doppler and identified. The pedicle was meticulously dissected not to injure the periadventitial tissues and transposed to the defect. The donor site was closed primarily. Results: The mean age of patients was 56.2 years. Four male and two female patients were studied. Five patients were paraplegic. The mean defect size was $6{\times}4\;cm$. The largest flap dimension was $14{\times}7\;cm$. Donor sites were closed primarily without any complications. All flaps survived completely without necrosis, hematoma or infection. There were no recurrence during the follow-up period. Conclusion: Trochanteric pressure sores using perforator-based flap from the ascending branch of lateral circumflex femoral artery can be performed safely and it would be a reliable option for coverage of trochanteric pressure sores with minimal donor site morbidity.

Anatomical variations of the innervated radial artery superficial palmar branch flap: A series of 28 clinical cases

  • Yang, Jae-Won
    • Archives of Plastic Surgery
    • /
    • v.47 no.5
    • /
    • pp.435-443
    • /
    • 2020
  • Background The innervated radial artery superficial palmar branch (iRASP) flap was designed to provide consistent innervation by the palmar cutaneous branch of the median nerve (PCMN) to a glabrous skin flap. The iRASP flap is used to achieve coverage of diverse volar defects of digits. However, unexpected anatomical variations can affect flap survival and outcomes. Methods Cases in which patients received iRASP flaps since April 1, 2014 were retrospectively investigated by reviewing the operation notes and intraoperative photographs. The injury type, flap dimensions, arterial and neural anatomy, secondary procedures, and complications were evaluated. Results Twenty-eight cases were reviewed, and no flap failures were observed. The observed anatomical variations were the absence of a direct skin perforator, large-diameter radial artery superficial palmar branch (RASP), and the PCMN not being a single branch. Debulking procedures were performed in 16 cases (57.1%) due to flap bulkiness. Conclusions In some cases, an excessively large RASP artery was observed, even when there was no direct skin perforator from the RASP or variation in the PCMN. These findings should facilitate application of the iRASP flap, as well as any surgical procedures that involve potential damage to the PCMN in the inter-thenar crease region. Additional clinical cases will provide further clarification regarding potential anatomical variations.

Predicting Audit Reports Using Meta-Heuristic Algorithms

  • Valipour, Hashem;Salehi, Fatemeh;Bahrami, Mostafa
    • Journal of Distribution Science
    • /
    • v.11 no.6
    • /
    • pp.13-19
    • /
    • 2013
  • Purpose - This study aims to predict the audit reports of listed companies on the Tehran Stock Exchange by using meta-heuristic algorithms. Research design, data, methodology - This applied research aims to predict auditors reports' using meta-heuristic methods (i.e., neural networks, the ANFIS, and a genetic algorithm). The sample includes all firms listed on the Tehran Stock Exchange. The research covers the seven years between 2005 and 2011. Results - The results show that the ANFIS model using fuzzy clustering and a least-squares back propagation algorithm has the best performance among the tested models, with an error rate of 4% for incorrect predictions and 96% for correct predictions. Conclusion - A decision tree was used with ten independent variables and one dependent variable the less important variables were removed, leaving only those variables with the greatest effect on auditor opinion (i.e., net-profit-to-sales ratio, current ratio, quick ratio, inventory turnover, collection period, and debt coverage ratio).