Improving Property Directed Reachability Using Dynamic Timeframe Expansion
碩士 === 國立臺灣大學 === 電機工程學研究所 === 105 === Property Directed Reachability (PDR) has been the most efficient model checking algorithm since its publication in 2011. Unlike other algorithms which often prefers either SAT cases (bug finders) or UNSAT cases (prover), PDR is well balanced that it can solve b...
Main Authors: | Cheng-Han Yang, 楊承翰 |
---|---|
Other Authors: | Chung-Yang (Ric) Huang |
Format: | Others |
Language: | en_US |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/8jzaxj |
Similar Items
-
Improving Property Directed Reachability with Temporal Decomposition
by: Ming-Jen Yang, et al.
Published: (2016) -
Improving Property Directed Reachability Using Gate-Level Abstraction
by: Kuan Fan, et al.
Published: (2015) -
Property Directed Reachability with InterpolationRefinement
by: Shih-Yu Chuang, et al.
Published: (2019) -
Avoiding the “Great Filter”: A Projected Timeframe for Human Expansion Off-World
by: Jonathan H. Jiang, et al.
Published: (2021-07-01) -
P-adic modeling of the RTS index dynamics depending on the timeframes
by: Peter Mikhailovich Simonov, et al.
Published: (2019-05-01)