Paper:
Language: English:

An Efficient Specification for System Verification

Chikatoshi Yamada^*, Yasunori Nagata^, and Zensho Nakao^

^*Takushoku University Hokkaido College, 4558 Memu, Fukagawa, Hokkaido 074-8585, Japan
^**Department of Electrical and Electronics Engineering, University of the Ryukyus, 1 Senbaru, Nishihara, Nakagami, Okinawa 903-0213, Japan

Received: November 11, 2005

Accepted: February 8, 2006

Keywords: formal verification, computation tree logic, temporal formula specification, strong/weak temporal order relation

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.10, No.6 pp. 931-938, 2006

Abstract

In design of complex and large scale systems, system verification has played an important role. In this article, we focus on specification process of model checking in system verifications. Modeled systems are in general specified by temporal formulas of computation tree logic, and users must know well about temporal specification because the specification might be complex. We propose a method by which specifications with temporal formulas are obtained inductively. We will show verification results using the proposed temporal formula specification method, and show that amount of memory, OBDD nodes, and execution time are reduced.

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here: