Satisfiability modulo theories 论文

2011Communications of the ACM引用 625
Logic, programming, and type systemsFormal Methods in VerificationLogic, Reasoning, and Knowledge

摘要

Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.

相关事件

暂无数据

相关文章

暂无数据