• Asia pacific journal of information systems
• /
• v.11 no.2
• /
• pp.121-139
• /
• 2001

VOQL* query language, recently proposed, is a visual language for object-oriented databases. It is based on Ven Diagram and graph, so that the underlying schema structure can be naturally implied in query expressions. In VOQL*, structural relationship among the objects used in a query expression is represented graphically and thus it has formal semantics that can be inductively defined, as well as it can be used with ease. In this paper, we proposed revised VOQL* and introduced its query processor, InQs(Intelligent Querying System). While retaining the merit of VOQL* that it allows the structural relationship among the objects to be represented visually, the revised VOQL* has another merit that users can formulate a query interactively using various forms supplied by InQs. As a query processor that translates queries in revised VOQL into those in ODMG OQL, InQs provides an environment in which users express queries in revised VOQL* and then the system automatically translates them into those in ODMG OQL. Translation algorithm of InQs is much simpler and intuitive than other algorithms used in QUIVER and other systems, since it reflects the formal semantics of VOQL*, which is defined inductively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.608-619
• /
• 2000

In this paper, we give a formal semantics for Statechart via a translation into Algebra of Communicating Shared Hesources(ACSR). Statechart is a very rich graphical specification language, which is suitable to specify complicated reactive systems. However, the incorporation of graph into specification and rich syntax makes Statechart semantics very complicated and ambiguous. Thus, it is very difficult to verify the correctness of Statechart specifications. Also, we propose the formal verification method for Statechart specifications by showing equivalence relation between two Statechart specifications. This makes it possible to combine the advantages of a graphical language with the rigor of process algebra.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.570-592
• /
• 2019

The Event-B design pattern is an excellent way to quickly develop a formal model of the system. Researchers have proposed a number of Event-B design patterns, but they all lack formal behavior semantics. This makes the analysis, verification, and simulation of the behavior of the Event-B model very difficult, especially for the control-intensive systems. In this paper, we propose a novel method to transform the Event-B synchronous control flow design pattern into the labeled transition system (LTS) behavior model. Then we map the design pattern instantiation process of Event-B to the instantiation process of LTS model and get the LTS behavior semantic model of Event-B model of a multi-level complex control system. Finally, we verify the linear temporal logic behavior properties of the LTS model. The experimental results show that the analysis and simulation of system behavior become easier and the verification of the behavior properties of the system become convenient after the Event-B model is converted to the LTS model.

• Korean Institute of Interior Design Journal
• /
• v.18 no.5
• /
• pp.71-79
• /
• 2009

This research understands semantics-system in contemporary space design as a poetic form. It provides that the possibility of various interpretation of space and makes to escape from insipid formal logic of compulsion uniform meaning. In order to unfold this argument, poetic semantics system has to be revealed using conversion of articulation factors in text of space(semantics and syntax). First of all, after setting up the articulation system of space language, we have to understand the conversion of articulation factors that generate a new grammar breaking up the rule of old syntax. And the various expression of form in Contemporary Space design focuses on a poetic expression, that is, the abstraction system fused by space factors(conversion of articulation system). In this method of research to recognize the subject of space in architecture, the importance of interpretation has to be highlighted, as the importance of language is emphasized that intermediates between object and interpretation. The reason to recognize Contemporary space design as a text is that it is a gathering of symbol as a object of interpretation and a mediator. The important issue of this study is to research how and what to transmit by poetic semantics system in contemporary space design. It brings about a poetic problem what it intends to becomes(the problem of meaning operation) in a narrow sense and a interpretational problem what it intends to do(the problem of communication). When we define interpretation the technique of defining a text, it involves the premise of inevitableness of multiple understanding, or the possibility to Interpret variously. In the end the ambiguity of poetic language and the infinity of moaning process as the moaning expansion system in contemporary space design is the flexible measure to solve the self-criticism.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2016

One of the most important aspects of the research on multi-agent systems is the definition of agent communication languages(ACLs) and the specification of a proper formal semantics of ACLs. In this paper, we propose an illocutionary effect-based FIPA-ACL semantics which overcomes the two traditional semantic approaches. The key idea of this new semantics is based on the semantic concepts of success and satisfaction conditions of illocutionary acts in speech act theory, and the common ground theory-based framework. As case studies using this new semantics, we define the primitive speech acts of FIPA-ACL such as inform and request. For the strengths of the proposed approach we illustrate our new semantics on an e-commerce agent purchase negotiation. Also, we compare this approach with two traditional semantic approaches for ACLs.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.5
• /
• pp.157-164
• /
• 2023

