What is decidable about string constraints with the ReplaceAll function
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28967538
- Type
- E - Conference contribution
- DOI
-
10.1145/3158091
- Title of conference / published proceedings
- Proceedings of the ACM on Programming Languages
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- 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
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work provided a new approach to string-constraint solving, which is a key developing topic in the highly successful area of Satisfiability Modulo Theories, which underpins modern and industrially viable program verification techniques such as symbolic execution. It appears in a flagship conference in the area (POPL) and has led to further work, including the development of a new, competitive string-constraint solving tool (OSTRICH), participation in the development of string-constraint solving standards (SMT-LIB) and a 3-year EPSRC grant studying regular expressions. The acceptance rate of the conference was 24%.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -