• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.4
• /
• pp.474-479
• /
• 2014

LEON3 is a 32-bit synthesizable processor based on the SPARC V8. It can be connected to AMBA 2.0 bus and has a 7- stage pipeline, IEEE-754 FPU and 256[KB] cache. It can be easily implemented using FPGA and used for a SoC design. DSU which comes with LEON3 can be used to control and monitor the operation of LEON3. And DSU makes it easy to set a debugging environment for the development of both hardware and software for an embedded systems based on LEON3. This paper presents the summary of the debugging tool for LEON3 based embedded systems. The debugging tool can initialize the target hardware, find out how the target hardware is configured, load application code to a specified memory space and run that application code. To provide users a debugging environment, it can set breakpoints and control the operation of LEON3 correspondingly. And function call trace is one of key functions of the debugging tool.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.335-346
• /
• 1999

The process of program debugging is essentially an intelligence intensive process. It is thought viable to develop a knowledge-based tool to help programmer perform this process. This paper presents the design of such a system. Unlike other knowledge-based debugging tools which are mostly based on formal program specification and automatic program understanding, this tool is based on debugging heuristic. This tool is a debugging assistant which only suggests the programmer in program debugging what and where to examine using the debugging heuristic stored in the knowledge base. In this paper, a umber of useful heuristic debugging knowledge are explained and their usage in debugging process are described. The, a scheme to organize the knowledge in the knowledge base and an intelligent program debugging assistant using the knowledge are proposed and discussed.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.33-42
• /
• 2016

Pin is a framework that creates dynamic program analysis tools and can be used to perform program analysis on user space in Linux and Windows. It is hard to analyze the program such as Anti-reversing program or malware using anti-debugging by Pin. In this paper, we will suggest the implementation of scheme bypassing anti-debugging with Pin. Each pin code is written to bypass anti-debugging detecting Pin. And Pin creates a pin tool combined with Pin codes that bypass anti-debugging methods. The pin tool are tested with files created by anti-debugging protector. The technique in the paper is expected to be a reference of code bypassing anti-debugging and be applied to bypass newly discovered anti-debugging through code modification in the future.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.255-260
• /
• 2020

Today most students have a smartphone. Students learning numerical analysis can practice coding using their smartphone in the classroom without going to the computer lab. The tool NAPHP[1] makes it easy to practice coding using PHP in an internet web browser without installing a coding app on your smartphone. This paper introduces a debugging tool for the NAPHP.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.215-220
• /
• 2006

Effective use of debugging in computer science education is a topic that has received little attention. Existing tools either are too overwhelming for the novice or are too basic and inflexible. Furthermore, the integration of the debugger into complex IDEs have unfamiliar debuggers from students, resulting in a harmful proliferation of console I/O. In this paper, a new stand-alone educational debugging tool is presented, with simple but powerful tools for easily observing and modifying program execution state. This tool is analyzed from an user perspective, and is compared with existing tools.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.1-7
• /
• 2010

Detecting data races is important for debugging programs with OpenMP directives, because races result in unintended non-deterministic executions of the program. It is especially important to detect the first data races to occur for effective debugging, because the removal of such races may make other affected races disappear or appear. The previous tools for race detecting can not guarantee that detected races are the first races to occur. This paper suggests a tool what detects the first races to occur on the program with nested parallelism using the two-pass on-the-fly technique. To show functionality of this tool, we empirically compare with the previous tools using a set of the synthetic programs with OpenMP directives.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.87-94
• /
• 2008

Message races should be detected for debugging effectively message-passing programs because they can cause non-deterministic executions of a program. Previous tools for detecting message races report that message races occur in every receive operation which is expected to receive any messages. However message races might not occur in the receive operation if each of messages is transmitted through a different logical communication channel so that their incorrect detection makes it a difficult task for programmers to debug programs. In this paper we suggest a tool, MPIRace-Check, which can exactly detect message races by checking the concurrency between send/receive operations, and by inspecting the logical communication channels of the messages. To detect message races, this tool uses the vector timestamp to check if send and receive operations are concurrent during an execution of a program and it also uses the message envelop to inspect if the logical communication channels of transmitted messages are the same. In our experiment, we show that our tool can exactly detect message races with efficiency using MPI_RTED and a benchmark program. By detecting message races exactly, therefore, our tool enables programmers to develop reliable parallel programs reducing the burden of debugging.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.583-588
• /
• 2005

To develop SoC program for embedded systems, a tool that can remotely debug from host system is needed. Because the existing remote debugging systems using GDB don't offer information of the SoC program execution in real-time, it is difficult to observe condition of the program execution, and also they have limited characteristics to tools and use costly adaptors. In this paper, a real-time tracking tool that can record SoC status on the nv each execution of the assigned instructions is introduced and an economical USB-JTAG adaptor is proposed. And it is shown that this tool can track the execution of a composed program in the target system based on PXA255 processor.

• The Journal of Korean Association of Computer Education
• /
• v.23 no.4
• /
• pp.61-68
• /
• 2020

The purpose of this study is to develop a debugging task to support process-centered assessment on software(SW) education and to develop a service site. Achievement criteria for programming in elementary and middle school SW curriculum consists of control structures such as repetition and condition, and elements such as variables and input/output. In order to apply the process-centered assessment presented by the Ministry of Education, it is necessary to present tasks that can be used in the actual classroom environment and to consider connection with achievement levels. Therefore, in this study, 12 tasks for elementary school and 15 tasks for middle school were developed as debugging tasks and their validity was verified. As a result of conducting Delphi verification for validity, it was found that the level and content of the debugging task are appropriate. In addition, as a result of verifying the usability of the debugging challenge site by applying a heuristic evaluation method, it was found that it is suitable for use in the real educational field.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.301-305
• /
• 2008

Races must be detected for debugging OpenMP programs with directives, because they may cause unintended nondeterministic results of programs. Intel Thread Checker, an existing tool that can detects races, can not verify the existence of races and is often time-consuming and tends to require large space. To solve these problems, we developed a tool that verifies the existence of races using user requirements and analyzed model of programs. However, the tool does not have optimal performance in programs which have no synchronization for interthread coordination. This paper presents an optimal tool that applies the optimum labeling and protocol for program models without interthread coordination. For synthetic programs without interthread synchronization, the tool verifies races over 250 times faster than the previous tool on the average, even if the maximum parallelism increases in every case of which the number of total accesses are identical.