Decision procedures for path feasibility of string-manipulating programs with complex operations
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11614
- Type
- D - Journal article
- DOI
-
10.1145/3290362
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- 49
- First page
- 1
- Volume
- 3
- Issue
- POPL
- ISSN
- 2475-1421
- Open access status
- Compliant
- 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
- This paper provides new decision procedures for solving the path feasibility problem (can a certain program path be reached) within programs that manipulate strings. The path feasibility problem plays an important role in symbolic execution and testing procedures. Our procedures were implemented in a tool that has been incorporated in a popular constraint solving tool, PRINCESS. The project led to Hague’s EPSRC grant (EP/T00021X/1, GBP390,000), https://gow.epsrc.ukri.org/NGBOViewGrant.aspx?GrantRef=EP/T00021X/1.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -