Some Semantic Approach

 Include:
    * Operational Semantic
    * Semantic denotation
    * Axiomatic Semantic
    * Algebraic Semantic
    * Structured Operational Semantic / Natural Semantic


Operational Semantics 

In computer science, operational semantics is a way to give meaning to the computer program with a rigorous mathematical way. Operational semantics are classified into two categories: structural operational semantics (or small-step semantics) formally describes how the individual steps of a calculation which takes place in a computer-based systems. By the opposition of natural semantics (or big-step semantics) explains how the overall results obtained from execution.

Semantic denotation 

In any semantic denotation concept derived from English denotation (n) or to denote (v). In the Indonesian language means "a sign for" or "point to" .. Denotation is the relationship between lexical units with all the objects out of context (Matthews 1997: 91).
Axiomatic SemanticAxiomatic semantics is an approach based on mathematical logic to prove the truth of a computer program. This is closely related to Hoare logic. Axiomatic semantics define the meaning of the commands in the program by describing its effect on the statement about the state program. The statement is a logical statement - predicate with variables, which variables determine the state of the program.

Algebraic Semantic 

A programming language theory, algebraic semantics of the programming language is a form of axiomatic semantics based on the law of algebra for describing and reasoning about the semantics of a formal program. In mathematical logic, algebra semantics is a formal semantics based on the algebras studied as part of the logic of algebra. For example, S4 is the logic of capital is characterized by a class of topological boolean algebras-namely, boolean algebras with operators interior. The logic of the other capital was marked with various algebras with other operators. Class of boolean algebras characterize classical propositional logic, and the class of Heyting algebras intuitionistic propositional logic.

Structured Operational Semantic / Natural SemanticStructural

operational semantics (also called structured operational semantics or small-step semantics) was introduced by Gordon Plotkin in (Plotkin81) as a logical means for defining the operational semantics. The basic idea behind SOS is to determine the behavior of a program in terms of the behavior of its parts, thus providing, namely structural, syntax-oriented and inductive, the appearance of the operational semantics. SOS specification defines the behavior of a program in terms of transition relations (sets) (s). SOS specification takes the form of a set of inference rules that define valid transition from a composite piece of syntax in terms of transition components.