Specifying the semantic structure for functional interfaces and lambda expressions, which are the latest features of Java, can be referenced when designing similar functions in the future, and is also required in the process of standardizing or implementing an optimized translator. In this study, action equation 3.0 is newly proposed to express the static and dynamic semantic structure of functional interfaces and lambda expressions by modifying and upgrading the existing expressions to express the semantic structures of java functional interfaces and lambda expressions. Measure the execution time of java programs by implementing the semantic structure specified in action equation 3.0 in java, and prove that action equation 3.0 is a real semantic structure that can be implemented through simulation. The superiority of this action equation 3.0 is to be confirmed by comparing the action equation 3.0 specified in the four areas of readability, modularity, extensibility and flexibility with the existing representative semantic expression methods.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.107-117
• /
• 2010

The feature models representing the common and variable concepts among the software products and the feature configurations generated by selecting the features to be included in the target product are the essential components in the software product lines methodology. Although the researches on the formal semantics and reasoning of the feature models and feature configurations are in progress, the researches on feature model ontologies and feature configuration validation using the semantic web technologies are yet insufficient. This paper defines the formal semantics of the feature models and proposes a feature configuration validation technique based on ontology and semantic web technologies. OWL(Web Ontology Language), a semantic web standard language, is used to represent the knowledge in the feature models and the feature configurations. SWRL(Semantic Web Rule Language), a semantic web rule languages, is used to define the rules to validate the feature configurations. The approach in this paper provides the formal semantic of the feature models, automates the validation of feature configurations, and enables the application of various semantic web technologies, such as SQWRL.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.3
• /
• pp.79-94
• /
• 1997

OMG (Object Management Group) published a security service specification, called CORBA (Common Object Request Broker Architecture) security reference model because the integration of security and object-oriented techniques was critical for successful deployment of distributed object systems. The CORBA security reference model treats access control as an implementation independent semantic concept but has incomplete semantics of the access control function. Because of such imcompleteness it is difficult for the system administrator and the CORBA security implementor to have the same understanding for the meaning of access control in the CORBA security. We propose a formal model for access control the CORBA security using the formal description language, which is called Z language based on typed set theory. The proposed model provides concrete semantics of the access control function to both the system administrator and the implementor.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.1018-1027
• /
• 1999

속성 문법은 언어의 정적인 의미구조를 표현하는 형식적인 표기법으로 동적인 의미구조를 표현하기는 부적절하다. 동적 의미구조를 잘 명세하고 명세된 언어를 구현하기 위해서 기존의 속성 문법을 확장하여 언어 구현에 필요한 동적인 작용들(actions)을 잘 표현해야 한다. 본 논문에서는 속성 문법을 확장하여 정적이고 동적인 의미구조를 잘 표현할 수 있는 새로운 작용 식(action equation)을 제시한다. 제시된 작용 식(action equation)의 동적인 의미 구조로 부터 SIMP 언어의 점진 해석기(incremental interpreter)를 설계하고 구현한다. 점진 해석기는 언어 기반의 프로그래밍 환경에서 수정된 부분만을 번역하여 프로그램의 전체 실행 결과를 얻는 해석기를 의미한다. 본 해석기는 SUN 1000에서 Lex와 Yacc을 사용해서 C 언어로 설계하고 구현하였다. 예제 프로그램을 실행시켰을 때 배정 문이나 IF문의 경우는 매우 효율적이었고 Loop의 경우는 재실행될 필요가 있는 영향받는 명령문들이 적을수록 점진 해석이 더 효율적으로 수행된다.Abstract Attribute grammars are a formal notation which expresses the static semantics of programming languages, but they are not suitable for expressing dynamic semantics. To describe dynamic semantics and implement a specified language, we extend attribute grammars and present new action equations which describe static and dynamic semantics. The incremental interpreter of a SIMP language is designed and implemented from the dynamic semantics of presented action equations. The incremental interpreter is to translate only modified part in the language-based programming environments and have results of whole program.Our interpreter is implemented in C with Lex and Yacc on SUN 1000. When we execute example programs, the incremental evaluation of any assignment and IF statements executes efficiently. But in the case of loop, we execute efficiently when the effected statements to be reexecuted in the loop are of small number.

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

Hardware and software codesign framework called PeaCE(Ptolemy extension as a Cod sign Environment) allows to express both data flow and control flow. To formally verify an fFSM specification which expresses control flow in PeaCE, the step semantics of the model was defined. In this paper, we introduce the automatic verification tool developed by formal semantics of previous work. This tool uses the SMV as inner model checker md, through our tool, users can formally verify some important bugs such as race condition, ambiguous transition, and circulartransition without directly writing logical formulae.