• Journal of Korean Society for Quality Management
• /
• v.34 no.3
• /
• pp.73-78
• /
• 2006

In this paper, we propose a software reliability growth model based on the testing domain in the software system, which is isolated by the executed test cases in software testing. In particular, our model assumes an imperfect debugging environment in which new faults are introduced in the fault-correction process, and is formulated as a nonhomogeneous Poisson process(NHPP). Further, it is applied to fault-detection data, the results of software reliability assessment are shown, and comparison of goodness-of-fit with the existing software reliability growth model is performed.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.151-159
• /
• 2015

In traditional programing education, computers were used as the main tool. Consequently, it was problematic to provide education in an environment without computers or for learners without computer skills. To address this problem, this study developed and validated an unplugged robot education system capable of computerless programming education. The key feature of the proposed system is that programing can be done only by connecting programming blocks in symbols of a flow chart with built-in commands. Validation of the system was performed by a specialist group. Validity was very high with values of content validity ratio (CVR) over 0.7 in all evaluation criteria except "Ease of error debugging" and "Linkages to educational curriculum," whose CVR values were each 0.6. Future directions include improvement in the two areas that scored lower than the others did by, respectively, system improvement to support debugging in error conditions that may occur during the programming process, and development of user guide to support linkages to educational curriculum.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2756-2758
• /
• 2003

ARM CORE용 칩으로 철도 종합 제어 부분에 이용될 수 있는 main processor 부분을 설계하고, JTAG 기술을 이용하여 그 안정성과 틸팅 기술에 이용될 수 있는 process를 사전 단계에서 bebugging 해보고, 이에 따른 신호 및 성능을 JTAG(Boundary Scan)을 이용하여 시스템의 신호와 파형을 시험 평가한다. 또한 예비 단계로의 JTAG 검증 가능성 여부를 알아보고자 한다. 철도 종합 제어 시스템의 신호 및 정확성을 측정해 보기 위한 선행 연구라 할 수 있다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.37-45
• /
• 1992

Common assumption we frequently encounter in early models of software reliability is that no new faults are introduced during the fault removal process. In real life, however, there are situations in which new faults are introducted as a result of imperfect debugging. This study alleviating this assumption by introducting the probability of perfect error-correction is an extension of Littlewood's work. In this model, the system reliability, failure rates, mean time to failure and average failure frequency are obtained. Here, when the probability of perfect error-correction is one, the results appear identical with those of the previous studies. In the respect that the results of previous studies are special cases of this model, the model developed can be considered as a generalized one.

• Journal of Korean Society for Quality Management
• /
• v.26 no.1
• /
• pp.99-107
• /
• 1998

This paper presents a software reliability model that is based on a nonhomogeneous poisson process. The major contribution of this model is combining multiple failure types with imperfect debugging by use of S-shaped mean value function. The software reliability model allows for three different types of errors: Critical errors are the most difficult to detect and the most expensive to remove. Major errors are moderately difficult to detect and fairly expensive to remove. Minor errors are easy to detect and inexpensive to remove. The model also allows for the introduction of any of these types of errors during the removal of an error. A numerical example is provided to illustrate the above techniques.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.93-94
• /
• 2007

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.268-268
• /
• 2004

• Journal of KIISE:Software and Applications
• /
• v.35 no.6
• /
• pp.366-373
• /
• 2008

The web ontology language(OWL) has been used by ontology designers to construct ontology. In order to derive hidden information(concept subsumption, concept satisfiability and realization) of OWL ontology, a number of OWL reasoners have been introduced. But most reasoners simply report these information without process for any arbitrary entailment and unsatisfiable concept derived from a OWL ontologies. In this paper, we propose Minimum Expression Axiom Set(MEXS) detection and storing for debugging unsatisfiable concepts in ontology. In order to detect MEXS, we need to find axiom to cause inconsistency in ontology. Therefore, our work focused on two key aspects: given a inconsistency ontology, identifying the roots of axioms to occur unsatisfiable and derived axioms from among them; and extracting MEXS. Our results can be applicable to all application, which is at the basis of the description logic.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.884-894
• /
• 1999

순서적 동기화 및 내포 병렬성을 포함하는 공유메모리 병렬 프로그램에서의 경합(race)은 프로그램 수행에서 원하지 않은 비결정성(nondeterminism)을 야기할 수 있기 때문에 반드시 탐지되어져야 한다. 특히 프로그램 수행에서 최초경합(first race)을 탐지하는 것은 중요한데, 그 이유는 이 경합을 제거하면 다른 경합이 나타나지 않을 수도 있기 때문이다. 본 논문에서는 결정적 공유메모리 병렬프로그램을 위한 2단계 수행중 (two-pass on-the-fly) 최초경합 탐지 기법을 제시하며, 이것은 공유메모리 병렬 프로그램의 특정 수행에서 "최초로 발생되는" 경합들을 탐지하는 기법이다. 그리고 HPF 컴파일러를 이용하여 본 탐지 프로토콜을 공인된 벤치마크 프로그램에 적용하여, 병렬 프로그램 디버깅 시 고려하여야 할 파라미터들에 대한 실험으로부터 본 기법의 효율성을 보였다.Abstract Detecting races is important in debugging shared-memory parallel programs which have ordered synchronization and nested parallelism, because the races result in unintended non- deterministic executions of the programs. The first races are important in debugging, because the removal of such races may make other races disappear. It is even possible that all races reported would disappear once the first races are removed. This paper presents a new two-pass on-the-fly algorithm to detect the first races in such parallel programs. The algorithm reported in this paper is an on-the-fly algorithm that detects the races that "occur first" in a particular execution of shared-memory parallel programs. The experiment has accomplished, where two certified benchmark programs which can be executed under High Performance Fortran environments to get some parameters which improve debugging performance with our algorithm. with our algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.225-233
• /
• 1999

One of the reasons that debugging distributed programs is much more difficult than sequential programs is the communication among processes. Even though there are many debuggers constructed on distributed system environment, no available debugger provides an efficient way to debug communication events.. In this paper, we show the way to debug RPC communication, which is regarded as one of the most popular communication protocol in distributed system development. This paper presents the implementation of the RPC event trace function based on the RPC event model, which is proposed to accommodate communication events into debugging objects. Analyzing conventional RPC protocols, we formalized library function calls as corresponding actions to sending and receiving of messages. B recognizing the locations of library calls the debugger can detect all occurrences of communication events, This RPC event trace function is implemented on the on-line distributed debugger UniVIEW system.