SMT问题以及STP

1.   形式化方法是一种有效的计算机软、硬件系统可信性验证手段。其主要技术包括模型检验，定理证明，等价性检验以及语言包含等。许多形式化验证问题最终都归结于布尔可满足问题(SAT)，它用来判断命题逻辑公式是否为可满足的。SAT是第一个被证明的NP完全问题。与SAT相比，SMT问题具有表达能力更强、抽象层次更高的优点，因而，迅速成为了形式化验证中的重要问题。
2.   STP is a constraint solver that can solve many kinds of problems including those by program analysis tools, theorem provers, automated bug finders, cryptographic algorithms, intelligent fuzzers and model checkers. STP is actively developed and used by many, including large companies and research institutes.