Journal article
Decision procedures for path feasibility of string-manipulating programs with complex operations
- Abstract:
-
The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, with such applications as symbolic execution of programs with strings and automated detection of cross-site scripting (XSS) vulnerabilities in web applications. A (symbolic) path is given as a finite sequence of assignments and assertions (i.e. without loops), and checking its feasibility amounts to determining the existence of inputs that yield a succ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, 743.4KB, Terms of use)
-
- Publisher copy:
- 10.1145/3290362
Authors
- Publisher:
- Association for Computing Machinery
- Journal:
- Proceedings of the ACM on Programming Languages More from this journal
- Volume:
- 3
- Issue:
- POPL
- Article number:
- 49
- Publication date:
- 2019-01-02
- DOI:
- EISSN:
-
2475-1421
- Language:
-
English
- Keywords:
- Pubs id:
-
1105549
- Local pid:
-
pubs:1105549
- Deposit date:
-
2020-05-20
Terms of use
- Copyright holder:
- Chen et al.
- Copyright date:
- 2019
- Rights statement:
- © 2019 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution 4.0 International License
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record