A type-directed abstraction refinement approach to higher-order model checking
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 147464865
- Type
- E - Conference contribution
- DOI
-
10.1145/2535838.2535873
- Title of conference / published proceedings
- POPL '2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
- First page
- 61
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- Year of publication
- 2014
- 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
- 11
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Before this paper, a higher-order model checker to scale to large systems was considered a "grand challenge in the field" [Broadbent and Kobayashi in CSL'13]. Our algorithm is now considered the modern approach to "proving properties of higher-order rewrite systems" by leading experts Bjorner, Gurfinkel, McMillan and Rybalchenko in their essay in Fields of Logic and Computation II. It became the basis of Kobayashi and Li's cutting-edge verifier for Featherweight Java, in LICS'15, and motivated Tsukada's unpublished work (http://www-kb.is.s.u-tokyo.ac.jp/~tsukada/) on negative types. It underpinned Ong's successful EPSRC proposal (EP/M023974/1) and led to the appointment of Ramsay at Bristol.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -