• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.5
• /
• pp.209-218
• /
• 2015

BPEL is used in various domains since it can describe the flow of works according to conditions and rules, and it can call web services in service-oriented computing environments. However, new functions that are not provided by BPEL grammar are required in specific domains. Generally, when new functions are required, the domain-specific language should be newly defined and developed, which requires high development cost. In this regard, a new function needs to be defined and added instead of developing domain-specific language with the new functions added. However, such methods only allow an addition of a single function, and it is difficult to design and add new functions according to the needs. This paper defines XAS4B document, which extends the BPEL grammar function through XML schema in order to add new functions, and proposes BPEL engine generator that generates BPEL engine with the new functions added by processing the document. The XAS4B document enables the creation of a new grammar added to BPEL using XML schema. It also shows the process of adding new functions to BPEL engine using AspectJ, JAVA implementation of aspect-oriented programming. The proposed system can add new functions using AspectJ without modifying BPEL engine. This allows the provision of new functions at low cost in various domains.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.10-20
• /
• 2010

This paper presents chunking strategy of a contiguous nouns sequence using semantic class. We call contiguous nouns which can be treated like a noun the compound noun phrase. We use noun pairs extracted from a syntactic tagged corpus and their semantic class pairs for chunking of the compound noun phrase. For reliability, these noun pairs and semantic classes are built from a syntactic tagged corpus and detailed dictionary in the Sejong corpus. The compound noun phrase of arbitrary length can also be chunked by these information. The 38,940 pairs of 'left noun - right noun', 65,629 pairs of 'left noun - semantic class of right noun', 46,094 pairs of 'semantic class of left noun - right noun', and 45,243 pairs of 'semantic class of left noun - semantic class of right noun' are used for compound noun phrase chunking. The test data are untrained 1,000 sentences with contiguous nouns of length more than 2randomly selected from Sejong morphological tagged corpus. Our experimental result is 86.89% precision, 80.48% recall, and 83.56% f-measure.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.6
• /
• pp.155-164
• /
• 2018

Many malicious programs have been compressed or encrypted using various commercial packers to prevent reverse engineering, So malicious code analysts must decompress or decrypt them first. The OEP (Original Entry Point) is the address of the first instruction executed after returning the encrypted or compressed executable file back to the original binary state. Several unpackers, including PinDemonium, execute the packed file and keep tracks of the addresses until the OEP appears and find the OEP among the addresses. However, instead of finding exact one OEP, unpackers provide a relatively large set of OEP candidates and sometimes OEP is missing among candidates. In other words, existing unpackers have difficulty in finding the correct OEP. We have developed new tool which provides fewer OEP candidate sets by adding two methods based on the property of the OEP. In this paper, we propose two methods to provide fewer OEP candidate sets by using the property that the function call sequence and parameters are same between packed program and original program. First way is based on a function call. Programs written in the C/C++ language are compiled to translate languages into binary code. Compiler-specific system functions are added to the compiled program. After examining these functions, we have added a method that we suggest to PinDemonium to detect the unpacking work by matching the patterns of system functions that are called in packed programs and unpacked programs. Second way is based on parameters. The parameters include not only the user-entered inputs, but also the system inputs. We have added a method that we suggest to PinDemonium to find the OEP using the system parameters of a particular function in stack memory. OEP detection experiments were performed on sample programs packed by 16 commercial packers. We can reduce the OEP candidate by more than 40% on average compared to PinDemonium except 2 commercial packers which are can not be executed due to the anti-debugging technique.