Succinct progress measures for solving parity games
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 6030
- Type
- E - Conference contribution
- DOI
-
10.1109/LICS.2017.8005092
- Title of conference / published proceedings
- 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- August
- 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
-
1
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- 3rd highest cited paper among those published 2015-2019 at LICS, a leading theoretical CS conference. Funded by a £750k EPSRC project, reviewed as "fundamental research, [with] a clear path connecting expected results to concrete industrial needs". A preliminary implementation is competitive with state-of-the-art solvers. Invited for keynote presentations at international conferences and summer schools (GandALF’17, SR’18, MOVEP’18, RP’18), and seminars (Bordeaux, Edinburgh, Paris Saclay, Oxford, Warsaw). Transformed the study of long-standing open problems on parity games and nested fixpoint evaluation by enabling new impactful techniques: universal trees and separating automata (LICS’18, SODA’19, CONCUR’19), and universal graphs (Colcombet&Fijalkow, FoSSaCS’19 keynote).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -