Lattice-theoretic progress measures and coalgebraic model checking
- Submitting institution
-
University of Southampton
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 20750095
- Type
- E - Conference contribution
- DOI
-
10.1145/2837614.2837673
- Title of conference / published proceedings
- POPL '16 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages : 1
- First page
- 718
- Volume
- -
- Issue
- -
- ISSN
- 0730-8566
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2016
- 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
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper extends the algorithmic notion of progress measure, central to model checking fixpoint logics, from a qualitative to a quantitative setting. This is a key step towards expanding the correctness guarantees offered by automated verification techniques, to include optimality guarantees. The novel use of coalgebraic techniques makes the approach applicable to a variety of quantitative models. The potential applications are wide-reaching and include the quantitative synthesis of embedded/autonomous systems. The paper was published in a top theoretical computer science conference (23.4% acceptance rate) and has inspired work by other authors (e.g. https://dl.acm.org/ft_gateway.cfm?id=3290339) which further generalised quantitative progress measures.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -