Complete First-Order Reasoning for Properties of Functional Programs-Reference-Cited by-同舟云学术

Complete First-Order Reasoning for Properties of Functional Programs

Published:2023-10-16 Issue:OOPSLA2 Volume:7 Page:1063-1092
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Murali Adithya¹^ORCID,Peña Lucas¹^ORCID,Jhala Ranjit²^ORCID,Madhusudan P.¹^ORCID

Affiliation:

1. University of Illinois Urbana-Champaign, Urbana, USA

2. University of California San Diego, San Diego, USA

Abstract

Several practical tools for automatically verifying functional programs (e.g., Liquid Haskell and Leon for Scala programs) rely on a heuristic based on unrolling recursive function definitions followed by quantifier-free reasoning using SMT solvers. We uncover foundational theoretical properties of this heuristic, revealing that it can be generalized and formalized as a technique that is in fact complete for reasoning with combined First-Order theories of algebraic datatypes and background theories, where background theories support decidable quantifier-free reasoning. The theory developed in this paper explains the efficacy of these heuristics when they succeed, explain why they fail when they fail, and the precise role that user help plays in making proofs succeed.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3622835

Reference79 articles.

1. Nada Amin , K. Rustan M. Leino , and Tiark Rompf . 2014. Computing with an SMT Solver . In Tests and Proofs, Martina Seidl and Nikolai Tillmann (Eds.). Springer International Publishing , Cham . 20–35. isbn:978-3-319-09099-3 Nada Amin, K. Rustan M. Leino, and Tiark Rompf. 2014. Computing with an SMT Solver. In Tests and Proofs, Martina Seidl and Nikolai Tillmann (Eds.). Springer International Publishing, Cham. 20–35. isbn:978-3-319-09099-3

2. Franz Baader and Silvio Ghilardi . 2005. Connecting Many-Sorted Theories . In Automated Deduction – CADE-20 , Robert Nieuwenhuis (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg . 278–294. isbn:978-3-540-3 1864 -4 Franz Baader and Silvio Ghilardi. 2005. Connecting Many-Sorted Theories. In Automated Deduction – CADE-20, Robert Nieuwenhuis (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 278–294. isbn:978-3-540-31864-4

3. Clark Barrett , Christopher L. Conway , Morgan Deters , Liana Hadarean , Dejan Jovanović , Tim King , Andrew Reynolds , and Cesare Tinelli . 2011. CVC4 . In Computer Aided Verification, Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 171–177. isbn:978-3-642-22110-1 Clark Barrett, Christopher L. Conway, Morgan Deters, Liana Hadarean, Dejan Jovanović, Tim King, Andrew Reynolds, and Cesare Tinelli. 2011. CVC4. In Computer Aided Verification, Ganesh Gopalakrishnan and Shaz Qadeer (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 171–177. isbn:978-3-642-22110-1

4. Jon Barwise . 1977. Handbook of Mathematical Logic . North-Holland Publishing Company , Amsterdam . Jon Barwise. 1977. Handbook of Mathematical Logic. North-Holland Publishing Company, Amsterdam.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proving Functional Program Equivalence via Directed Lemma Synthesis;Lecture Notes in Computer Science;2024-09-11

2. Predictable Verification using Intrinsic Definitions;Proceedings of the ACM on Programming Languages;2024-06-20