-
公开(公告)号:US12253909B2
公开(公告)日:2025-03-18
申请号:US17950461
申请日:2022-09-22
Inventor: Hakjoo Oh , Dowon Song
IPC: G06F11/36 , G06F11/07 , G06F11/3668
Abstract: Disclosed is a method for feedback of a program, which is performed by a computing device including at least one processor, which include: matching respective functions included in a first program received from an external device with respective functions included in a prestored correct answer program corresponding to the first program; identifying error functions different from the respective functions included in the correct answer program among the respective functions included in the first program; generating at least one repair template including at least one reference function extracted based on a calling-context for a function of a specific function in order to repair the error function among the prestored functions; generating a first edit script for repairing the error function to at least one reference function based on a first repair template among one or more repair templates; and transmitting a signal including the first edit script to the external device.
-
公开(公告)号:US10922209B2
公开(公告)日:2021-02-16
申请号:US16421097
申请日:2019-05-23
Inventor: Hakjoo Oh , Junhee Lee , Seongjoon Hong
Abstract: A device for automatically repairing memory deallocation errors is disclosed. The device includes: a static analysis unit configured to generate status information for each one of the objects included in the source code of a program by way of a static analysis of the source code, where the status information includes position information, pointer information, and patch information, the position information associated with allocation sites of the objects, the pointer information associated with pointers pointing to the objects, the patch information associated with deallocation statements capable of deallocating the objects; a decision unit configured to choose patch candidates from the patch information and decide on a combination of the patch candidates capable of deallocating each of the objects only once; and a repair unit configured to repair the source code according to the combination of patch candidates.
-
公开(公告)号:US10853230B2
公开(公告)日:2020-12-01
申请号:US16860382
申请日:2020-04-28
Inventor: Sooyoung Cha , Seongjoon Hong , Junhee Lee , Hakjoo Oh
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.
-
公开(公告)号:US12086055B2
公开(公告)日:2024-09-10
申请号:US17496012
申请日:2021-10-07
Inventor: Hakjoo Oh , Sooyoung Cha
CPC classification number: G06F11/3688 , G06F11/3676 , G06F17/16 , G06F11/3447 , G06F11/3452
Abstract: A symbolic execution device, a symbolic execution method, and a probability distribution update method for symbolic execution are provided. The symbolic execution device includes a storage unit for storing at least one of a first probability distribution and a second probability distribution and a processor for sampling and obtaining a weight vector from the first probability distribution, for sampling and obtaining a removal rate from the second probability distribution, for adding the weight vector to at least one feature vector obtained from at least one candidate state to obtain a score for each of the at least one candidate state, and for selecting a state to be removed from among the at least one candidate state by using the score of each of the at least one candidate state and the removal rate.
-
公开(公告)号:US10678680B2
公开(公告)日:2020-06-09
申请号:US15985899
申请日:2018-05-22
Inventor: Sooyoung Cha , Seongjoon Hong , Junhee Lee , Hakjoo Oh
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.
-
公开(公告)号:US20190258566A1
公开(公告)日:2019-08-22
申请号:US15985899
申请日:2018-05-22
Inventor: Sooyoung CHA , Seongjoon Hong , Junhee Lee , Hakjoo Oh
IPC: G06F11/36
Abstract: A method of generating a search heuristic for concolic testing includes: (a) generating feature vectors corresponding to branches included in the subject program and initializing sample spaces; (b) randomly generating first parameter vectors that contain components selected from the sample spaces; (c) selecting second parameter vectors based on a first branch coverage of each first parameter vector for the subject program; (d) reducing the sample spaces based on an average branch coverage of each second parameter vector for the subject program; (e) repeating steps (b) to (d) such that the average branch coverage of some of the second parameter vectors converges to a maximum; and (f) when the average branch coverage converges to a maximum, outputting an optimal parameter vector corresponding to the maximum average branch coverage, where the components of the first parameter vectors are selected from the sample spaces reduces in step (d) when step (b) is repeated.
-
-
-
-
-