SAT-Based Unbounded Symbolic Model Checking = 범위를 지정하지 않는 SAT 기반 모델 검증에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 335
  • Download : 0
In this thesis, a SAT-based unbounded symbolic model checking algorithm is proposed to reduce memory usage. The conjunctive normal form is used to represent sets of states and transition relation. A logical operation on state sets is implemented as an operation on conjunctive-normal-form formulas. A Satisfy-All procedure is proposed to compute the existential quantification required in obtaining the pre-image and fix-point. The proposed Satisfy-All procedure is implemented by modifying a SAT procedure to generate all the satisfying assignments of the input formula, which is based on new efficient techniques such as line justification to make an assignment covering more search space, excluding clause management, and two-level logic minimization to compress the set of found assignments. In addition, a cache table is introduced into the Satisfy-All procedure. It is a difficult problem for a Satisfy-All procedure to detect the case that a previous result can be reused. This thesis shows that the case can be detected by comparing sets of undetermined variables and clauses. The data structure that can perform the operation efficiently will also be described. Line justification and excluding clause management schemes are discussed to be applied to the cache scheme. It will be discussed also to obtain better performance when the cache scheme is applied. A few benchmark circuits with various sizes are used in the experiments. Parameters will be determined based on the performance measure. The experimental results show the proposed algorithm can check more circuits than BDD-based and previous SAT-based model checking algorithms.
Advisors
Park, In-Cheolresearcher박인철researcher
Description
한국과학기술원 : 전기및전자공학전공,
Publisher
한국과학기술원
Issue Date
2005
Identifier
245072/325007  / 020005011
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2005.2, [ vii, 88 p. ]

Keywords

Formal verification; SAT-based unbunded symbolic; SAT 기반 모델 검증; 형식 검증

URI
http://hdl.handle.net/10203/35294
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=245072&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0