Polynomial reachability witnesses via Stellensätze
Author:
Affiliation:
1. Sharif University of Technology, Iran
2. IST Austria, Austria
3. Shanghai Jiao Tong University, China
4. Hong Kong University of Science and Technology, China
Funder
Huawei Technologies
Facebook
National Natural Science Foundation of China
Austrian Academy of Sciences
European Research Council
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3453483.3454076
Reference82 articles.
1. Mohammad Afzal Supratik Chakraborty Avriti Chauhan Bharti Chimdyalwar Priyanka Darke Ashutosh Gupta Shrawan Kumar Charles Babu M Divyesh Unadkat and R. Venkatesh. 2020. VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution). In TACAS. https://doi.org/10.1007/978-3-030-45237-7_25 10.1007/978-3-030-45237-7_25 Mohammad Afzal Supratik Chakraborty Avriti Chauhan Bharti Chimdyalwar Priyanka Darke Ashutosh Gupta Shrawan Kumar Charles Babu M Divyesh Unadkat and R. Venkatesh. 2020. VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution). In TACAS. https://doi.org/10.1007/978-3-030-45237-7_25 10.1007/978-3-030-45237-7_25
2. Aws Albarghouthi Arie Gurfinkel and Marsha Chechik. 2012. From Under-Approximations to Over-Approximations and Back. In TACAS. https://doi.org/10.1007/978-3-642-28756-5_12 10.1007/978-3-642-28756-5_12 Aws Albarghouthi Arie Gurfinkel and Marsha Chechik. 2012. From Under-Approximations to Over-Approximations and Back. In TACAS. https://doi.org/10.1007/978-3-642-28756-5_12 10.1007/978-3-642-28756-5_12
3. Ufo: A Framework for Abstraction- and Interpolation-Based Software Verification
4. Christophe Alias Alain Darte Paul Feautrier and Laure Gonnord. 2010. Multi-dimensional Rankings Program Termination and Complexity Bounds of Flowchart Programs. In SAS. https://doi.org/10.1007/978-3-642-15769-1_8 10.1007/978-3-642-15769-1_8 Christophe Alias Alain Darte Paul Feautrier and Laure Gonnord. 2010. Multi-dimensional Rankings Program Termination and Complexity Bounds of Flowchart Programs. In SAS. https://doi.org/10.1007/978-3-642-15769-1_8 10.1007/978-3-642-15769-1_8
5. Automata for modeling real-time systems
Cited by 21 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic;Lecture Notes in Computer Science;2024-09-11
2. Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs;Lecture Notes in Computer Science;2024-09-11
3. Falsification via Barrier Certificates;2024 American Control Conference (ACC);2024-07-10
4. Equivalence and Similarity Refutation for Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-06-20
5. Quantitative Bounds on Resource Usage of Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-04-29
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3