A QBF-Based Recompiler for Code Generation on Erroneous Processors and Beyond
碩士 === 國立臺灣大學 === 電子工程學研究所 === 103 === With the increasing complexity of designs, verification becomes more and more challenging. Even with formal verification techniques deployed, post-silicon bugs are not uncommon to be found in manufactured chips. For processor designs, post-silicon bugs may poss...
Main Authors: | Ping-Han Tsai, 蔡秉翰 |
---|---|
Other Authors: | Jie-Hong Jiang |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/77429895571656255580 |
Similar Items
-
Solving QBF by Abstraction
by: Jesko Hecking-Harbusch, et al.
Published: (2018-09-01) -
QBF proof complexity
by: Chew, Leroy Nicholas
Published: (2017) -
Exploiting Problem Structure in QBF Solving
by: Goultiaeva, Alexandra
Published: (2014) -
Exploiting Problem Structure in QBF Solving
by: Goultiaeva, Alexandra
Published: (2014) -
Compact Tree Encodings for Planning as QBF
by: Olivier Gasquet, et al.
Published: (2018-10-01)