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

• The Journal of Korea Robotics Society
• /
• v.17 no.3
• /
• pp.334-338
• /
• 2022

In visual simultaneous localization and mapping (vSLAM), the correct recognition of a place benefits in relocalization and improved map accuracy. However, its performance is significantly affected by the environmental conditions such as variation in light, viewpoints, seasons, and presence of dynamic objects. This research addresses the problem of feature occlusion caused by interference of dynamic objects leading to the poor performance of visual place recognition algorithm. To overcome the aforementioned problem, this research analyzes the role of scene semantics in correct detection of a place in challenging environments and presents a semantics aided visual place recognition method. Semantics being invariant to viewpoint changes and dynamic environment can improve the overall performance of the place matching method. The proposed method is evaluated on the two benchmark datasets with dynamic environment and seasonal changes. Experimental results show the improved performance of the visual place recognition method for vSLAM.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.859-869
• /
• 2014

In recent years, the obfuscation techniques are commonly exploited to protect malwares, so obfuscated malwares have become a big threat. Especially, it is extremely hard to analyze virtualization-obfuscated malwares based on unusual virtual machines, because the original program is hidden by the virtual machine as well as its semantics is mixed with the semantics of the virtual machine. To confront this threat, we suggest a framework to analyze virtualization-obfuscated programs based on the dynamic analysis. First, we extract the dynamic execution trace of the virtualization-obfuscated executables. Second, we analyze the traces by translating machine instruction sequences into the intermediate representation and extract the virtual machine architecture by constructing dynamic context flow graphs. Finally, we extract abstract semantics of the original program using the extracted virtual machine architecture. In this paper, we propose a method to extract the information of the original program from a virtualization-obfuscated program by some commercial obfuscation tools. We expect that our tool can be used to understand virtualization-obfuscated programs and integrate other program analysis techniques so that it can be applied to analysis of the semantics of original programs using the abstract semantics.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.111-120
• /
• 2004

In order to increase the productivity of software, the research to reduce the total cost in software development environments is working, Considerable time is wasted waiting for a changed program in program development, however smell the change, to be edited and compiled and executed. In case of partial change, we need incremental interpreter for reexecuting the changed parts and its affected parts, In this paper, we implement the incremental interpreter by using analyzing dynamic semantics at execution time, We define a new IMPLO(IMPerative Language with Object) language using EBNF(Extended Backus Naur Form) notation and then, design and implement the incremental interpreter of this language by using action equations to describe the dynamic semantics.

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

• English Language & Literature Teaching
• /
• v.18 no.3
• /
• pp.175-190
• /
• 2012

The purpose of this article is to explain the meanings and uses of the English auxiliaries will morpho-syntactically, and answer the question of whether will is a tense auxiliary or a modal one. Some writers even exclude will completely from the semantics of the modal auxiliaries. They argue that the semantics of will is fundamentally non-modal and has only a few modal-like uses. There are some people who treat will to be semantically separate from the other modal auxiliaries. In the light of modal will, the semantics of will basically remains anchored in volition because the lack of required speaker subjectivity, but has undergone so much semantic bleaching that it may also express future time without volition. On the other hand, the semantics of will in the exclusionist view is erroneous and that its semantics is in fact closely related to the semantics of the other modals. This view reinforces the argument that the morpho-syntactic kinship of will, can, may and must also reflects semantic kinship. It is suggested that all the modal auxiliaries show that the correspondence relation is non-verified but potential. And the specific place that will holds is that the correspondence is unverified at the time of utterance but will turn out to become verified. The overall conclusion is that idiosyncratic morpho-syntax shared by the modals reflects the semantics and pragmatics of the English modal auxiliaries and is forced also to include will.

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

• Language and Information
• /
• v.1
• /
• pp.227-276
• /
• 1997

There has been no nuanimous analysis of specific indefinites. It is still disputed even whether specificity is a matter of semantics of pragmatics. In this paper, I introduce some properties of specific indefinites, and explain them based on the meaning of specificity. Specificity intuitively means that the speaker or someone else in the context has some individual in mind, which is generally accepted among liguistics. The main issue is how to represent the meaning of 'have-in-mind'. I review some philosophical discusstions of cognitive contact and show that when the use of an expression involves 'have-in-mind', the expression is rigid designator in the belief of the agent who has an individual in mind. in the use of a specific indefinite, this applies only to the information state of the agent of 'have-in-mind'. To represent this asymmetry, I propose a new theory of dynamic semantics, in which a common ground consists of multiple information states, as many as the number of the participants in a conversation. Moreover, each information state is structured as a set of epistemic alternatives, which is a set of possible information states of a participant in the context. Based on this semantics, the properties of specific indefinites are explained.

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

• Language and Information
• /
• v.14 no.2
• /
• pp.103-129
• /
• 2010

In this paper, I show that anaphora across speakers shows both dynamic and static sides. To capture them all formally, I will adopt semantics based on the assumption that variables range over individual concepts that connect epistemic alternatives. As information increases, a variable can take a different range of possible individual concepts. This is captured by the notion of virtual individual (= vi), a set of individual concepts which are indistinguishable in an information state. The use of a pronoun involves two information states, one for the antecedent, which is always part of the common ground, and the other for the pronoun. Information increase changes vis for variables in the common ground. A pronoun can be used felicitously if there is a unique virtual individual in the information state for the antecedent which does not split in two or more distinctive virtual individuals in the information state for the pronoun. The felicity condition for cross-speaker anaphora can be satisfied in declaratives involving modality, interrogatives and imperatives in a rather less demanding way, because in these cases the utterance does not necessarily require non-trivial personal information for proper use of a pronoun.