Higher-order constrained horn clauses for verification
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2041
- Type
- D - Journal article
- DOI
-
10.1145/3158099
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- -
- First page
- 11
- Volume
- 2
- Issue
- -
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- December
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- We introduce an automatic, programming language-independent approach to verifying safety properties of higher-order programs, by framing them as solvability problems for systems of a new class of constraints, Higher-order Constrained Horn Clauses (HoCHC). By adopting pure logic as the "neutral" interface, this approach separates the concerns of verification engineers and backend solver-builders, enabling exploitation of the successful combination of automated deduction technologies with the satisfiability checking of formulas. We present an efficient solver for HoCHC via an innovative refinement-type checking. This paper launched the Horn constraint approach to automatic verification of higher-order programs, leading to EPSRC research grant EP/T006595/1 (GBP366,930).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -