Brief announcement: verification of stabilizing programs with SMT solvers
SSS（2012）
摘要
We focus on the verification of stabilizing programs using SMT solvers. SMT solvers have the potential to convert the verification problem into a satisfiability problem of a Boolean formula and utilize efficient techniques to determine whether it is satisfiable. In this work, we study the approach of utilizing techniques from bounded model checking to determine whether the given program is stabilizing.
更多查看译文
关键词
satisfiability problem,boolean formula,smt solvers,efficient technique,verification problem,brief announcement,bounded model checking,utilizing technique,model checking,verification
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要