Journal article

What is decidable about string constraints with ReplaceAll function

Abstract:

The theory of strings with concatenation has been widely argued as the basis of constraint solving for verifying string-manipulating programs. However, this theory is far from adequate for expressing many string constraints that are also needed in practice; for example, the use of regular constraints (pattern matching against a regular expression), and the string-replace function (replacing either the first occurrence or all occurrences of a pattern'' string constant/variable/regular exp...

Publication status:
Published
Peer review status:
Peer reviewed

Publisher copy:
10.1145/3158091

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Funding agency for:
Chen, T
Grant:
EP/P00430X/1
More from this funder
Funding agency for:
Hague, M
Grant:
EP/K009907/1
More from this funder
Funding agency for:
Lin, A
Grant:
759969
Publisher:
Association for Computing Machinery Publisher's website
Journal:
Proceedings of the ACM on Programming Languages Journal website
Volume:
2
Issue:
POPL
Pages:
1-29
Publication date:
2017-12-27
Acceptance date:
2017-10-30
DOI:
ISSN:
2475-1421
Source identifiers:
734388
Keywords:
Pubs id:
pubs:734388
UUID:
uuid:343e996a-91ff-4dc9-a52d-c34607b7800b
Local pid:
pubs:734388
Deposit date:
2017-11-09

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP