公开(公告)号：US20220358223A1

公开(公告)日：2022-11-10

申请号：US17602372

申请日：2021-04-06

Applicant: Korea University Research and Business Foundation

Inventor： Hakjoo OH ,  Sunbeom SO ,  Seongjoon HONG

IPC: G06F21/57 ,  G06Q10/04

Abstract: Provided is an apparatus and method for obtaining a vulnerable transaction sequence. A vulnerable transaction sequence obtaining apparatus may include a storage configured to transitorily or non-transitorily store at least one program; and a processor configured to receive the at least one program, to select a vulnerable transaction sequence candidate in the at least one program using a cost function, to obtain a verification condition by performing symbolic execution over the transaction sequence candidate, and to check whether the verification condition is satisfiable when the vulnerable transaction sequence is unfound as a verification result about the verification condition, and to determine the vulnerable transaction sequence candidate as the vulnerable transaction sequence when the verification condition is satisfiable.

公开(公告)号：US20240176691A1

公开(公告)日：2024-05-30

申请号：US18517107

申请日：2023-11-22

Applicant: Korea University Research and Business Foundation

Inventor： Hakjoo OH ,  Junhee LEE ,  Seongjoon HONG

IPC: G06F11/07 ,  G06F11/36

CPC classification number: G06F11/0793 ,  G06F11/3664

Abstract: Disclosed is a method for repairing a null pointer exception performed by a computing device including a processor, which includes: obtaining an original program; and obtaining, by using a classification model, a patch program from the original program by repairing an error of the original program; and, in which the classification model may be trained in advance by using a null processing pattern dataset obtained from at least one program.

公开(公告)号：US20200257617A1

公开(公告)日：2020-08-13

申请号：US16860382

申请日：2020-04-28

Applicant: Korea University Research and Business Foundation

Inventor： Sooyoung CHA ,  Seongjoon HONG ,  Junhee LEE ,  Hakjoo OH

IPC: G06F11/36

Abstract: Provided is a method for automatically generating a search heuristic that is optimal for a test subject program and a method of concolic testing that uses a parameterized search heuristic to yield a consistent test performance for any program.