• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2049-2056
• /
• 2010

The illegal copy of computer software have been one of the most serious threats in information society. But a number of protection schemes to solve it have proposed, there are a lot of difficulties for prevention from illegally distributing software through emerging Internet environments. In this paper, we propose a software watermarking scheme for Java programs which it have been popular on the Internet. The proposed scheme can be efficiently implemented and provide a robust software watermark for the protection of the copyright of Java programs.

• KIISE Transactions on Computing Practices
• /
• v.21 no.12
• /
• pp.751-755
• /
• 2015

Many JavaScript programs are event-driven in the sense that they heavily use event functions that take user inputs to manipulate program behaviors. Thus, in order to statically analyze event-driven JavaScript programs effectively and precisely, static analyzers should be able to understand and precisely analyze the behaviors of events in terms of how they are created and evaluated. In this paper, we describe several reasons why static analysis of event behaviors in JavaScript programs is particularly difficult, and present a new event modeling mechanism that can represent behaviors of events precisely and efficiently for effective analysis of event-based JavaScript programs.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.1
• /
• pp.41-48
• /
• 2007

In this paper, a example of a development of web-based remote monitoring and control system using Java technology on TCP/IP is proposed. We implemented Client/Server socket programs using Java Socket class, and applied those to a greenhouse made from LEGO blocks and made web-based greenhouse remote monitoring and control system. Implemented System transferred states of greenhouse to client programs, and control signals from client program were transferred to Server. Greenhouse model was controlled well by the system.

• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.326-335
• /
• 2002

Recently there have been a number of researches to provide code mobility to lazy functional language (LFL) programs by translating LFL programs to Java programs. These approaches are basically baled on architectural similarities between abstract machines of LFLs and Java. The abstract machines of LFLs and Java programming language, Spineless Tagless G-Machine(STGM) and Java Virtual Machine(JVM) respectively, share important common features such as built- in garbage collector and stack machine architecture. Thus, we can provide code mobility to LFLs by translating LFLs to Java utilizing these common features. In this paper, we propose a new translation scheme which fully utilizes architectural common features between STGM and JVM. By redefining STGM as an eval-apply evaluation model, we have defined a new translation scheme which utilizes Java Virtual Machine Stack for function evaluation and totally eliminates stack simulation which causes array manipulation overhead in Java. Benchmark program translated to Java programs by our translation scheme run faster on JDK 1.3 than those translated by the previous schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2086-2094
• /
• 2000

It is not easy to analyze object-oriented programs, including those in Java, Because the control flows of he program is not visible to the users. The users, however, can utilize class files to trace the process of execution, since a lot of information related on control flow are store in the control flows. A Java virtual machine can then execute the bytecods included in classfiles. It means that understanding the execution process of the bytecodes leads users to comprehend and analyze source programs in Java. We design and implement a visual tool for bytecode execution that is an efficient and powerful tool to understand and analyze source programs in Java. It can aid users to thoroughly grasp not only the structure of a program but also the flow of controls among objects.

• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.607-617
• /
• 2000

Concurrent programs, which are composed of threads that can operate concurrently, are intrinsically nondeterministic. Therefore, we can not directly apply classical testing or debugging techniques developed for sequential programs to concurrent programs because of the nonreproducibility due to nondeterminism. In this paper, we present a source tranformation method to guarantee the reproducibility of multi-threaded programs written in Java programming language. Once a mutli-threaded program has been transformed according to the transformation rules, we can force the program's execution to follow the given sequence of synchronized methods repeatedly and reduce the efforts to find the source of the errors. In addition, we present a method for checking the feasibility of the synchronized method sequence to be replayed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.352-354
• /
• 2003

현재 분산 컴퓨팅 환경에서는 객체를 공유하기 위하여 Jini 서비스인 JavaSpace를 이용하여 다양한 응용 프로그램들이 개발되고 있다. 하지만 JavaSpace의 가장 큰 단점은 누구든지 객체를 저장하고, 또 그 객체를 읽거나 가져갈 수 있도록 설계되어있어 보안성이 매우 취약하다는 것이다. 본 논문에서는 이러한 JavaSpace를 보안등급에 따른 접근제어와 SSL SSL 패키지를 이용한 상호인증 모듈을 구현하여 JavaSpace의 새로운 보안모델을 제시하였으며, 개발된 안전한 JavaSpace를 이용하여 이동 에이전트간 통신 패러다임으로 적용하였다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.883-894
• /
• 2002

Classical deterministic testing controls the execution of concurrent programs based on the equivalence between specifications and programs. However, it is not directly applicable to a situation in which synchronization sequences, being valid but infeasible, are taken into account. To resolve this problem, we had proposed automata-based deterministic testing in our previous works, where a concurrent program is executed according to one of the sequences accepted by the automaton recognizing all sequences semantically equivalent to a given sequence. In this paper, we present the automata-based testing environment for Java multi-thread programs, and we design and implement "Deterministic Executor" in the testing environment. "Deterministic Executor" transforms a Java multi-thread program by applying automata-based deterministic testing, the transformed program presents testing results. "Deterministic Executor" uses "Automata Generator", which generates an equivalent automaton of a test sequence, and "Replay Controller", which controls the execution of programs according to the sequence accepted by the automaton. By illustrating automata-based testing procedures with a gas station example, we show how the proposed approach does works in a Java multi-threaded program.roach does works in a Java multi-threaded program.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2005.10a
• /
• pp.686-689
• /
• 2005

Many computational models using computer program in agricultural engineering were proposed and introduced until now. These programs were developed based on procedure and structural program paradigm, so it's hard to reuse because programs become bigger and complex. In this study proposals a program paradigm that is easy to combine and reuse. Embedded engineering techniques are Java, JavaBean model, object-oriented programming.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.73-75
• /
• 2001

본 논문에서는 다중 스레드 Java 프로그램의 실행 중 처리되지 않는 예외상황을 실행 전에 미리 예측하는 분석 방법을 제안한다. Java에서는 안전성 문제 때문에 다중 스레드 사이에서 예외 상황을 발생시키지 않도록 제한하고 있는데 반해, 본 연구에서는 프로그래머가 자유롭게 다중 스레드 사이에 예외상황을 발생시킬 수 있도록 언어를 확장한 후에 그 프로그램에서 처리되지 않는 예외상황을 예측해낸다. 이 분석 방법은 다중 스레드 Java 프로그램의 각 스레드에서 동시에 수행될 수 있는 부분들을 미리 예측해내고, 이 분석 정보를 이용하여 다중 스레드 사이에서 예외상황을 발생시킬 때 처리되지 않는 예외상황을 예측한다.