• The Journal of Society for e-Business Studies
• /
• v.11 no.2
• /
• pp.93-110
• /
• 2006

A Business Process Management System(BPMS) requires transaction management to guarantee reliability for transactions. Though several transaction protocols have been suggested for the transaction management, the difference of transaction protocols interrupts interoperability among transaction management systems. In this paper, a business process transaction based on semantics is suggested. It is defined based on the static semantics and the operational semantics. As the static semantics defines the ontologies for transaction states and transaction messages using Web Ontology Language(OWL), it solves the difference of expression for the concepts of transaction protocols. As the operational semantics defines state transitions of business process transactions using Abstract State Machine(ASM), it can guarantee formalism for transaction operations. The operational semantics refers to the state ontology and message ontology defined in the static semantics. This approach can enhance interoperability among various transaction protocols, increase the understandability for the transaction protocols, and support autonomous transaction execution and systematic transaction monitoring.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.457-466
• /
• 2007

IEC61131-3 is the standard of control languages in which special purpose controllers and motion controllers such as PLC can be programmed. IL(Instruction List), one of the standard languages, is in assembly level but has some high-level features. This paper describes a formal semantics of IL in operational style. Previous works on IL semantics do not include functions and function blocks, which is not so practical. We define IL semantics including functions and function blocks.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.35-43
• /
• 2007

Semantics-based notations need to be used for specification of static and dynamic semantics to specify and implement new programming language. If the semantics is practically defined, we easily gain a translator according to the implementation of the semantics. In this paper, we describe the static and dynamic semantics to get a translator easily. We present practical semantics-based Action Equations, an extension and transformation of Attribute Grammar(AGs) suitable for specifying the static and dynamic semantics of a object oriented programming language. Compare with the existing descriptions, Action Equations is superior, modernized, and accurate.

• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.54-59
• /
• 2010

Special-purpose microcontrollers PLCs have been widely used in the area of industrial automation. For the research of analysis and verification for PLC programs, first of all we have to specify formal sematics of PLC programming languages. This paper defines formally the operational semantics of LD language. After we transform the graphical language LD into its textual representation Symbolic LD, we give semantics of Symbolic LD since LD language is a graphical language. This paper defines the natural sematics of Symbolic LD and formalizes it in Coq proof assistant.

• Journal of KIISE:Software and Applications
• /
• v.37 no.2
• /
• pp.148-154
• /
• 2010

In the study of the formal semantics of uncertain databases, we typically take an algebraic approach by mapping an uncertain database to possible worlds which are a set of relational databases. In this paper, we present a new semantics for uncertain databases which takes a logical approach by translating uncertain databases into logical theories. A characteristic feature of our semantics is that it uses linear logic, instead of propositional logic, as its logical foundation. Linear logic is suitable for a logical interpretation of uncertain information because unlike propositional logic, it treats logical formulae not as persistent facts but as consumable resources. As the main result, we show that our semantics is faithful to the operational account of uncertain databases in the algebraic approach.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.171-176
• /
• 2003

The core of class loading is assured of type safety. The security of Java greatly depends on type safety. In JVM, type safety mechanism is very difficult and access of accuracy is not clear, so type safety problems were raised. In paper, we analysis simple Java code and present a diagram graph and an operational semantics for dynamic class loading and type safety.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.877-885
• /
• 2000

Static slice means a set of parts of a program that potentially affect the values computed at a slicing criterion considering all the possible input values. In this paper, we have formally defined static slice of a first-order functional language based on operational semantics. And, we have presented a sound method to analyze static slice using abstract interpretation.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.39-45
• /
• 2003

Dynamic dan loading and class linking of Java is a poweful mechanism. Many other system also support some form of dynamic loading and linking, but lazy loading, type-safe linkage, user-definable class loading policy, and multiple namespaces are important features of Java The ue U dan loading is assured of type safety. The security of Java greatly depends on type safety. In JVM, type safety mechanism is very difficult and access of accuracy is not dear, so type safety problems were raised. In paper, n analysis simple Java code and present a diagram graph and an operational semantics for dynamic class loading and type safety.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.145-156
• /
• 2003

Most of the content-based image retrieval systems focuses on similarity-based retrieval of natural picture images by utilizing color. shape, and texture features. For the neuroscience image databases, we found that retrieving similar images based on global average features is meaningless to pathological researchers. To realize the practical content-based retrieval on images in neuroscience databases, it is essential to represent internal contents or semantics of images in detail. In this paper, we present how to represent image contents and their related concepts to support more useful retrieval on such images. We also describe the operational semantics to support these advanced retrievals by using object-oriented message path expressions. Our schemes are flexible and extensible, enabling users to incrementally add more semantics on image contents for more enhanced content searching.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.34-39
• /
• 2005

The progress of silicon technology enables to implement a highly complex digital system on a given chip area. However, even the modern design environment is not so efficient to catch up with the progress of process technology. Design reuse is a promising approach to designing such a complex system in an efficient way. However, the rigidness and inflexibility of a model has been an obstacle to design reuse. This paper proposes a high-level model management methodology by introducing attributed AND-OR graph(AOG), a (formal semantics for representing the possible structure of a model. Using the formalism enables a designer to extract, extend and reuse the pre-modeled and pre-verified design. A complete process of constructing a cache operational model, extending the model and extracting executable models is exemplified to show effectiveness of the proposed framework.