Proceedings 5th Workshop on Horn Clauses for Verification and Synthesis

arXiv: Logic in Computer Science(2018)

引用 2|浏览5
暂无评分
摘要
Many Program Verification and Synthesis problems of interest can be modeled directly using clauses and many recent advances in the CLP and CAV communities have centered around efficiently solving problems presented as clauses. The HCVS series of workshops aims to bring together researchers working in the two communities of Constraint/Logic Programming (e.g., ICLP and CP), Program Verification (e.g., CAV, TACAS, and VMCAI), and Automated Deduction (e.g., CADE, IJCAR), on the topic of clause based analysis, verification, and synthesis. Horn clauses for verification and synthesis have been advocated by these communities in different times and from different perspectives and HCVS is organized to stimulate interaction and a fruitful exchange and integration of experiences.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要