• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.238-240
• /
• 2014

A cloud computing include a SaaS frameworks be able to use a software as a service. Despite the existing service depending on the difference of the tenant and the use, if the service provider re-establish a service, they are required resources In terms of costs and managerial. So we propose a technique for analysis software structure using the process algebra to reuse existing software. A process algebra analyze the structure of the software, express in business process or different languages and verify that it can be reused. As CCS in a process algebra is useful to convert the business process or XML, by using this, we structure a process and propose meta storage for comparison and management a structured document.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.965-983
• /
• 2014

Concurrent behaviors of multithreaded programs cannot be described effectively by automata-based models. Thus, concurrent program intrusion attempts cannot be detected. To address this problem, we proposed the process algebra-based detection model for multithreaded programs (PADMP). We generate process expressions by static binary code analysis. We then add concurrency operators to process expressions and propose a model construction algorithm based on process algebra. We also present a definition of process equivalence and behavior detection rules. Experiments demonstrate that the proposed method can accurately detect errors in multithreaded programs and has linear space-time complexity. The proposed method provides effective support for concurrent behavior modeling and detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1375-1380
• /
• 2014

SaaS at a cloud computing is a framework to provide a software as a service. Depending on the difference of the tenant and the use, if the service provider re-establish a service, they are required resources In terms of costs and managerial. So we propose a technique for analysis of software structure using the process algebra to reuse existing software. A process algebra analyze the structure of the software, express in different languages and verify that it can be reused. CCS in a process algebra is useful to convert the business process or XML, by using this, we structure a process as process view and propose meta storage for comparison and management a structured document.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.337-344
• /
• 2000

In this paper, we define a Process Algebra ACSMR(Algebra of Communicating Shared Multiple Resources) for system specification and verification using multiple resources. ACSMR extends a concept of multiple resources in ACSR that is a branch of formal methods based on process algebra. We'll show that two specification and verification examples. One is the specification of system behavior in multiprocessor using EDF(Earliest-Deadline-First) which is a scheduling algorithm of a real-time system. The other is the specification of describing timing analysis and resources restriction in a super scalar processor using multiple ports registers.

• Journal for History of Mathematics
• /
• v.12 no.1
• /
• pp.21-31
• /
• 1999

This paper deals with the development of universal algebras. We first investigate how the abstract algebra has emerged as a common generalization of arithmetic and algebra of logic, which was finalized by A. N. Whitehead in his "A treatise on universal algebra with applications." And we investigate also the process of formalizing universal algebras by G. Birkhoff. Birkhoff.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.541-552
• /
• 2016

This paper introduces the new notions of conjunctive and complement choices in process algebra, which reduce both process and system complexities significantly for distributed mobile real-time system during specification and analysis phases. The complement choice implies that two processes make cohesive choices for their synchronous partners at their own choice operations. The conjunctive choice implies choice dependency among consecutive choice operations in a process. The conjunctive choice reduces process complexity exponentially by the degree of the consecutive choice operations. The complement choice also reduces system complexity exponentially by the degree of the synchronous choice operations. Consequently, the reduction method makes the specification and analysis of the systems much easier since the complexity is reduced significantly. This notion is implemented in a process algebra, called ${\delta}$-Calculus. The efficiency and effectiveness are demonstrated with an example in a tool for the algebra, called SAVE, which is developed on ADOxx platform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.6
• /
• pp.387-396
• /
• 2014

Recently, there have been continuous efforts and progresses regarding the research on diverse network control and management platforms for SDN (Software Defined Networking). SDN is defined as a new technology to enable service providers/network operators easily to control and manage their networks by writing a simple application program. In SDN, incomplete or malicious programmable entities could cause break-down of underlying networks shared by heterogeneous devices and stake-holders. In this sense, any misunderstanding or diverse interpretations should be completely avoided. This paper proposes a new framework for SDN application verification and a prototype based on the formal method, especially with process algebra called pACSR which is an extended version of Algebra of Communicating Shared Resources (ACSR).

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.200-208
• /
• 2000

Multi-ports register could shared several instructions at the same time in read operation. We address a formal methods for describing timing analysis and resource restriction in pipeline super scalar process that having multi-Port registers. First, we specify in-order pipeline instructions, and then, extend timing analysis in out-of-order super-scalar. In this case, we find instruction pairs in any cycle which can execute same time, We use ACSR(Algebra of Communicating Shared Resources), a branch of formal methods based on process algebra, for instruction specification and modelling.

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

• Journal of Educational Research in Mathematics
• /
• v.8 no.2
• /
• pp.485-494
• /
• 1998

This study is on the theory of Piaget's reflective abstraction and the mechanism of the development of knowledge and the history of algebra and its application to understand the difficulties that many students have in learning algebra. Piaget considers the development of knowledge as a linear process. The stages in the construction of different forms of knowledge are sequential and each stage begins with reorganization. The reorganization consists of the projection onto a higher level from the lower level and the reflection which reconstructs and reorganizes within a lager system that is transferred by profection. Piaget shows that the mechanisms mediating transitions from one historical period to the next are analogous to those mediating the transition from one psychogenetic stage to the next and characterizes the mechanism as the intra, inter, trans sequence. The historical development of algebra is characterized by three periods, which are intra inter, transoperational. The analysis of the history of algebra by the mechanism explains why the difficulties that students have in learning algebra occur and shows that the roles of teachers are important to help students to overcome the difficulties.