Decision procedures for path feasibility of string-manipulating programs with complex operations
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 33183251
- Type
- E - Conference contribution
- DOI
-
10.1145/3290362
- Title of conference / published proceedings
- Principles of Programming Languages
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- 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
-
4
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- String constraint solving is a key developing area in Satisfiability Modulo Theories (SMT). SMT underlies industrially viable modern verification techniques such as symbolic analysis, for which string is a fundamental data type. This paper introduces a new general approach to string solving implemented in a competitive new tool OSTRICH. This work has included participation in the string-solving community, with input to SMT-LIB standards. It has also led to a 3-year EPSRC grant on regular expressions. The work appears in a top conference (POPL) with an acceptance rate of 29%.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -