• The KIPS Transactions:PartA
• /
• v.17A no.4
• /
• pp.173-180
• /
• 2010

To specify a formal semantics is to do a significant part for design, standardization and translation of programming languages. The existing studies of a formal semantics for Java have a weak point to describe a clear and practical semantics for an efficient translation. It is necessary to do research for a formal semantics to specify a static and dynamic semantics clearly in order to do an efficient translation. This paper presents the improved Action Equation that specifies a formal semantics for Java to extend the research using Action Equation. The Action Equation is a practical and accurate specification that describes object-oriented programming features and handles exceptions. The specified Action Equation is compared to other descriptions, in terms of readability, modularity, extensibility, and flexibility and then we verified that Action Equation is superior to other formal semantics.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.6
• /
• pp.163-172
• /
• 2021

To specify a formal semantics for a programming language is to do a significant part for design, standardization and translation of it. The Python is popular and powerful, it is necessary to do research for a formal semantics to specify a static and dynamic semantics for Python clearly in order to design a similar language and do an efficient translation. This paper presents the Action Equation 2.0 that specifies a formal semantics for Python to change and update Action Equation. To measure the execution time for Python programs, we implemented the semantic structure specified in Action Equation 2.0 in Java, and prove through simulation that Action Equation 2.0 is a real semantic structure that can be implemented. The specified Action Equation 2.0 is compared to other descriptions, in terms of readability, modularity, extensibility, and flexibility and then we verified that Action Equation 2.0 is superior to other formal semantics.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.13-28
• /
• 2007

This is a speculative paper, describing a recently started effort to give a formal semantics to semantic annotation schemes. Semantic annotations are intended to capture certain semantic information in a text, which means that it only makes sense to use semantic annotations if these have a well-defined semantics. In practice, however, semantic annotation schemes are used that lack any formal semantics. In this paper we outline how existing approaches to the annotation of temporal information, semantic roles, and reference relations can be integrated in a single XML-based format and can be given a formal semantics by translating them into second-order logic. This is argued to offer an incremental aproach to the incorporation of semantic information in natural language processing that does not suffer from the problems of ambiguity and lack of robustness that are common to traditional approaches to computational semantics.

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

본 논문은 SCR 방법으로 작성된 요구사항 명세의 정형적인 의미론을 제안한다. 먼저 우리는 SCR 명세를 시간적전이시스템으로 변환함으로써 SCR 명세의 의미론을 정의한다. 그리고 우리는 SCR 방법을 실시간 시스템의 명세를 위하여 확장하며, 확장된 SCR 명세의 의미론 또한 시간적전이시스템으로의 변환을 통하여 정의한다. 이러한 의미론은 SCR 명세의 병행성과 시간 개념을 제대로 나타낼 수 있으며, 시간적전이시스템에서의 검증 방법을 SCR 명세의 검증에 직접 적용할 수 있게 하는 장점이 있다.Abstract This paper presents a formal semantics for requirements specifications written in the SCR method. We define a semantics for SCR specifications by a translational approach into timed transition systems. Then we extend the SCR method for real-time systems and define a semantics for timed SCR specifications. The main benefit from providing such semantics is that it provides a natural modeling of concurrency and time in SCR specifications. The semantics enables us to directly apply verification methods for timed transition systems to SCR specifications.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.42-53
• /
• 2007

Looking back the history of formal treatment of linguistics, we cannot disregard the contribution of possible world semantics. Intensional logic of Montague semantics, DRT (Discourse Representation Theory), mental space, and situation theory are closely related to or compared with the notion of possible world. All these theories have commonly clarified the structure of belief context or uncertain knowledge, employing hypothesized worlds. In this talk, I firstly brief the pedigree of these theories. Next, I will introduce the recent development of modal logic for the representation of (i) knowledge and belief and (ii) time, in which belief modality is precisely discussed together with the accessibility among possible worlds. I will refer to BDI (belief-desire-intention) logic, CTL (computational tree logic), and sphere-based model in belief revision. Finally, I will discuss how these theories could be applied to the further development of analyses of natural language.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.202-211
• /
• 2003

Abstract Formal definitions of syntax and semantics for the static and dynamic models in Object Oriented methods are already defined. But the behavior of interacting objects is not formalized. In this paper, we defined the common behavior of interacting objects in terms of process algebra using sequence diagram in UML and regularized properties of interacting objects. Based on the results, we can develop a formal specification by. using of the object interaction instead of the existence dependency suggested by M. Snoeck and G. Dedene[9].

• 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 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.

• 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.

• 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.