Decision procedures for path feasibility of string-manipulating programs with complex operations
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 154
- Type
- D - Journal article
- DOI
-
10.1145/3290362
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- -
- First page
- 1
- Volume
- 3
- Issue
- POPL
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2019
- URL
-
http://eprints.bbk.ac.uk/id/eprint/26184/
- 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)
-
1 - Algorithms, Verification and Software
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- String constraint solving is important in a wide range of areas, e.g. program analysis and web security. Previous studies either provide rather fragmented theoretical results on its decidability/complexity, or practical algorithms without completeness guarantees. This paper is significant in identifying novel semantic - as opposed to previously syntactic - conditions for string constraints which entail decidability, providing effective decision procedures with detailed complexity analysis and, importantly, efficient implementation as a new string solver. The experiments demonstrate the efficacy of the new solver compared with other competitive solvers. In contrast to previous work, our solver achieves efficiency without sacrificing theoretical guarantees.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -