首页> 外文期刊>Theory and practice of logic programming >Analysis and Transformation of Constrained Horn Clauses for Program Verification
【24h】

Analysis and Transformation of Constrained Horn Clauses for Program Verification

机译:Analysis and Transformation of Constrained Horn Clauses for Program Verification

获取原文
           

摘要

This paper surveys recent work on applying analysis and transformation techniques that originatein the field of constraint logic programming (CLP) to the problem of verifying softwaresystems. We present specialization-based techniques for translating verification problems for differentprogramming languages, and in general software systems, into satisfiability problems forconstrained Horn clauses (CHCs), a term that has become popular in the verification field to referto CLP programs. Then, we describe static analysis techniques for CHCs that may be used forinferring relevant program properties, such as loop invariants. We also give an overview of sometransformation techniques based on specialization and fold/unfold rules, which are useful forimproving the effectiveness of CHC satisfiability tools. Finally, we discuss future developmentsin applying these techniques.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号