• Journal of Information Processing Systems
• /
• v.6 no.1
• /
• pp.21-32
• /
• 2010

Software maintenance is one of the major activities of the software development life cycle. Due to the time and cost constraint it is not possible to perform exhaustive regression testing. Thus, there is a need for a technique that selects and prioritizes the effective and important test cases so that the testing effort is reduced. In an analogous study we have proposed a new variable based algorithm that works on variables using the hybrid technique. However, in the real world the programs consist of multiple modules. Hence, in this work we propose a regression testing algorithm that works on interprocedural programs. In order to validate and analyze this technique we have used various programs. The result shows that the performance and accuracy of this technique is very high.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1700-1708
• /
• 2006

Since the most program execution time is consumed in a loop structure, extracting parallelism from loop programs is critical for the taster program execution. In this paper, we proposed data dependency removal method for a single loop. The data dependency removal method can be applied to uniform and non-uniform data dependency distance in the single loop. Procedure calls parallelisms with only a single loop structure or procedure call most of other methods are concerned with the uniform code within the uniform data dependency distance. We also propose an algorithm, which can be applied to uniform, non-uniform, and complex data dependency distance among the multiple procedures. We compared our method with conventional methods using CRAY-T3E for the performance evaluation. The results show that the proposed algorithm is effective.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.323-325
• /
• 2000

자바 컴파일러의 예외 처리 메커니즘을 기술한다. 자바 컴파일러 방식의 예외 상황 분석은 프로그래머의 선언에 의존하는 프로시져-내 분석이다. 본 논문에서는 자바 컴파일러 반식의 프로시져-내(intraprocedural) 분석과 선언에 의존하지 않는 프로시져-간(interprocedural) 예외 상황 분석기를 개발하고 실제 자바 프로그램에 적용시켜 봄으로서의 자바 컴파일러의 예외 상황 분석의 문제점을 보인다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.840-848
• /
• 2004

Garbage collecting objects in Java makes memory management easier for the programmer, but it is time consuming. Stack allocation may be an alternative which identifies stack-allocatable objects before the execution, without performance degradation. We suggest an escaping analysis recording the interprocedural movement of the method, to detect an object the method of whose creation may have been already deactivated during the access. Our approach is different from prior works, enables us to handle some cases that are missed in the previous variable - oriented approach.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.474-477
• /
• 2011

함수 호출 문맥을 요약하는 프로그램 분석은 가짜 경로 문제로 인해 심각한 성능저하를 겪기 마련이다. 이는 함수 호출 문맥이 요약되면서 분석 정보를 어디로 흘려보내야 할지 정확히 알 수 없는 경우가 생기기 때문이다. 이 논문에서는 함수 호출을 구변하는 분석에서 가짜 경로를 없애는 새로운 알고리즘을 설명한다. 분석 순서를 프로그램의 실제 실행과 비슷하게 제한하고 알고리즘의 일부를 조금 바꾸면 재귀 함수가 아닌 경우 가짜 경로를 모두 제거할 수 있다. 이 방식은 기존 방식과 같거나 더 정확한 결과를 내고 속도는 훨씬 빠르다.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.91-99
• /
• 2001

Since roost of the program execution time is spent in the loop structure, the problem of extracting parallelism from sequential loop has been one of the most important research issues. However. roost programs have Implicit interprocedure parallelism. This paper presents a generalized method extracting parallelism in loops having the procedure calls. Most parallelization of loops having procedure calls focus on the uniform code where data dependency distance is constant. We present algorithms which can be applied to uniform code, nonuniform code, and complex code. The performance of the proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods have been evaluated using CRAY-T3E. The result shows the effective of the proposed algorithm.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.37-44
• /
• 2002

Most researches of transforming sequential programs into parallel programs have been based on the loop structure transformation method. However, most programs have implicit interprocedure parallelism. This paper suggests a way of extracting parallelism from the loops with procedure calls using the data dependency elimination method. Most parallelization of the loop with procedure calls have been conducted for extracting parallelism from the uniform code. In this paper, we propose interprocedural transformation, which can be apply to both uniform and nonuniform code. We show the examples of uniform, nonuniform, and complex code parallelization. We then evaluated the performance of the various transformation methods using the CRAY-T3E system. The comparison results show that the proposed algorithm out-performs other conventional methods.