• Journal of architectural history
• /
• v.3 no.1
• /
• pp.143-159
• /
• 1994

Ornament in late nineteenth century Art Nouveau movement, especially abstract ornament in Viennese Art Nouveau, has a very complex aesthetical background. Ornament, for them was not just decorations in outer appearance, but a determinant element of formal languages. Abstract ornament in Viennese Art Nouveau has its theoretical and aesthetical bases in the Interpretation of nature, that is, the theory of the abstract ornament was founded on a new interpretation of nature, which, in its turn, was derived from the differentiational selection of the contemporary views of nature. The modernity of abstract ornament consists in the very fact that it was founded on a new interpretation of nature. This study alms at reviewing how the new interpretation of nature by abstract ornament criticized, rejected and accepted the contemporary views of nature. The overall tendency of this study is to synthesize and analyze the historical background of Viennes Art-Nouveau in regard to aesthetic theories of nature. The analysis method of this study is interpretation of written documents which are related to the issue.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.79-89
• /
• 1997

Logic programming has many advantages as a paradigm for parallel programming because it offers ease of programming while retaining high expressive power due to its declarative semantics. In parallel logic programming, one of the important issues is the compile-time parallelism detection. Static data-dependency analysis has been widely used to gather some information needed for the detection of AND-parallelism. However, the static data-dependency analysis cannot fully detect AND-parallelism because it does not provide some necessary functions such as the propagation of groundness. As an alternative approach, abstract interpretation provides a promising way to deal with AND-parallelism detection, while a full-blown abstract interpretation is not efficient in terms of computation since it inherently employs some complex operations not necessary for gathering the information on AND-parallelism. In this paper, we propose an abstract domain which can provide a precise and efficient way to use the abstract interpretation for the detection of AND-parallelism of logic programs.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.166-169
• /
• 2002

In this paper, implements the abstract interpretation of the imperative language While in SMV model-checker and explain how to apply the logic of CTL which example the security of information flow. And show the way to translate the abstract program of While into SMV program and explain the derive process of CTL logic to test the security of the information flow. For the various security test, it is suitable to use the model-checking than to implements the abstract interpretation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.460-462
• /
• 2001

테스트 데이터의 자동 생성은 소프트웨어 테스팅에서 가장 중요하면서도 어려운 부분이다. 대부분의 데스트 데이터 자동생성에 관한 연구는 명세로부터 테스트 데이터를 자동 생성하는 방식이며 이틀 위해 정확한 정형적 명세를 필요로 한다. 본 논문에서 는 프로그램을 실 행하지 않고 프로그램의 동적인 특성을 분석할 수 있는 요약 해석(abstract interpretation) 방법과 선후 지배 관계(pre-, postdominance relationship)를 이용하여 프로그램 코드로부터 직접 테스트 데이터를 자동 생성할 수 있는 방법 을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.343-345
• /
• 2001

요약해석(abstract interpretation)이란 래티스(lattice)로 표현되는 요약된 공간에서 프로그램을 수행함으로써 프로그램의 성질을 분석하는 방법이다. 요약해석에서 프로그램의 분석 결과는, 정보가 없는 상태에서 시작하여 더 이상 정보의 증가가 없을 때까지 프로그램을 반복해서 수행함으로써 얻어지는 고정점(fixpoint)에 의하여 표현된다. 본 연구에서는 이러한 고정정 계산의 속도를 높이기 위하여 이전 반복의 계산 결과를 최대한 이용하는 방법을 제시한다. 그리고 제시된 방법을 상수 및 이명 분석의 구현에 적응하여 실제로 분석 속도가 증가함을 보였다.

• ETRI Journal
• /
• v.16 no.4
• /
• pp.27-47
• /
• 1995

This paper improves top-down execution models of logic programs based on a two-phase abstract interpretation which consists of a bottom-up analysis followed by a top-down one. The two-phase analysis provides an approximation of all (possibly non-ground) success patterns of clauses relevant to a query. It is specialized by considering Sato and Tamaki’s depth k abstraction as abstract function. By the ability of the analysis to approximate possibly non-ground success patterns of clauses relevant to a query, it can be statically determined whether some subgoals will fail during execution and some succeeding subgoals do not participate in success patterns of program clauses relevant to a given query. These properties are utilized to improve execution models. This approach can be easily applied to any top-down (parallel) execution models. As instances, it is shown to be applicable to linear execution model and AND/OR Process Model.

• Proceedings of the Zoological Society Korea Conference
• /
• 1994.10a
• /
• pp.67-67
• /
• 1994

No Abstract, See Full Text

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.590-606
• /
• 2009

We present a static analyzer that detects memory leaks in C programs. It achieves relatively high accuracy at a relatively low cost on SPEC2000 benchmarks and several open-source software packages, demonstrating its practicality and competitive edge against other reported analyzers: for a set of benchmarks totaling 1,777 KLOCs, it found 332 bugs with 47 additional false positives (a 12.4% false-positive ratio), and the average analysis speed was 720 LOC/sec. We separately analyze each procedure's memory behavior into a summary that is used in analyzing its call sites. Each procedural summary is parameterized by the procedure's call context so that it can be instantiated at different call sites. What information to capture in each procedural summary has been carefully tuned so that the summary should not lose any common memory-leak-related behaviors in real-world C program. Because each procedure is summarized by conventional fixpoint iteration over the abstract semantics ('a la abstract interpretation), the analyzer naturally handles arbitrary call cycles from direct or indirect recursive calls.

• Nuclear Engineering and Technology
• /
• v.47 no.2
• /
• pp.212-218
• /
• 2015

We describe a comparative analysis of different tools used to assess safety-critical software used in nuclear power plants. To enhance the credibility of safety assessments and to optimize safety justification costs, $Electricit{\acute{e}}$ de France (EDF) investigates the use of methods and tools for source code semantic analysis, to obtain indisputable evidence and help assessors focus on the most critical issues. EDF has been using the PolySpace tool for more than 10 years. Currently, new industrial tools based on the same formal approach, Abstract Interpretation, are available. Practical experimentation with these new tools shows that the precision obtained on one of our shutdown systems software packages is substantially improved. In the first part of this article, we present the analysis principles of the tools used in our experimentation. In the second part, we present the main characteristics of protection-system software, and why these characteristics are well adapted for the new analysis tools. In the last part, we present an overview of the results and the limitations of the tools.

• Proceedings of the Korean Quaternary Association Conference
• /
• 1990.08a
• /
• pp.68-68
• /
• 1990

No abstract, See full-text