{"title":"PolyHorn:多项式角条款求解器","authors":"Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Đorđe Žikelić","doi":"arxiv-2408.03796","DOIUrl":null,"url":null,"abstract":"Polynomial Horn clauses with existentially and universally quantified\nvariables arise in many problems of verification and program analysis. We\npresent PolyHorn which is a tool for solving polynomial Horn clauses in which\nvariables on both sides of the implication are real valued. Our tool provides a\nunified framework for polynomial Horn clause solving problems that arise in\nseveral papers in the literature. Our experimental evaluation over a wide range\nof benchmarks show the applicability of the tool as well as its benefits as\nopposed to simply using existing SMT solvers to solve such constraints.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PolyHorn: A Polynomial Horn Clause Solver\",\"authors\":\"Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Đorđe Žikelić\",\"doi\":\"arxiv-2408.03796\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Polynomial Horn clauses with existentially and universally quantified\\nvariables arise in many problems of verification and program analysis. We\\npresent PolyHorn which is a tool for solving polynomial Horn clauses in which\\nvariables on both sides of the implication are real valued. Our tool provides a\\nunified framework for polynomial Horn clause solving problems that arise in\\nseveral papers in the literature. Our experimental evaluation over a wide range\\nof benchmarks show the applicability of the tool as well as its benefits as\\nopposed to simply using existing SMT solvers to solve such constraints.\",\"PeriodicalId\":501197,\"journal\":{\"name\":\"arXiv - CS - Programming Languages\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Programming Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.03796\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.03796","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Polynomial Horn clauses with existentially and universally quantified
variables arise in many problems of verification and program analysis. We
present PolyHorn which is a tool for solving polynomial Horn clauses in which
variables on both sides of the implication are real valued. Our tool provides a
unified framework for polynomial Horn clause solving problems that arise in
several papers in the literature. Our experimental evaluation over a wide range
of benchmarks show the applicability of the tool as well as its benefits as
opposed to simply using existing SMT solvers to solve such constraints.