バージョンの充足可能性問題 | POSTD
sbv
sbv: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving. Express properties about Haskell programs and automatically prove them using SMT (Satisfiability Modulo Theories) solvers. [Skip to Readme] DataData.SBVData.SBV.CharData.SBV.ControlData.SBV.DynamicData.SBV.EitherData.SBV.FloatData.SBV.InternalsData.SBV.ListData.SBV.MaybeData.SBV.RationalData.SBV.RegExpData.SBV.SetData.
The Yices SMT Solver
Yices 2 is an SMT solver that decides the satisfiability of formulas containing uninterpreted function symbols with equality, real and integer arithmetic, bitvectors, scalar types, and tuples. Yices 2 supports both linear and nonlinear arithmetic. Yices 2 can process input written in the SMT-LIB notation (both versions 2.0 and 1.2 are supported). Alternatively, you can write specifications using Y
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
https://smtlib.cs.uiowa.edu/
Tseytin transformation - Wikipedia
SAT Competitions
