Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time
- Submitting institution
-
University College London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 16227
- Type
- D - Journal article
- DOI
-
10.1145/3371129
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- POPL
- First page
- 1
- Volume
- 4
- Issue
- POPL
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- December
- Year of publication
- 2019
- 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
-
5
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Solves a longstanding problem in the theory of Kleene Algebra with Tests: we characterized a fragment of the language in which equivalence can be decided in almost linear time without compromising the needed expressiveness for practical property specification and verification. This result was awarded a Distinguished paper award at POPL 2020 and I was invited to give a keynote at MFCS 2019 on this topic.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -