Higher-order constrained horn clauses for verification
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 147464864
- Type
- D - Journal article
- DOI
-
10.1145/3158099
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- 11
- First page
- -
- Volume
- 2
- Issue
- POPL
- 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)
-
D - Fundamentals of Computing
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper proposes an entirely new approach to higher-order program verification. The logic introduced in the paper has already been used by Ong's group in Oxford to solve a longstanding problem of lambda calculus, the decidability of Bohm tree equivalence, described by Walukiewicz in his recent SIGLOG survey as a question that "has been there from the beginning of the subject". This research has been the subject of several invited talks e.g. [Co-ALPTy'16] and forms the basis of a PhD studentship award from the NCSC (Edward Jones, ref 4214179) and EPSRC grant EP/T006595/1 (PI: Ramsay).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -