Boolean Satisfiability Solvers and Their Applications in Model Checking
Proceedings of the IEEE(2015)
摘要
Boolean satisfiability (SAT)-the problem of determining whether there exists an assignment satisfying a given Boolean formula-is a fundamental intractable problem in computer science. SAT has many applications in electronic design automation (EDA), notably in synthesis and verification. Consequently, SAT has received much attention from the EDA community, who developed algorithms that have had a s...
更多查看译文
关键词
Model checking,Boolean functions,Data structures,Context modeling,Algorithm design and analysis,Automatic test pattern generation,Computer science
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要